Abstract is missing.
- Some Uses of Maximal Fixed Points (Abstract of Invited Lecture)Robin Milner. 3
- Polymorphism is conservative over simple types (Preliminary Report)Val Tannen, Albert R. Meyer. 7-17
- Order-Sorted Algebra solves the Constructor-Selector, MultipleJoseph A. Goguen, José Meseguer. 18-29
- Recursive Types and Type Constraints in Second-Order Lambda CalculusN. P. Mendler. 30-36
- Complete Type Inference for Simple ObjectsMitchell Wand. 37-44
- Domain Theory in Logical FormSamson Abramsky. 47-53
- On the Formal Semantics of Statecharts (Extended Abstract)David Harel, Amir Pnueli, Jeanette P. Schmidt, Rivi Sherman. 54-64
- Modelling Computations: A 2-Categorical FrameworkR. A. G. Seely. 65-71
- Partial Order Models of Concurrency and the Computation of FunctionsHaim Gaifman, Vaughan R. Pratt. 72-85
- Minimalism subsumes Default Logic and Circumscription in Stratified Logic ProgrammingNicole Bidoit, Christine Froidevaux. 89-97
- Hereditary Harrop Formulas and Uniform Proof SystemsDale Miller, Gopalan Nadathur, Andre Scedrov. 98-105
- Undecidable Optimization Problems for Database Logic ProgramsHaim Gaifman, Harry G. Mairson, Yehoshua Sagiv, Moshe Y. Vardi. 106-115
- Conjunctive Types and Algol-like LanguagesJ. Reynolds. 119
- The Power of Temporal ProofsMartín Abadi. 123-130
- Proving Boolean Combinations of Deterministic PropertiesBowen Alpern, Fred B. Schneider. 131-137
- Reasoning with Many ProcessesA. Prasad Sistla, Steven M. German. 138-152
- On the Eventuality Operator in Temporal LogicA. Prasad Sistla, Lenore D. Zuck. 153-166
- Verification of Concurrent Programs: The Automata-Theoretic FrameworkMoshe Y. Vardi. 167-176
- First-order Predicate Logic as a Common Basis for Relational and Functional Programming (Abstract)Maarten H. van Emden. 179
- Partial Objects In Constructive Type TheoryRobert L. Constable, Scott F. Smith. 183-193
- A Framework for Defining LogicsRobert Harper, Furio Honsell, Gordon D. Plotkin. 194-204
- The Computational Behaviour of Girard s ParadoxDouglas J. Howe. 205-214
- A Non-Type-Theoretic Definition of Martin-Löf s TypesStuart Allen. 215-221
- The Hierarchy of Finitely Typed Functional Programs (Short Version)A. J. Kfoury, Jerzy Tiuryn, Pawel Urzyczyn. 225-235
- Definability with Bounded Number of Bound VariablesNeil Immerman, Dexter Kozen. 236-244
- On Chain Logic, Path Logic, and First-Order Logic over Infinite TreesWolfgang Thomas. 245-256
- Full Abstraction and Expressive Completenes for FPJoseph Y. Halpern, Edward L. Wimmers. 257-271
- A Semantical Approach to Nonmonotic LogicsYoav Shoham. 275-279
- I m OK if You re OK: On the Notion of Trusting CommunicationRonald Fagin, Joseph Y. Halpern. 280-292
- Hoare Logic for Lambda-Terms as Basis of Hoare Logic for Imperative LanguagesAndreas Goerdt. 293-299
- Kripke-Style models for typed lambda calculusJohn C. Mitchell, Eugenio Moggi. 303-314
- Some Semantic Aspects of Polymorphic Lambda CalculusPeter J. Freyd, Andre Scedrov. 315-319
- X-Separability and Left-Invertibility in lambda-calculusCorrado Böhm, Enrico Tronci. 320-328
- Inference Rules for Rewrite-Based First-Order Theorem ProvingLeo Bachmair, Nachum Dershowitz. 331-337
- Theorem Proving Using Rigid E-Unification Equational MatingsJean H. Gallier, Stan Raatz, Wayne Snyder. 338-346
- Solving DisequationsClaude Kirchner, Pierre Lescanne. 347-352
- Decidability of the Confluence of Ground Term Rewriting SystemsMax Dauchet, Sophie Tison, Thierry Heuillard, Pierre Lescanne. 353-359