Abstract is missing.
- Bisimulation and Co-induction (Tutorial)Andrew M. Pitts. 2-3
- The Genericity Theorem and the Notion of Parametricity in the Polymorphic lambda-calculus (Extended Abstract)Giuseppe Longo, Kathleen Milsted, Sergei Soloviev. 6-14
- Standard ML-NJ weak polymorphism and imperative constructsMy Hoang, John C. Mitchell, Ramesh Viswanathan. 15-25
- A lambda calculus of objects and method specializationJohn C. Mitchell, Furio Honsell, Kathleen Fisher. 26-38
- Strong Normalization for Second Order Classical Natural DeductionMichel Parigot. 39-46
- Automated Production of Traditional Proofs for Constructive Geometry TheoremsShang-Ching Chou, Xiao-Shan Gao, Jing-Zhong Zhang. 48-56
- On the Unification Problem for Cartesian Closed CategoriesPaliath Narendran, Frank Pfenning, Richard Statman. 57-63
- Functional Unification of Higher-Order PatternsTobias Nipkow. 64-74
- Set Constraints are the Monadic ClassLeo Bachmair, Harald Ganzinger, Uwe Waldmann. 75-83
- Relational Properties of Recursively Defined DomainsAndrew M. Pitts. 86-97
- Full Abstraction for a Shared Variable Parallel LanguageStephen D. Brookes. 98-109
- A Coinduction Principle for Recursive Data Types Based on BisimulationMarcelo P. Fiore. 110-119
- A Tutorial on Finite Model Theory (Abstract)Phokion G. Kolaitis. 122
- In and Out of Temporal LogicAmir Pnueli, Lenore D. Zuck. 124-135
- On Completeness of the mu-calculusIgor Walukiewicz. 136-146
- On Model Checking for Real-Time Properties with DurationsAhmed Bouajjani, Rachid Echahed, Joseph Sifakis. 147-159
- Verifying Programs with Unreliable ChannelsParosh Aziz Abdulla, Bengt Jonsson. 160-170
- y = 2x vs. y = 3xDamian Niwinski, Alexei P. Stolboushkin. 172-178
- Monadic Second-Order Logic and Hypergraph OrientationBruno Courcelle. 179-190
- Infinitary Logics and Very Sparse Random GraphsJames F. Lynch. 191-198
- Asymptotic Probabilities of Languages with Generalized QuantifiersGuy Fayolle, Stéphane Grumbach, Christophe Tollu. 199-207
- Compositional Analysis for Concurrent Constraint ProgrammingMoreno Falaschi, Maurizio Gabbrielli, Kim Marriott, Catuscia Palamidessi. 210-221
- Rules of Definitional ReflectionPeter Schroeder-Heister. 222-232
- Encoding the Calculus of Constructions in a Higher-Order LogicAmy P. Felty. 233-244
- Programs, grammars and arguments: a personal view of some connections between computation, language and logicJoachim Lambek. 246-249
- Imperfect information flowJon Barwise, Jerry Seligman. 252-260
- A Typed Pattern CalculusVal Tannen, Delia Kesner, Laurence Puel. 262-274
- Non-Determinism in a Functional SettingC.-H. Luke Ong. 275-286
- Adequacy for untyped translations of typed lambda-calculiWesley Phoa. 287-295
- Local and asynchronous beta-reduction (an analysis of Girard s execution formula)Vincent Danos, Laurent Regnier. 296-306
- An Exponential Separation between the Matching Principle and the Pigeonhole PrinciplePaul Beame, Toniann Pitassi. 308-319
- Some Desirable Conditions for Feasible Functionals of Type~2Anil Seth. 320-331
- Database Query Languages Embedded in the Typed Lambda CalculusGerd G. Hillebrand, Paris C. Kanellakis, Harry G. Mairson. 332-343
- Homomorphic Tree Embeddings and Their Applications to Recursive Program OptimizationLaks V. S. Lakshmanan, Karima Ashraf, Jiawei Han. 344-353
- The order types of termination orderings on monadic terms, strings and multisetsUrsula Martin, Elizabeth Scott. 356-363
- The Unifiability Problem in Ground AC TheoriesPaliath Narendran, Michaël Rusinowitch. 364-370
- Type Theory and Recursion (Extended Abstract)Gordon D. Plotkin. 374
- Typing and Subtyping for Mobile ProcessesBenjamin C. Pierce, Davide Sangiorgi. 376-385
- Decomposability, Decidability and Axiomatisability for Bisimulation Equivalence on Basic Parallel ProcessesSøren Christensen, Yoram Hirshfeld, Faron Moller. 386-396
- A Fully Abstract Denotational Model for Higher-Order Processes (Extended Abstract)Matthew Hennessy. 397-408
- Self-Synchronization of Concurrent Processes (Preliminary Report)Lalita Jategaonkar, Albert R. Meyer. 409-417
- Bisimulation and open mapsAndré Joyal, Mogens Nielsen, Glynn Winskel. 418-427
- Lambek Grammars Are Context FreeMati Pentus. 429-433