Abstract is missing.
- Domains and Logics (Extended Abstract)Dana S. Scott. 4-5
- Non-trivial Power Types Can t Be Subtypes of Polymorphic TypesAndrew M. Pitts. 6-13
- Computational Lambda-Calculus and MonadsEugenio Moggi. 14-23
- Computing with Recursive Types (Extended Abstract)Stavros S. Cosmadakis. 24-38
- Stratified Polymorphism (Extended Summary)Daniel Leivant. 39-47
- Proof Theory and Semantics of Logic ProgramsHaim Gaifman, Ehud Y. Shapiro. 50-62
- Negation As RefutationMelvin Fitting. 63-70
- Fixpoint Extensions of First-Order Logic and Datalog-Like LanguagesSerge Abiteboul, Victor Vianu. 71-79
- PARTHENON: A Parallel Theorem Prover for Non-Horn ClausesSoumitra Bose, Edmund M. Clarke, David E. Long, Spiro Michaylov. 80-89
- Type Inference for Record Concatenation and Multiple InheritanceMitchell Wand. 92-97
- Computational Consequences and Partial Solutions of a Generalized Unification Problem (Partial Report)A. J. Kfoury, Jerzy Tiuryn, Pawel Urzyczyn. 98-105
- How Complete is PER?Edmund Robinson. 106-111
- Inheritance and Explicit Coercion (Preliminary Report)Val Tannen, Thierry Coquand, Carl A. Gunter, Andre Scedrov. 112-129
- Emil Post s Contributions to Computer ScienceMartin Davis. 134-136
- Towards Action-Refinement in Process AlgebrasLuca Aceto, Matthew Hennessy. 138-145
- A Small Universal Model for System ExecutionsJay L. Gischer. 146-153
- A Game-Theoretic Modeling of ConcurrencyYiannis N. Moschovakis. 154-163
- Nets and Data Flow InterpretersAlexander Moshe Rabinovich, Boris A. Trakhtenbrot. 164-174
- Axiomatizing Net Computations and ProcessesPierpaolo Degano, José Meseguer, Ugo Montanari. 175-185
- A Probabilistic Powerdomain of EvaluationsC. Jones, Gordon D. Plotkin. 186-195
- Equality In Lazy Computation SystemsDouglas J. Howe. 198-203
- Extending the Lambda Calculus with Surjective Pairing is ConservativeRoel C. de Vrijer. 204-215
- Faithful Ideal Models for Recursive Polymorphic TypesMartín Abadi, Benjamin C. Pierce, Gordon D. Plotkin. 216-225
- Structure and Representation in LFRobert Harper, Donald Sannella, Andrzej Tarlecki. 226-237
- The Mathematics of Nonmonotonic Reasoning (Abstract)Vladimir Lifschitz. 242
- On the Complexity of Epistemic ReasoningMoshe Y. Vardi. 243-252
- RI: A Logic for Reasoning with InconsistencyMichael Kifer, Eliezer L. Lozinskii. 253-262
- Non-Well-Founded Sets Obtained from Ideal Fixed PointsMichael W. Mislove, Lawrence S. Moss, Frank J. Oles. 263-272
- On Substitutional Recursion Over Non-Well-Founded SetsR. T. P. Fernando. 273-282
- Axiomatizing Operational Equivalence in the Presence of Side EffectsIan A. Mason, Carolyn L. Talcott. 284-293
- A Fully Abstract Semantics for a Functional Language with Logic VariablesRadha Jagadeesan, Prakash Panangaden, Keshav Pingali. 294-303
- Unified Algebras and InstitutionsPeter D. Mosses. 304-312
- Elf: A Language for Logic Definition and Verified MetaprogrammingFrank Pfenning. 313-322
- Some Complexity Bounds for Dynamic LogicsAlexei P. Stolboushkin. 324-332
- On Simultaneously Determinizing and Complementing omega-Automata (Extended Abstract)E. Allen Emerson, Charanjit S. Jutla. 333-342
- mu-Definable Sets of IntegersRobert S. Lubarsky. 343-352
- Compositional Model CheckingEdmund M. Clarke, David E. Long, Kenneth L. McMillan. 353-362
- Characterizing Complexity Classes By Higher Type Primitive Recursive DefinitionsAndreas Goerdt. 364-374
- Polynomially Grade Logic I: A Graded Version of System TAnil Nerode, Jeffrey B. Remmel, Andre Scedrov. 375-385
- ECC, an Extended Calculus of ConstructionsZhaohui Luo. 386-395
- A Sufficient Condition for the Termination of the Direct Sum of Term Rewriting SystemsAart Middeldorp. 396-401