On this page:

• Invited Speakers
• Invited Papers
• Presented Papers
• Organizers

Invited Speakers

• Henk Barendregt
  Results and Problems Related to Proof Checking
• Gerard Berry
  The Semantics of Synchronous Concurrent Languages
• Corrado Böhm
  An Algebraic View of the Lambda-Calculus
• Rod M. Burstall
  Terms, proofs and refinement
• Edmund M. Clarke
  Automatic verification of finite-state concurrent systems

Invited Papers

• Henk Barendregt
  Results and Problems Related to Proof CheckingMore Information...
• Gerard Berry
  The Semantics of Synchronous Concurrent LanguagesMore Information...
• Corrado Böhm
  An Algebraic View of the Lambda-CalculusMore Information...
• Rod M. Burstall
  Terms, proofs and refinementMore Information...
• Edmund M. Clarke
  Automatic verification of finite-state concurrent systemsMore Information...

Presented Papers

Entries are ordered by surname of first author

• Martín Abadi Luca Cardelli
  A semantics of object typesMore Information...
• Serge Abiteboul Christos H. Papadimitriou Victor Vianu
  The power of reflective relational machinesMore Information...
• Rajeev Alur Thomas A. Henzinger
  Finitary fairnessMore Information...
• Henrik R. Andersen Colin Stirling Glynn Winskel
  A compositional proof system for the modal μ-calculusMore Information...
• Ofer Arieli Arnon Avron
  Logical bilattices and inconsistent dataMore Information...
• Zena M. Ariola Jan Willem Klop
  Cyclic lambda graph rewritingMore Information...
• Andrea Asperti Vincent Danos Cosimo Laneve Laurent Regnier
  Paths in the lambda-calculus. Three years of communications without understanding More Information...
• Matthias Baaz Christian G. Fermüller Alexander Leitsch
  A non-elementary speed-up in proof length by structural clause form transformation More Information...
• Leo Bachmair Harald Ganzinger
  Rewrite techniques for transitive relationsMore Information...
• Franco Barbanera Maribel Fernández Herman Geuvers
  Modularity of strong normalization and confluence in the algebraic-λ-cube More Information...
• Shai Ben-David Rachel Ben-Eliyahu-Zohary
  A modal logic for subjective default reasoningMore Information...
• Antonio Brogi Franco Turini
  Semantics of meta-logic in an algebra of programsMore Information...
• Carolyn Brown Graham Hutton
  Categories, allegories and circuit designMore Information...
• Edward Y. Chang Zohar Manna Amir Pnueli
  Compositional verification of real-time systemsMore Information...
• Witold Charatonik Leszek Pacholski
  Negative set constraints with equalityMore Information...
• Loïc Colson Thomas Ehrhard
  On strong stability and higher-order sequentialityMore Information...
• Anuj Dawar Lauri Hella
  The expressive power of finitely many generalized quantifiersMore Information...
• Abbas Edalat
  Domain theory and integrationMore Information...
• Marcelo P. Fiore Gordon D. Plotkin
  An axiomatisation of computationally adequate domain theoretic models of FPC More Information...
• Herman Geuvers Benjamin Werner
  On the Church-Rosser property for expressive type systems and its consequences for their metatheoretic study More Information...
• Jean Goubault-Larrecq
  Rigid E-unifiability is DEXPTIME-completeMore Information...
• Yuri Gurevich Neil Immerman Saharon Shelah
  McColm's conjecture [positive elementary inductions]More Information...
• Lauri Hella Phokion G. Kolaitis Kerkko Luosto
  How to define a linear order on finite modelsMore Information...
• Edith Hemaspaandra
  Complexity transfer for modal logicMore Information...
• Martin Hofmann Thomas Streicher
  The groupoid model refutes uniqueness of identity proofsMore Information...
• Michael Huth Achim Jung Klaus Keimel
  Linear types, approximation, and topologyMore Information...
• Russell Impagliazzo Toniann Pitassi Alasdair Urquhart
  Upper and lower bounds for tree-like cutting planes proofsMore Information...
• Alan Jeffrey
  A fully abstract semantics for concurrent graph reductionMore Information...
• Patrick Lincoln Natarajan Shankar
  Proof search in first-order linear logic and other cut-free sequent calculi More Information...
• Ralph Loader
  Linear logic, totality and full completenessMore Information...
• Claude Marché
  Normalised rewriting and normalised completionMore Information...
• J. Antonio Medina Neil Immerman
  A syntactic characterization of NP-completenessMore Information...
• Dale A. Miller
  A multiple-conclusion meta-logicMore Information...
• Eugenio Moggi
  A general semantics for Evaluation LogicMore Information...
• Martin Otto
  Generalized quantifiers for simple propertiesMore Information...
• Jens Palsberg
  Efficient inference of object typesMore Information...
• Mati Pentus
  Language completeness of the Lambek calculusMore Information...
• Adolfo Piperno Simona Ronchi della Rocca
  Type inference and extensionalityMore Information...
• Gordon D. Plotkin Martín Abadi Luca Cardelli
  Subtyping and parametricityMore Information...
• Christian Prehofer
  Higher-order narrowingMore Information...
• Uday S. Reddy
  Passivity and independenceMore Information...
• Edmund P. Robinson Giuseppe Rosolini
  Reflexive graphs and parametric polymorphismMore Information...
• Vijay A. Saraswat Radha Jagadeesan Vineet Gupta
  Foundations of timed concurrent constraint programmingMore Information...
• Peter Sewell
  Bisimulation is not finitely (first order) equationally axiomatisable More Information...
• Kjartan Stefánsson
  Systems of set constraints with negative constraints are NEXPTIME-complete More Information...
• Robert F. Stärk
  The declarative semantics of the Prolog selection ruleMore Information...
• P. S. Thiagarajan
  A trace based extension of linear time temporal logicMore Information...
• Pawel Urzyczyn
  The emptiness problem for intersection typesMore Information...
• Ron van der Meyden
  Axioms for knowledge and time in distributed systems with perfect recall More Information...
• Joe B. Wells
  Typability and type checking in the second-order λ-calculus are equivalent and undecidable More Information...
• Shipei Zhang Oleg Sokolsky Scott A. Smolka
  On the parallel complexity of model checking in the modal mu-calculus More Information...

Organizers

General Chair Robert L. Constable Program Chair Samson Abramsky Conference Chair Gérard P. Huet Jean-Pierre Jouannaud Publicity Chair Amy Felty Douglas J. Howe

Program Committee: Samson Abramsky (Imperial Coll.); Jean-Jacques Lévy (INRIA); Krzysztof R. Apt (CWI); David A. McAllester (MIT); Harald Ganzinger (MPI Saarbrucken); Prakash Panangaden (McGill); Carl A. Gunter (Univ. of Pennsylvania); Frank Pfenning (CMU); Achim Jung (Darmstadt); Vaughan R. Pratt (Stanford); Paris C. Kanellakis (Brown); Peter Schroeder-Heister (Tubingen); Dexter C. Kozen (Cornell); Colin Stirling (Edinburgh); Daniel Leivant (Indiana); Glynn Winskel (Aarhus) Organizing Committee Martín Abadi; Samson Abramsky; Sergei N. Artëmov; Allan Borodin; Alan Bundy; Samuel R. Buss; Edmund M. Clarke; Robert L. Constable; Amy Felty; Ursula Goltz; Yuri Gurevich; Susumu Hayashi; Douglas J. Howe; Gérard P. Huet; Jean-Pierre Jouannaud; Deepak Kapur; Claude Kirchner; Phokion G. Kolaitis; S. Rap Kosaraju; Dexter C. Kozen; Daniel Leivant; Albert R. Meyer; Dale A. Miller; John C. Mitchell; Yiannis N. Moschovakis; Mitsuhiro Okada; Prakash Panangaden; Andrew M. Pitts; Gordon D. Plotkin; Jeffrey B. Remmel; Simona Ronchi della Rocca; Grzegorz Rozenberg; Andre Scedrov; Dana S. Scott; Jerzy Tiuryn; Moshe Y. Vardi