Abstract is missing.
- Terms, Proofs, and Refinement (Extended abstract)Rod M. Burstall. 2-7
- McColm s ConjectureYuri Gurevich, Neil Immerman, Saharon Shelah. 10-19
- The Expressive Power of Finitely Many Generalized QuantifiersAnuj Dawar, Lauri Hella. 20-29
- Generalized Quantifiers for Simple PropertiesMartin Otto. 30-39
- How to Define a Linear Order on Finite ModelsLauri Hella, Phokion G. Kolaitis, Kerkko Luosto. 40-49
- Finitary FairnessRajeev Alur, Thomas A. Henzinger. 52-61
- Bisimulation is Not Finitely (First Order) Equationally AxiomatisablePeter Sewell. 62-70
- Foundations of Timed Concurrent Constraint ProgrammingVijay A. Saraswat, Radha Jagadeesan, Vineet Gupta. 71-80
- A Fully Abstract Semantics for Concurrent Graph ReductionAlan Jeffrey. 82-91
- An Axiomatization of Computationally Adequate Domain Theoretic Models of FPCMarcelo P. Fiore, Gordon D. Plotkin. 92-102
- On Strong Stability and Higher-Order SequentialityLoïc Colson, Thomas Ehrhard. 103-108
- Linear Types, Approximation, and TopologyMichael Huth, Achim Jung, Klaus Keimel. 110-114
- Domain Theory and IntegrationAbbas Edalat. 115-124
- Automatic Verification of Finite-State Concurrent SystemsEdmund M. Clarke. 126
- Negative Set Constraints with EqualityWitold Charatonik, Leszek Pacholski. 128-136
- Systems of Set Constraints with Negative Constraints are NEXPTIME-CompleteKjartan Stefánsson. 137-141
- A Compositional Proof System for the Modal mu-CalculusHenrik Reif Andersen, Colin Stirling, Glynn Winskel. 144-153
- On the Parallel Complexity of Model Checking in the Modal Mu-CalculusShipei Zhang, Oleg Sokolsky, Scott A. Smolka. 154-163
- Complexity Transfer for Modal Logic (Extended Abstract)Edith Hemaspaandra. 164-173
- Typability and Type-Checking in the Second-Order lambda-Calculus are Equivalent and UndecidableJ. B. Wells. 176-185
- Efficient Inference of Object TypesJens Palsberg. 186-195
- Type Inference and ExtensionalityAdolfo Piperno, Simona Ronchi Della Rocca. 196-205
- The Groupoid Model Refutes Uniqueness of Identity ProofsMartin Hofmann, Thomas Streicher. 208-212
- A Non-Elementary Speed-Up in Proof Length by Structural Clause Form TransformationMatthias Baaz, Christian G. Fermüller, Alexander Leitsch. 213-219
- Upper and Lower Bounds for Tree-Like Cutting Planes ProofsRussell Impagliazzo, Toniann Pitassi, Alasdair Urquhart. 220-228
- The Power of Reflective Relational MachinesSerge Abiteboul, Christos H. Papadimitriou, Victor Vianu. 230-240
- A Syntactic Characterization of NP-CompletenessJ. Antonio Medina, Neil Immerman. 241-250
- The Declarative Semantics of the Prolog Selection RuleRobert F. Stärk. 252-261
- Semantics of Meta-Logic in an Algebra of ProgramsAntonio Brogi, Franco Turini. 262-270
- A Multiple-Conclusion Meta-LogicDale Miller. 272-281
- Proof Search in First-Order Linear Logic and Other Cut-Free Sequent CalculiPatrick Lincoln, Natarajan Shankar. 282-291
- Linear Logic, Totality and Full CompletenessRalph Loader. 292-298
- The Emptiness Problem for Intersection TypesPawel Urzyczyn. 300-309
- Subtyping and ParametricityGordon D. Plotkin, Martín Abadi, Luca Cardelli. 310-319
- On the Church-Rosser Property for Expressive Type Systems and its Consequences for their Metatheoretic StudyHerman Geuvers, Benjamin Werner. 320-329
- A Semantics of Object TypesMartín Abadi, Luca Cardelli. 332-341
- Passivity and IndependenceUday S. Reddy. 342-352
- A General Semantics for Evaluation LogicEugenio Moggi. 353-362
- Reflexive Graphs and Parametric PolymorphismE. P. Robinson, Giuseppe Rosolini. 364-371
- Categories, Allegories and Circuit DesignCarolyn Brown, Graham Hutton. 372-381
- Rewrite Techniques for Transitive RelationsLeo Bachmair, Harald Ganzinger. 384-393
- Normalised Rewriting and Normalised CompletionClaude Marché. 394-403
- Modularity of Strong Normalization and Confluence in the algebraic-lambda-CubeFranco Barbanera, Maribel Fernández, Herman Geuvers. 406-415
- Cyclic Lambda Graph RewritingZena M. Ariola, Jan Willem Klop. 416-425
- Paths in the lambda-calculusAndrea Asperti, Vincent Danos, Cosimo Laneve, Laurent Regnier. 426-436
- A Trace Based Extension of Linear Time Temporal LogicP. S. Thiagarajan. 438-447
- Axioms for Knowledge and Time in Distributed Systems with Perfect RecallRon van der Meyden. 448-457
- Compositional Verification of Real-Time SystemsEdward Y. Chang, Zohar Manna, Amir Pnueli. 458-465
- Logical Bilattices and Inconsistent DataOfer Arieli, Arnon Avron. 468-476
- a modal logic for subjective default reasoningShai Ben-David, Rachel Ben-Eliyahu. 477-486
- Language Completeness of the Lambek CalculusMati Pentus. 487-496
- Rigid E-Unifiability is DEXPTIME-CompleteJean Goubault. 498-506
- Higher-Order NarrowingChristian Prehofer. 507-516