Abstract is missing.
- Full Abstraction for PCFSamson Abramsky, Pasquale Malacaria, Radha Jagadeesan. 1-15
- Fully Abstract Semantics for Concurrent Lambda-calculusMariangiola Dezani-Ciancaglini, Ugo de Liguoro, Adolfo Piperno. 16-35
- An Operational Approach to Combining Classical Set Theory and Functional Programming LanguagesDouglas J. Howe, Scott D. Stoller. 36-55
- ML Typing, Explicit Polymorphism and Qualified TypesMark P. Jones. 56-75
- Extensions to Type Systems Can Preserve Operational EquivalencesJon G. Riecke, Ramesh Subrahmanyam. 76-95
- Constraint Programming and Database Query LanguagesParis C. Kanellakis, Dina Q. Goldin. 96-120
- Intuitionistic Resolution for a Logic Programming Language with Scoping ConstructsAlain Hui-Bon-Hoa. 121-140
- Proof by PointingYves Bertot, Gilles Kahn, Laurent Théry. 141-160
- A Computer-Checked Verification of Milner s SchedulerHenri Korver, Jan Springintveld. 161-178
- A Purely Functional Language with Encapsulated AssignmentMasahiko Sato. 179-202
- Simple Termination of Hierarchical Combinations of Term Rewriting SystemsM. R. K. Krishna Rao. 203-223
- Separate Abstract Interpretation for Control-Flow AnalysisYan Mei Tang, Pierre Jouvelot. 224-243
- Extensible Denotational Language SpecificationsRobert Cartwright, Matthias Felleisen. 244-272
- A Normalizing Calculus with Overloading and SubtypingHideki Tsuiki. 273-295
- A Theory of Primitive Objects - Untyped and First-Order SystemsMartín Abadi, Luca Cardelli. 296-320
- Programming Objects with ML-ART, an Extension to ML with Abstract and Record TypesDidier Rémy. 321-346
- A Type System for a Lambda Calculus with AssignmentsKung Chen, Martin Odersky. 347-364
- Theory and Practice of Concurrent Object-Oriented ComputingAkinori Yonezawa. 365
- The Family Relation in Interaction SystemsAndrea Asperti, Cosimo Laneve. 366-384
- On Syntactic and Semantic Action RefinementUrsula Goltz, Roberto Gorrieri, Arend Rensink. 385-404
- Locality and True-concurrency in Calculi for Mobile ProcessesDavide Sangiorgi. 405-424
- Term Rewriting Properties of SOS AxiomatisationsD. J. B. Bosscher. 425-439
- The Tyft/Tyxt Format Reduces to Tree RulesWan Fokkink. 440-453
- Undecidable Equivalences for Basic Parallel ProcessesHans Hüttel. 454-464
- Normal Proofs and Their GrammarMasako Takahashi, Yohji Akama, Sachio Hirokawa. 465-493
- A Symmetric Lambda Calculus for Classical Program ExtractionFranco Barbanera, Stefano Berardi. 495-515
- The Lambda::Delta::-calculusJakob Rehof, Morten Heine Sørensen. 516-542
- Syntactic Definitions of Undefined: On Defining the UndefinedZena M. Ariola, Richard Kennaway, Jan Willem Klop, M. Ronan Sleep, Fer-Jan de Vries. 543-554
- Discovering Needed Reductions Using Type TheoryPhilippa Gardner. 555-574
- Nontraditional Applications of Automata TheoryMoshe Y. Vardi. 575-597
- Abstract Pre-OrdersKim Ritter Wagner. 598-617
- Categorical Models of Relational Databases I: Fibrational Formulation, Schema IntegrationAmitavo Islam, Wesley Phoa. 618-641
- Petri Nets, Horn Programs, Linear Logic, and Vector GamesMax I. Kanovich. 642-666
- A Complete Type Inference System for Subtyped Recursive TypesTatsurou Sekiguchi, Akinori Yonezawa. 667-686
- Subtyping with Union Types, Intersection Types and Recursive TypesFlemming M. Damm. 687-706
- A Decidable Intersection Type System based on RelevanceFerruccio Damiani, Paola Giannini. 707-725
- Temporal Verification DiagramsZohar Manna, Amir Pnueli. 726-765
- A Semantic Theory for Concurrent MLDominique Bolignano, Mourad Debbabi. 766-785
- Replication in Concurrent CombinatorsKohei Honda, Nobuko Yoshida. 786-805
- Transitions as Interrupts: A New Semantics for Timed StatechartsAdriano Peron, Andrea Maggiolo-Schettini. 806-821
- Relating Multifunctions and Predicate Transformers through Closure OperatorsMarcello M. Bonsangue, Joost N. Kok. 822-843
- Notes on Typed Object-Oriented ProgrammingKathleen Fisher, John C. Mitchell. 844-885
- Observing Truly Concurrent ProcessesAlbert R. Meyer. 886