Abstract is missing.
- Specification and Top Down Design of Distributed SystemsManfred Broy. 4-28
- Specification Languages for Distributed SystemsPierpaolo Degano, Ugo Montanari. 29-51
- Semantically Based Programming Tools (Summary)William L. Scherlis, Dana S. Scott. 52-59
- From Function Level Semantics to Program Transformation and OptimizationJohn W. Backus. 60-91
- Inductively Defined Functions (Extended Abstract)Rod M. Burstall. 92-96
- Three Approaches to Type StructureJohn C. Reynolds. 97-138
- On the Maximum Size of Random TreesMarco Protasi, Maurizio Talamo. 139-144
- Fast Searching in a Real Algebraic Manifold with Applications to Geometric ComplexityBernard Chazelle. 145-156
- Typed Categorial Combinatory LogicPierre-Louis Curien. 157-172
- A Path Ordering for Proving Termination of Term Rewriting SystemsDeepak Kapur, Paliath Narendran, G. Sivakumar. 173-187
- A Rewrite Rule Based Approach for Synthesizing Abstract Data TypesDeepak Kapur, Mandayam K. Srivas. 188-207
- Delayability in Proofs of Strong Normalizability in the Typed Lambda CalculusMichael Karr. 208-222
- Bisimulations and Abstraction HomomorphismsIlaria Castellani. 223-238
- A Metric Characterization of Fair Computations in CCSGerardo Costa. 239-252
- A Complete Modal Proof System for a Subset of SCCSColin Sterling. 253-266
- Amalgamation of Graph Transformations with Applications to SynchronizationPaul Boehm, Harald-Reto Fonio, Annegret Habel. 267-283
- Decompilation of Control Structures by Means of Graph TransformationsUlrike Lichtblau. 284-297
- Synchronized Bottom-Up Tree Automata and L-SystemsEmanuela Fachini, Margherita Napoli. 298-307
- On Observational Equivalence and Algebraic SpecificationDonald Sannella, Andrzej Tarlecki. 308-322
- Parameter Preserving Data Type SpecificationsPeter Padawitz. 323-341
- On the Parameterized Algebraic Specification of Concurrent SystemsEgidio Astesiano, Gianfranco Mascari, Gianna Reggio, Martin Wirsing. 342-358
- The Semantics of Shared Submodules SpecificationsEdward K. Blum, Francesco Parisi-Presicce. 359-373
- Why Horn Formulas Matter in Computer Science: Initial Structures and Generic Examples (Extended Abstract)Johann A. Makowsky. 374-387
- On the Implementation of Abstract Data Types by Programming Language ConstructsAxel Poigné, Josef Voss. 388-402
- A Lisp Compiler for FP Language and Its Proof via Algebraic SemanticsChristine Choppy, G. Guiho, Stéphane Kaplan. 403-415