Abstract is missing.
- The Algebra of Functional Programs: Function Level Reasoning, Linear Equations, and Extended DefinitionsJohn Backus. 1-43
- The VDM Principles of Software Specification and Program DesignDines Bjørner. 44-74
- Attribute Grammars: Theory and ApplicationsBruno Courcelle. 75-95
- Compiler Generation from Formal Definition of Programming Languages: A SurveyMarie-Claude Gaudel. 96-114
- Formal Behavioural Specification of Concurrent Systems Without Globality AssumptionsPeter E. Lauer, M. W. Shields, John Yiannis Cotronis. 115-151
- A Birkhoff-Like Theorem for Algebraic Classes of Interpretations of Program SchemesJosé Meseguer. 152-168
- Building Data Base Management Systems Through Formal SpecificationErich J. Neuhold, Th. Olnhoff. 169-209
- Reducing Types in Applicative Languages with Structured DataEgidio Astesiano, Gerardo Costa. 210-217
- On the Definition of Lamda-Calculus ModelsGérard Berry. 218-230
- About Data Type GenericityDidier Bert, Roger Soler. 231-243
- On the Algebraic Extensions of Abstract Data TypesManfred Broy, Martin Wirsing. 244-251
- Scenarios: A Model of Non-Determinate ComputationJ. Dean Brock, William B. Ackerman. 252-259
- An Operational Semantics for a Language with Early Completion Data StructuresJack B. Dennis. 260-267
- Le Calcul des Fermetures dans les Lamda-LangagesJean-Louis Durieux. 268-279
- Distributed Termination with Interval AssertionsN. Frances, Michael Rodeh, Michel Sintzoff. 280-291
- Algebraic Denotational Semantics Using Parameterized Abstract ModulesJoseph A. Goguen, Kamran Parsaye-Ghomi. 292-309
- Relational Semantics of Strongly Communicating Sequential ProcessesPedro Guerreiro. 310-326
- A Construction of Concurrent Systems by Means of Sequential Solutions and Concurrency RelationsRyszard Janicki. 327-334
- The Development of an Interpreter by Means of Abstract Algebraic Software SpecificationsHerbert Klaeren, Heiko Petzsch. 335-346
- A Formal Model of an Interpreter for Nonprocedural LanguagesJuan M. Lafuente. 347-355
- A Proof Theoretic Methodology for Propositional Dynamic LogicDaniel Leivant. 356-373
- FP Systems in Edinburgh LCFJacek Leszczylowski. 374-386
- A Proposal for Operational Semantics and Equivalence of Finite Asynchronous ProcessesLuis Mejia. 387-400
- An Extension to Horn Clause Logic Allowing the Definition of Concurrent ProcessesLuís Monteiro. 401-407
- A Semantic Algebra for Binding ConstructsPeter D. Mosses. 408-418
- On the Representation of Data TypesFernando Orejas. 419-431
- An Approach to Communications and Parallelism in Applicative LanguagesAlberto Pettorossi. 432-446
- Using Last Fixed Points to Characterize Formal Computations of Non-Deterministic EquationsAxel Poigné. 447-459
- Formal Representations for Recursively Defined Functional ProgramsJohn H. Williams. 460-470
- Petri Nets and Concurrency-Like RelationsPiotr W. Prószynski. 471-478