65. Birthday: Robin Milner 1999

Gordon D. Plotkin, Colin Stirling, Mads Tofte (Eds.): Proof, Language, and Interaction, Essays in Honour of Robin Milner. The MIT Press 2000, ISBN 978-0-262-16188-6

Gordon D. Plotkin, Colin Stirling, Mads Tofte: A brief scientific biography of Robin Milner. 1-18

Semantic Foudations

Pierre-Louis Curien, Gordon D. Plotkin, Glynn Winskel: Bistructures, bidomains, and linear logic. 21-54
Samson Abramsky: Axioms for definability and full completeness. 55-76
C. A. R. Hoare, Jifeng He, Augusto Sampaio: Algebraic derivation of an operational semantics. 77-98
Jaco de Bakker, Franck van Breugel: From Banach to Milner: metric semantics for second order communication and concurrency. 99-132
Fabio Gadducci, Ugo Montanari: The tile model. 133-166

Programming Logic

Mike Gordon: From LCF to HOL: a short history. 169-186
Lawrence C. Paulson: A fixedpoint approach to (co)inductive and (co)datatype definitions. 187-212
Robert L. Constable, Paul B. Jackson, Pavel Naumov, Juan C. Uribe: Constructively formalizing automata theory. 213-238
Gérard P. Huet, Amokrane Saïbi: Constructive category theory. 239-276
Pierre Collette, Cliff B. Jones: Enhancing the tractability of rely/guarantee specifications in the development of interfering operations. 277-308
Sergey Berezin, Edmund M. Clarke, Somesh Jha, Will Marrero: Model checking algorithms for the µ-calculus. 309-338

Programming Languages

Robert Harper, Christopher A. Stone: A type-theoretic interpretation of standard ML. 341-388
Mads Tofte, Lars Birkedal: Unification and polymorphism in region inference. 389-424
Gérard Berry: The foundations of Esterel. 425-454
Benjamin C. Pierce, David N. Turner: Pict: a programming language based on the Pi-Calculus. 455-494

Concurrency

Yoram Hirshfeld, Faron Moller: On the star height of unary regular behaviours. 497-510
William Ferreira, Matthew Hennessy, Alan Jeffrey: Combining the typed lambda-calculus with CCS. 511-534
Jos C. M. Baeten, Jan A. Bergstra, Michel A. Reniers: Discrete time process algebra with silent step. 535-570
Eugene W. Stark, Scott A. Smolka: A complete axiom system for finite-state probabilistic processes. 571-596

Mobility

Uffe Engberg, Mogens Nielsen: A calculus of communicating systems with label passing - ten years after. 599-622
Joachim Parrow: Trios in concert. 623-638
Xinxin Liu, David Walker: Concurrent objects as mobile processes. 639-658
Gérard Boudol, Cosimo Laneve: lambda-calculus, multiplicities, and the pi-calculus. 659-690
Davide Sangiorgi: Lazy functions and mobile processes. 691-720