Abstract is missing.
- A Generalized Kahn Principle for Abstract Asynchronous NetworksSamson Abramsky. 1-21
- Operations on RecordsLuca Cardelli, John C. Mitchell. 22-52
- Connections between a Concrete and an Abstract Model of Concurrent SystemsEugene W. Stark. 53-79
- A Hierarchy of Domains for Real-Time Distributed ComputingGeorge M. Reed. 80-128
- Factorizing Proofs in Timed CSPJim Davies, Steve Schneider. 129-159
- Unbounded Nondeterminism in CSPA. W. Roscoe, Geoff Barrett. 160-193
- The Semantics of Priority and Fairness in occamGeoff Barrett. 194-208
- Inductively Defined Types in the Calculus of ConstructionsFrank Pfenning, Christine Paulin-Mohring. 209-228
- On Some Semantic Issues in the Reflective TowerKaroline Malmkjær. 229-246
- Semantic Models for Total Correctness and FairnessMichael G. Main, David L. Black. 247-270
- Equationally Fully Abstract Models of PCFAllen Stoughton. 271-283
- Generalization of Final Algebra Semantics by RelativizationLawrence S. Moss, Satish R. Thatte. 284-300
- Termination, Deadlock and DivergenceLuca Aceto, Matthew Hennessy. 301-318
- A Category-theoretic Semantics for Unbounded IndeterminacyPrakash Panangaden, James R. Russell. 319-332
- Algebraic Types in PER ModelsJ. M. E. Hyland, E. P. Robinson, Giuseppe Rosolini. 333-350
- Pseudo-Retract Functors for Local Lattices and Bifinite L-domainsElsa L. Gunter. 351-363
- L-domains and Lossless PowerdomainsRadha Jagadeesan. 364-372
- Does N+1 Times Prove More Programs Correct Than N Times ?Ana Pasztor. 373-389
- An Algebraic Formulation for Data RefinementA. John Power. 390-401
- Categorical Semantics for Programming LanguagesJifeng He, C. A. R. Hoare. 402-417
- Initial Algebra Semantics for Lambda CalculiJohn W. Gray. 418-439