Abstract is missing.
- A Semantics for Type CheckingGordon D. Plotkin. 1-17
- Type Inference in Polymorphic Type DisciplinePaola Giannini, Simona Ronchi Della Rocca. 18-37
- Monotone Recursive Definition of Predicates and Its Realizability InterpretationMakoto Tatsuta. 38-52
- Adding Proof Objects and Inductive Definition Mechanisms to Frege StructuresMasahiko Sato. 53-87
- From Term Models to DomainsWesley Phoa. 88-111
- An Abstract Interpretation for ML Equality KindsCarl A. Gunter, Elsa L. Gunter, David B. MacQueen. 112-130
- Full Abstraction and the Context LemmaTrevor Jim, Albert R. Meyer. 131-151
- An Efficiency Preorder for ProcessesS. Arun-Kumar, Matthew Hennessy. 152-175
- On Nets, Algebras and ModularityAlexander Moshe Rabinovich, Boris A. Trakhtenbrot. 176-203
- Towards a Complete Hierarchy of Compositional Dataflow ModelsBengt Jonsson, Joost N. Kok. 204-225
- Type Theory as a Foundation for Computer ScienceRobert L. Constable. 226-243
- What is in a Step: On the Semantics of StatechartsAmir Pnueli, M. Shalev. 244-264
- Proving Termination of General Prolog ProgramsKrzysztof R. Apt, Dino Pedreschi. 265-289
- On Abstraction and the Expressive Power of Programming LanguagesJohn C. Mitchell. 290-310
- Role of Logic Programming in the FGCS ProjectKazuhiro Fuchi, Koichi Furukawa. 311-325
- Authentication and Delegation with Smart-cardsMartín Abadi, Michael Burrows, C. Kaufman, Butler W. Lampson. 326-345
- Data Flow Analysis as Model CheckingBernhard Steffen. 346-365
- On the Adequacy of Dependence-Based Representations for Programs with HeapsPhil Pfeiffer, Rebecca Parsons Selke. 365-386
- From Programming-by-Example to Proving-by-ExampleMasami Hagiya. 387-419
- From LP to LP: Programming with ConstraintsJean-Louis Lassez. 420-446
- Polynomial Recursion Analysis in Pascal Like ProgramsDieter Armbruster. 447-458
- Complexity of Proving Program CorrectnessHardi Hungar. 459-474
- Some Normalization Properties of Martin-Löf s Type Theory, and ApplicationsDavid A. Basin, Douglas J. Howe. 475-494
- Parametricity of Extensionally Collapsed Term Models of Polymorphism and Their Categorical PropertiesRyu Hasegawa. 495-512
- Programs with Continuations and Linear LogicShin-ya Nishizaki. 513-531
- Pi-Calculus Semantics of Object-Oriented Programming LanguagesDavid Walker. 532-547
- Wrapper Semantics of an Object-Oriented Programming Language with StateAndreas V. Hense. 548-568
- Sharing Actions and Attributes in Modal Action LogicMark Ryan, José Luiz Fiadeiro, T. S. E. Maibaum. 569-593
- First Order Data Types and First Order LogicRalf Treinen. 594-614
- Efficient Program Synthesis: Semantics, Logic, ComplexityMax I. Kanovich. 615-632
- Principal Type-Schemes of BCI-Lambda-TermsSachio Hirokawa. 633-650
- Intersection and Union TypesFranco Barbanera, Mariangiola Dezani-Ciancaglini. 651-674
- The Coherence of Languages with Intersection TypesJohn C. Reynolds. 675-700
- Singleton, Union and Intersection Types for Program ExtractionSusumu Hayashi. 701-730
- Subtyping + Extensionality: Confluence of beta-eta-top reduction in F::<=::Pierre-Louis Curien, Giorgio Ghelli. 731-749
- An Extension of System F with SubtypingLuca Cardelli, Simone Martini, John C. Mitchell, Andre Scedrov. 750-770
- Will Logicians be Replaced by Machines?Dana S. Scott. 771