On this page:
Invited Speakers
- Jon Barwise Jerry Seligman:
Imperfect information flowMore Information... - Phokion G. Kolatis:
A Tutorial on Finite Model TheoryMore Information... - J. Lambek:
Programs, grammars and arguments: a personal view of some connections between computation, language and logicMore Information... - Andrew M. Pitts:
Bisimulation and Co-induction (Tutorial)More Information... - G. D. Plotkin:
Type theory and recursionMore Information...
Presented Papers
Entries are ordered by surname of first author
- Parosh Abdulla Bengt Jonsson:
Verifying programs with unreliable channelsMore Information... - Leo Bachmair Harald Ganzinger Uwe Waldmann:
Set constraints are the monadic classMore Information... - Paul Beame Toniann Pitassi:
An exponential separation between the matching principle and the pigeonhole principle More Information... - Ahmed Bouajjani Rachid Echahed Joseph Sifakis:
On model checking for real-time properties with durationsMore Information... - Val Breazu-Tannen Delia Kesner Laurence Puel:
A typed pattern calculusMore Information... - Stephen Brookes:
Full abstraction for a shared variable parallel languageMore Information... - Shang-Ching Chou Xiao-Shan Gao Jing-Zhong Zhang:
Automated production of traditional proofs for constructive geometry theorems More Information... - Søren Christensen Yoram Hirshfeld Faron Moller:
Decomposability, decidability and axiomatisability for bisimulation equivalence on basic parallel processes More Information... - Bruno Courcelle:
Monadic second-order logic and hypergraph orientationMore Information... - Vincent Danos Laurent Regnier:
Local and asynchronous beta-reduction (an analysis of Girard's execution formula) More Information... - Moreno Falaschi Maurizio Gabbrielli Kim Marriott Catuscia Palamidessi:
Compositional analysis for concurrent constraint programmingMore Information... - Guy Fayolle Stéphanie Grumbach Chritophe Tollu:
Asymptotic probabilities of languages with generalized quantifiers More Information... - Amy Felty:
Encoding the calculus of constructions in a higher-order logicMore Information... - Marcelo P. Fiore:
A coinduction principle for recursive data types based on bisimulation More Information... - M. Hennessy:
A fully abstract denotational model for higher-order processesMore Information... - Gerd G. Hillebrand Paris C. Kanellakis Harry G. Mairson:
Database query languages embedded in the typed lambda calculusMore Information... - My Hoang John Mitchell Ramesh Viswanathan:
Standard ML-NJ weak polymorphism and imperative constructsMore Information... - Lalita Jategaonkar Albert R. Meyer:
Self-synchronization of concurrent processesMore Information... - André Joyal Mogens Nielson Glynn Winskel:
Bisimulation and open mapsMore Information... - Laks V. S. Lakshmanan Karima Ashraf Jiawei Han:
Homomorphic tree embeddings and their applications to recursive program optimization More Information... - Giuseppe Longo Kathleen Milsted Sergei Soloviev:
The genericity theorem and the notion of parametricity in the polymorphic λ-calculus More Information... - James F. Lynch:
Infinitary logics and very sparse random graphsMore Information... - Ursula Martin Elizabeth Scott:
The order types of termination orderings on monadic terms, strings and multisets More Information... - John C. Mitchell Furio Honsell Kathleen Fisher:
A lambda calculus of objects and method specializationMore Information... - Paliath Narendran Michaël Rusinowitch:
The unifiability problem in ground AC theoriesMore Information... - Paliath Narendran Frank Pfenning Richard Statman:
On the unification problem for Cartesian closed categoriesMore Information... - Tobias Nipkow:
Functional unification of higher-order patternsMore Information... - Damien Niwinski Alexei Stolboushkin:
y=2x vs. y=3xMore Information... - C.-H. Luke Ong:
Non-determinism in a functional settingMore Information... - Michel Parigot:
Strong normalization for second order classical natural deduction More Information... - M. Pentus:
Lambek grammars are context freeMore Information... - Peuli, A. Zuck, L.:
In and out of temporal logicMore Information... - Wesley Phoa:
Adequacy for untyped translations of typed λ-calculiMore Information... - Benjamin Pierce Davide Sangiorgi:
Typing and subtyping for mobile processesMore Information... - Andrew M. Pitts:
Relational properties of recursively defined domainsMore Information... - Peter Schroeder-Heister:
Rules of definitional reflectionMore Information... - Anil Seth:
Some desirable conditions for feasible functionals of type 2More Information... - Igor Walukiewicz:
On completeness of the μ-calculusMore Information...
Organizers
General ChairRobert L. Constable (Cornell University) Program ChairMoshe Vardi (IBM Research) Conference ChairMitsu Okada (Concordia university) Prakash Panagaden (McGill University) Publicity ChairDaniel Leivant (Indiana University) |
Program Committee:M. Abadi (DEC SRC); S. Abramsky (Imperial Coll.); B. Bloom (Cornell); P. Clote (Boston Coll.); P.J. Freyd (Univ. of Pennsylvania); D. Harel (Weizmann Inst.); K.G. Larsen (Aalborg Univ.); P. Lescanne (CRIN and INRIA-Lorraine); D. McAllester (MIT); J. Meseguer (SRI); D. Miller (Univ. of Pennsylvania); Y. Moschovakis (UCLA); N. Shankar (SRI); C. Talcott (Stanford); M.Y. Vardi (IBM Almaden); P. Wolper (Univ. of Liege) Organizing CommitteeM. Abadi; S. Abramsky; S. Artemov; J. Barwise; M. Blum; A. Borodin; A. Bundy; S. Buss; E. Clarke; R. Constable; E. Engeler; J. Gallier; U. Goltz; Y. Gurevich; S. Hayashi; G. Huet; G. Kahn; D. Kapur; C. Kirchner; R. Kosaraju; J. W. Klop; P. Kolatis; D. Leivant; A. R. Meyer; G. Mints; J. Mitchell; Y. Moschovakis; M. Okada; P. Panagaden; A. Pitts; G. Plotkin; S. Ronchi della Rocca; G. Rozenberg; A. Scedrov; D. Scott; J. Tiuryn; M. Y. Vardi; R. de Vrijer |