On this page:
Invited Speakers
- C. A. R. Hoare M. J. C. Gordon:
Partial correctness of C-MOS switching circuits: an exercise in applied logic More Information... - Albert R. Meyer Stavros S. Cosmadakis:
Semantical paradigms: notes for an invited lectureMore Information...
Presented Papers
Entries are ordered by surname of first author
- Martín Abadi Leslie Lamport:
The existence of refinement mappingsMore Information... - Roberto M. Amadio:
A fixed point of the second order lambda-calculus: observable equivalences and models More Information... - Leo Bachmair:
Proof by consistency in equational theoriesMore Information... - Marianne Baudinet:
Proving termination properties of Prolog programs: a semantic approach More Information... - Bard Bloom:
Can LCF be topped? Flat lattice models of typed lambda calculusMore Information... - Alexandre Boudet Jean-Pierre Jouannaud Manfred Schmidt-Schauß:
Unification in free extensions of Boolean rings and Abelian groups More Information... - Val Breazu-Tannen:
Combining algebra and higher-order typesMore Information... - Kim B. Bruce Giuseppe Longo:
A modest model of records, inheritance and bounded quantification More Information... - Corrado Böhm Adolfo Piperno:
Characterizing X-separability and one-side invertibility in λ-β-Θ-calculus More Information... - Robert Cartwright Alan J. Demers:
The topology of program terminationMore Information... - Rance Cleaveland Matthew Hennessy:
Priorities in process algebrasMore Information... - Kevin J. Compton Claude Laflamme:
An algebra and a logic for NC¹More Information... - Robert L. Constable Scott F. Smith:
Computational foundations of basic recursive function theoryMore Information... - Thierry Coquand:
Categories of embeddingsMore Information... - Mads Dam:
Relevance logic and concurrent compositionMore Information... - Pierpaolo Degano Rocco De Nicola Ugo Montanari:
On the consistency of `truly concurrent' operational and denotational semantics More Information... - Nachum Dershowitz Mitsuhiro Okada:
Proof-theoretic techniques for term rewriting theoryMore Information... - Thomas Ehrhard:
A categorical semantics of constructionsMore Information... - Ronald Fagin Joseph Y. Halpern Nimrod Megiddo:
A logic for reasoning about probabilitiesMore Information... - Peter J. Freyd Jean-Yves Girard Andre Scedrov Philip J. Scott:
Semantic parametricity in polymorphic lambda calculusMore Information... - Jean H. Gallier Wayne Snyder Paliath Narendran David A. Plaisted:
Rigid E-unification is NP-completeMore Information... - Rob Gerth Michael Codish Yossi Lichtenstein Ehud Y. Shapiro:
Fully abstract denotational semantics for flat Concurrent Prolog More Information... - Paola Giannini Simona Ronchi Della Rocca:
Characterization of typings in polymorphic type disciplineMore Information... - Michal Grabowski Hardi Hungar:
On the existence of effective Hoare logicsMore Information... - Timothy Griffin:
Notational definition-a formal accountMore Information... - Carl A. Gunter Achim Jung:
Coherence and consistency in domainsMore Information... - A. J. Kfoury Jerzy Tiuryn Pawel Urzyczyn:
On the computational power of universally polymorphic recursionMore Information... - Phokion G. Kolaitis Moshe Y. Vardi:
0-1 laws and decision problems for fragments of second-order logic More Information... - Gabriel M. Kuper Ken McAloon Krishna V. Palem Kenneth J. Perry:
Efficient parallel algorithms for anti-unification and relative complement More Information... - Kim Guldstrand Larsen Bent Thomsen:
A modal process logicMore Information... - Michael J. Maher:
Complete axiomatizations of the algebras of finite, rational and infinite trees More Information... - Paul F. Mendler Peter Aczel:
The notion of a framework and a framework for LTCMore Information... - José Meseguer Ugo Montanari:
Petri nets are monoids: a new algebraic foundation for net theory More Information... - David E. Muller Ahmed Saoudi Paul E. Schupp:
Weak alternating automata give a simple explanation of why most temporal and dynamic logics are decidable in exponential time More Information... - Damian Niwinski:
Fixed points vs. infinite generationMore Information... - Anne Salvesen Jan M. Smith:
The strength of the subset type in Martin-Lof's type theoryMore Information... - Michael L. Tiomkin:
Proving unprovabilityMore Information... - Sergei G. Vorobyov:
On the arithmetic inexpressiveness of term rewriting systemsMore Information... - D. J. Walker:
Bisimulations and divergenceMore Information... - Mitchell Wand:
Corrigendum: complete type interference for simple objectsMore Information... - Glynn Winskel:
A category of labelled Petri nets and compositional proof system More Information...
Organizers
Program ChairYuri Gurevich |
Program Committee:M. Dezani; J. Halpern; G. Huet; C.A.R. Hoare; P. Kanellakis; J.-L. Lassez; J. Mitchell; R. Platek; G. Plotkin; S. Rosenschein; A. Sistla; J. Tiuryn; M. Wand |