Abstract is missing.
- Type Reconstruction in Finite-Rank Fragments of the Polymorphic lambda-Calculus (Extended Summary)A. J. Kfoury, Jerzy Tiuryn. 2-11
- Polymorphism, Set Theory, and Call-by-ValueEdmund Robinson, Giuseppe Rosolini. 12-18
- Universal Domains in the Theory of Denotational Semantics of Programming LanguagesManfred Droste, Rüdiger Göbel. 19-34
- The Classification of Continuous Domains (Extended Abstract)Achim Jung. 35-40
- A Decision Procedure for a Class of Set Constraints (Extended Abstract)Nevin Heintze, Joxan Jaffar. 42-51
- A Constraint Sequent CalculusJean-Louis Lassez, Ken McAloon. 52-61
- Solving Inequations in Term Algebras (Extended Abstract)Hubert Comon. 62-69
- The Dynamic Logic of PermissionRon van der Meyden. 72-78
- A Theory of Nonmonotonic Rule SystemsV. Wiktor Marek, Anil Nerode, Jeffrey B. Remmel. 79-94
- The Semantics of Reflected ProofStuart F. Allen, Robert L. Constable, Douglas J. Howe, William E. Aitken. 95-105
- Equation Solving Using Modal Transition SystemsKim Guldstrand Larsen, Liu Xinxin. 108-117
- Three Logics for Branching Bisimulation (Extended Abstract)Rocco De Nicola, Frits W. Vaandrager. 118-129
- Reactive, Generative, and Stratified Models of Probabilistic ProcessesRob J. van Glabbeek, Scott A. Smolka, Bernhard Steffen, Chris M. N. Tofts. 130-141
- The Nonexistence of Finite Axiomatisations for CCS CongruencesFaron Moller. 142-153
- 0-1 Laws for Infinitary Logics (Preliminary Report)Phokion G. Kolaitis, Moshe Y. Vardi. 156-167
- Implicit Definability on Finite Structures and Unambiguous Computations (Preliminary Report)Phokion G. Kolaitis. 168-180
- ALOGTIME and a Conjecture of S. A. Cook (Extended Abstract)Peter Clote. 181-189
- On the Expression of Monadic Second-Order Graph Properties Without Quantifications Over Sets of Edges (Extended Abstract)Bruno Courcelle. 190-196
- Normal Process RepresentativesVijay Gehlot, Carl A. Gunter. 200-207
- A Categorical Linear Framework for Petri NetsCarolyn Brown, Doug Gurr. 208-218
- A Linear Semantics for Allowed Logic ProgramsSerenella Cerrito. 219-227
- Programming in Equational Logic: Beyond Strong SequentialityR. C. Sekar, I. V. Ramakrishnan. 230-241
- The Theory of Ground Rewrite Systems is DecidableMax Dauchet, Sophie Tison. 242-248
- Well Rewrite OrderingsPierre Lescanne. 249-256
- A Constructive Proof of Higman s LemmaChetan R. Murthy, James R. Russell. 257-267
- Syntactic Theories and UnificationClaude Kirchner, Francis Klay. 270-277
- Proof Transformations for Equational TheoriesTobias Nipkow. 278-288
- A New AC Unification Algorithm with an Algorithm for Solving Systems of Diophantine EquationsAlexandre Boudet, Evelyne Contejean, Hervé Devie. 289-299
- On Subsumption and Semiunification in Feature AlgebrasJochen Dörre, William C. Rounds. 300-310
- Completeness for typed lazy inequalitiesStavros S. Cosmadakis, Albert R. Meyer, Jon G. Riecke. 312-320
- Conditional Lambda-Theories and the Verification of Static Properties of ProgramsMitchell Wand, Zheng-Yu Wang. 321-332
- Single-Threaded Polymorphic Lambda CalculusJuan C. Guzmán, Paul Hudak. 333-343
- Extensional PERsPeter J. Freyd, P. Mulry, Giuseppe Rosolini, Dana S. Scott. 346-354
- A Per Model of Polymorphism and Recursive TypesMartín Abadi, Gordon D. Plotkin. 355-365
- Effective Domains and Intrinsic StructureWesley Phoa. 366-377
- A Logic of Concrete Time Intervals (Extended Abstract)Harry R. Lewis. 380-389
- Real-time Logics: Complexity and ExpressivenessRajeev Alur, Thomas A. Henzinger. 390-401
- Explicit Clock Temporal LogicEyal Harel, Orna Lichtenstein, Amir Pnueli. 402-413
- Model-Checking for Real-Time SystemsRajeev Alur, Costas Courcoubetis, David L. Dill. 414-425
- Symbolic Model Checking: 10^20 States and BeyondJerry R. Burch, Edmund M. Clarke, Kenneth L. McMillan, David L. Dill, L. J. Hwang. 428-439
- When is Partial Adequate? A Logic-Based Proof Technique Using Partial SpecificationsRance Cleaveland, Bernhard Steffen. 440-449
- Modelling Shared State in a Shared Action ModelKenneth J. Goldman, Nancy A. Lynch. 450-463
- On the Limits of Efficient Temporal Decidability (Extended Abstract)E. Allen Emerson, Michael Evangelist, Jai Srinivasan. 464-475
- On the Power of Bounded Concurrency~III: Reasoning About Programs (Preliminary Report)David Harel, Roni Rosner, Moshe Y. Vardi. 478-488
- New Foundations for Fixpoint ComputationsRoy L. Crole, Andrew M. Pitts. 489-497
- Recursive Types Reduced to Inductive TypesPeter J. Freyd. 498-507