Abstract is missing.
- A Foundational Delineation of Computational FeasiblityDaniel Leivant. 2-11
- Towards a Semantics for the QUEST LanguageFabio Alessi, Franco Barbanera. 12-21
- Term Declaration Logic and Generalised CompositaPeter Aczel. 22-30
- Logic Programming in a Fragment of Intuitionistic Linear LogicJoshua S. Hodas, Dale Miller. 32-42
- Games Semantics for Linear LogicYves Lafont, Thomas Streicher. 43-50
- Linearizing Intuitionistic ImplicationPatrick Lincoln, Andre Scedrov, Natarajan Shankar. 51-62
- Some Results on the Interpretation of lambda-calculus in Operator AlgebrasPasquale Malacaria, Laurent Regnier. 63-72
- Unification and Anti-Unification in the Calculus of ConstructionsFrank Pfenning. 74-85
- Partial Objects in the Calculus of ConstructionsPhilippe Audebaud. 86-95
- An Evaluation Semantics for Classical ProofsChetan R. Murthy. 96-107
- A Theory of Testing for Real-TimeRance Cleaveland, Amy E. Zwarico. 110-119
- Complexity Bounds of Hoare-style Proof SystemsHardi Hungar. 120-126
- Semantics of Pointers, Referencing and Dereferencing with Intensional LogicHing-Kai Hung, Jeffery I. Zucker. 127-136
- Sequentiality and Strong StabilityAntonio Bucciarelli, Thomas Ehrhard. 138-145
- Parallel PCF Has a Unique Extensional ModelAllen Stoughton. 146-151
- The Fixed Point Property in Synthetic Domain TheoryPaul Taylor 0002. 152-160
- On Computational Open-Endedness in Martin-Löf s Type TheoryDouglas J. Howe. 162-172
- Predicative Type Universes and Primitive RecursionNax Paul Mendler. 173-184
- Freyd s Hierarchy of Combinator MonoidsRichard Statman. 186-190
- Equational Prgoramming in lambda-calculusEnrico Tronci. 191-202
- An Inverse of the Evaluation Functional for Typed lambda-calculusUlrich Berger, Helmut Schwichtenberg. 203-211
- A Completeness Theorem for Kleene Algebras and the Algebra of Regular EventsDexter Kozen. 214-225
- On First Order Database Query LanguagesArnon Avron, Yoram Hirshfeld. 226-231
- Specifying and Proving Serializability in Temporal LogicDoron Peled, Shmuel Katz, Amir Pnueli. 232-244
- CCS with Priority ChoiceJuanito Camilleri, Glynn Winskel. 246-255
- Rabin Measures and Their Applications to Fairness and Automata TheoryNils Klarlund, Dexter Kozen. 256-265
- Specification and Refinement of Probabilistic ProcessesBengt Jonsson, Kim Guldstrand Larsen. 266-277
- On the 0-1 Law for the class of Existential Second Order Minimal Gödel Sentences with EqualityLeszek Pacholski, Wieslaw Szwast. 280-285
- On the Deduction Rule and the Number of Proof LinesMaria Luisa Bonet, Samuel R. Buss. 286-297
- Logic Programs as Types for Logic ProgramsThom W. Frühwirth, Ehud Y. Shapiro, Moshe Y. Vardi, Eyal Yardeni. 300-309
- A First-Order Theory of Types and Polymorphism in Logic ProgrammingMichael Kifer, James Wu. 310-321
- Prop revisited: Propositional Formula as Abstract Domain for Groundness AnalysisAgostino Cortesi, Gilberto Filé, William H. Winsborough. 322-327
- Constructive Negation for Constraint Logic ProgrammingPeter J. Stuckey. 328-339
- Higher-Order Critical PairsTobias Nipkow. 342-349
- A Computation Model for Executable Higher-Order Algebraic Specification LanguagesJean-Pierre Jouannaud, Mitsuhiro Okada. 350-361 [doi]
- Defaults and Revision in Structured TheoriesMark Ryan. 362-373
- Actions Speak Louder than Words: Proving Bisimilarity for Context-Free ProcessesHans Hüttel, Colin Stirling. 376-386
- On the Relationship Between Process Algebra and Input/Output AutomataFrits W. Vaandrager. 387-398
- A Compositional Proof System for Dynamic Process CreationFrank S. de Boer. 399-405
- A Partial Approach to Model CheckingPatrice Godefroid, Pierre Wolper. 406-415