Abstract is missing.
- Third Order Matching is DecidableGilles Dowek. 2-10
- Double-exponential Complexity of Computing a Complete Set of AC-UnifiersDeepak Kapur, Paliath Narendran. 11-21
- Random Worlds and Maximum EntropyAdam J. Grove, Joseph Y. Halpern, Daphne Koller. 22-33
- Minimal Model Semantics for Nonmonotonic Modal LogicsGrigori Schwarz. 34-43
- Fixpoint Logic vs. Infinitary Logic in Finite-Model TheoryPhokion G. Kolaitis, Moshe Y. Vardi. 46-57
- Deterministic vs. Nondeterministic Transitive Closure LogicErich Grädel, Gregory L. McColm. 58-63
- Axiomatizable Classes of Finite Models and Definability of Linear OrderAlexei P. Stolboushkin. 64-70
- An abstract standardisation theoremGeorges Gonthier, Jean-Jacques Lévy, Paul-André Melliès. 72-81
- A Constructive Formalization of the Catch and Throw MechanismHiroshi Nakano. 82-89
- A Computational Analysis of Girard s Translation and LCChetan R. Murthy. 90-101
- The Lazy Lambda Calculus in a Concurrency Scenario (Extended Abstract)Davide Sangiorgi. 102-109
- Specification in Software DevelopmentJeannette M. Wing. 112
- Turning SOS Rules into EquationsLuca Aceto, Bard Bloom, Frits W. Vaandrager. 113-124
- A Calculus of Dataflow Networks (Extended Abstract)Eugene W. Stark. 125-136
- Asynchronous Communication in Process AlgebraFrank S. de Boer, Jan Willem Klop, Catuscia Palamidessi. 137-147
- Equivalences on Observable ProcessesIrek Ulidowski. 148-159
- The Type and Effect DisciplineJean-Pierre Talpin, Pierre Jouvelot. 162-173
- Disjunctive Strictness AnalysisThomas P. Jensen. 174-185
- References, Local Variables and Operational ReasoningIan A. Mason, Carolyn L. Talcott. 186-197
- Horn Programming in Linear Logic Is NP-CompleteMax I. Kanovich. 200-210
- New Foundations for the Geometry of InteractionSamson Abramsky, Radha Jagadeesan. 211-222
- Linear Logic Without BoxesGeorges Gonthier, Martín Abadi, Jean-Jacques Lévy. 223-234
- Operational aspects of linear lambda calculusPatrick Lincoln, John C. Mitchell. 235-246
- Origins of the Calculus of Binary RelationsVaughan R. Pratt. 248-254
- Decidable Problems in Shallow Equational Theories (Extended Abstract)Hubert Comon, Marianne Haberstrau, Jean-Pierre Jouannaud. 255-265
- Monadic Theory of Term RewritingsDidier Caucal. 266-273
- Strong Sequentiality of Left-Linear Overlapping Term Rewriting SystemsYoshihito Toyama. 274-284
- There is No Recursive Axiomatization for Feasible Functionals of Type~2Anil Seth. 286-295
- Cutting Planes and constant depth Frege proofsPeter Clote. 296-307
- Subtype InequalitiesJerzy Tiuryn. 308-315
- An Engine for Logic Program AnalysisNevin Heintze, Joxan Jaffar. 318-328
- Solving Systems of Set Constraints (Extended Abstract)Alexander Aiken, Edward L. Wimmers. 329-340
- The Category of Constraint Systems is Cartesian-ClosedVijay A. Saraswat. 341-345
- Generalized Quantifiers and Pebble Games on Finite StructuresPhokion G. Kolaitis, Jouko A. Väänänen. 348-359
- Logical Hierarchies in PTIMELauri Hella. 360-368
- Zero-One Laws for Modal LogicJoseph Y. Halpern, Bruce M. Kapron. 369-380
- Progress Measures, Immediate Determinacy, and a Subset Construction for Tree AutomataNils Klarlund. 382-393
- Symbolic Model Checking for Real-time SystemsThomas A. Henzinger, Xavier Nicollin, Joseph Sifakis, Sergio Yovine. 394-406
- Compiler Verification in LFJohn Hannan, Frank Pfenning. 407-418
- Mixing List Recursion and ArithmeticLaurent Fribourg. 419-429
- Observable Algorithms on Concrete Data StructuresPierre-Louis Curien. 432-443
- Functorial ParametricityPeter J. Freyd, E. P. Robinson, Giuseppe Rosolini. 444-452
- The Church-Rosser Property for beta-eta-reduction in Typed lambda-CalculiHerman Geuvers. 453-460
- Retracts in simply typed lambda-beta-eta-calculusUgo de Liguoro, Adolfo Piperno, Richard Statman. 461-469