Proof, language, and interaction : essays in honour of Robin Milner / edited by Gordon Plotkin, Colin Stirling, and Mads Tofte.

Cambridge, Mass. : MIT Press, [2000], ©2000.
xiv, 722 pages : illustrations ; 24 cm.


Foundations of computing. [More in this series]
Bibliographic references
Includes bibliographical references.
  • A Brief Scientific Biography of Robin Milner
  • 1. Bistructures, Bidomains, and Linear Logic / Pierre-Louis Curien, Gordon Plotkin and Glynn Winskel
  • 2. Axioms for Definability and Full Completeness / Samson Abramsky
  • 3. Algebraic Derivation of an Operational Semantics / C. A. R. Hoare, He Jifeng and Augusto Sampaio
  • 4. From Banach to Milner: Metric Semantics for Second Order Communication and Concurrency / Jaco de Bakker and Franck van Breugel
  • 5. The Tile Model / Fabio Gadducci and Ugo Montanari
  • 6. From LCF to HOL: A Short History / Mike Gordon
  • 7. A Fixedpoint Approach to (Co)Inductive and (Co)Datatype Definitions / Lawrence C. Paulson
  • 8. Constructively Formalizing Automata Theory / Robert L. Constable, Paul B. Jackson and Pavel Naumov / [et al.]
  • 9. Constructive Category Theory / Gerard Huet and Amokrane Saibi --
  • 10. Enhancing the Tractability of Rely/Guarantee Specifications in the Development of Interfering Operations / Pierre Collette and Cliff B. Jones
  • 11. Model Checking Algorithms for the [mu]-Calculus / Sergey Berezin, Edmund Clarke and Somesh Jha / [et al.]
  • 12. A Type-Theoretic Interpretation of Standard ML / Robert Harper and Christopher Stone
  • 13. Unification and Polymorphism in Region Inference / Mads Tofte and Lars Birkedal
  • 14. The Foundations of Esterel / Gerard Berry
  • 15. Pict: A Programming Language Based on the Pi-Calculus / Benjamin C. Pierce and David N. Turner
  • 16. On the Star Height of Unary Regular Behaviours / Yoram Hirshfeld and Faron Moller
  • 17. Combining the Typed [lambda]-Calculus with CCS / William Ferreira, Mathew Hennessy and Alan S. A. Jeffrey
  • 18. Discrete Time Process Algebra with Silent Step / J. C. M. Baeten, J. A. Bergstra and M. A. Reniers --
  • 19. A Complete Axiom System for Finite-State Probabilistic Processes / Eugene W. Stark and Scott A. Smolka
  • 20. A Calculus of Communicating Systems with Label Passing - Ten Years After / Uffe H. Engberg and Mogens Nielsen
  • 21. Trios in Concert / Joachim Parrow
  • 22. Concurrent Objects as Mobile Processes / Xinxin Liu and David Walker
  • 23. [lambda]-Calculus, Multiplicities, and the [pi]-Calculus / Gerard Boudol and Cosimo Laneve
  • 24. Lazy Functions and Mobile Processes / Davide Sangiorgi.
0262161885 (hc : alk. paper)
C - S
Statement on language in description
Princeton University Library aims to describe library materials in a manner that is respectful to the individuals and communities who create, use, and are represented in the collections we manage. Read more...

Supplementary Information