Abstract is missing.
- A Generalization of Fagin s TheoremJ. Antonio Medina, Neil Immerman. 2-12
- DATALOG SIRUPs Uniform Boundedness is UndecidableJerzy Marcinkowski. 13-24
- On the Structure of Queries in Constraint Query LanguagesMichael Benedikt, Leonid Libkin. 25-34
- A Fully Abstract Domain Model for the pi-CalculusIan Stark. 36-42
- A Fully-Abstract Model for the pi-Calculus (Extended Abstract)Marcelo P. Fiore, Eugenio Moggi, Davide Sangiorgi. 43-54
- Higher Dimensional Transition SystemsGian Luca Cattani, Vladimiro Sassone. 55-62
- An Algebraic Theory of Process EfficiencyV. Natarajan, Rance Cleaveland. 63-72
- The Subtyping Problem for Second-Order Types is UndecidableJerzy Tiuryn, Pawel Urzyczyn. 74-85
- Subtyping Dependent Types (Summary)David Aspinall, Adriana B. Compagnoni. 86-97
- Reduction-Free Normalisation for a Polymorphic SystemThorsten Altenkirch, Martin Hofmann, Thomas Streicher. 98-106
- An Until Hierarchy for Temporal LogicKousha Etessami, Thomas Wilke. 108-117
- Locally Linear Time Temporal LogicRamaswamy Ramanujam. 118-127
- Tarskian Set ConstraintsDavid A. McAllester, Robert Givan, Carl Witty, Dexter Kozen. 138-147
- Reasoning about Local Variables with Operationally-Based Logical RelationsAndrew M. Pitts. 152-163
- Games and Full Abstraction for FPCGuy McCusker. 174-183
- A Temporal-Logic Approach to Binding-Time AnalysisRowan Davies. 184-195
- Symbolic Protocol Verification With Queue BDDsPatrice Godefroid, David E. Long. 198-206
- Reactive ModulesRajeev Alur, Thomas A. Henzinger. 207-218
- Model-Checking of Correctness Conditions for Concurrent ObjectsRajeev Alur, Kenneth L. McMillan, Doron Peled. 219-228
- A Semantic View of Classical Proofs: Type-Theoretic, Categorical, and Denotational Characterizations (Preliminary Extended Abstract)C.-H. Luke Ong. 230-241
- Syntactic Considerations on Recursive TypesMartín Abadi, Marcelo P. Fiore. 242-252
- A Linear Logical FrameworkIliano Cervesato, Frank Pfenning. 264-275
- The Theory of Hybrid AutomataThomas A. Henzinger. 278-292
- Partial-Order Methods for Model Checking: From Linear Time to Branching TimeBernard Willems, Pierre Wolper. 294-303
- Efficient Model Checking via the Equational µ-CalculusGirish Bhat, Rance Cleaveland. 304-312
- General Decidability Theorems for Infinite-State SystemsParosh Aziz Abdulla, Karlis Cerans, Bengt Jonsson, Yih-Kuen Tsay. 313-321
- Relating Word and Tree AutomataOrna Kupferman, Shmuel Safra, Moshe Y. Vardi. 322-332
- More About Recursive Structures: Descriptive Complexity and Zero-One LawsTirza Hirst, David Harel. 334-347
- On the Expressive Power of Variable-Confined LogicsPhokion G. Kolaitis, Moshe Y. Vardi. 348-359
- The Scott Topology Induces the Weak TopologyAbbas Edalat. 372-381
- Integration in Real PCFAbbas Edalat, Martín Hötzel Escardó. 382-393
- Game Semantics & Abstract MachinesVincent Danos, Hugo Herbelin, Laurent Regnier. 394-405
- Semantics of Normal Logic Programs and Contested InformationShekhar Pradhan. 406-415
- Linear Logic, Monads and the Lambda CalculusP. N. Benton, Philip Wadler. 420-431
- Confluence and Preservation of Strong Normalisation in an Explicit Substitutions CalculusCésar Muñoz. 440-447
- Completing Partial Combinatory Algebras With Unique Head-Normal FormsInge Bethke, Jan Willem Klop, Roel C. de Vrijer. 448-454
- Complexity Analysis Based on Ordered ResolutionDavid A. Basin, Harald Ganzinger. 456-465
- Solving Linear Equations over Polynomial SemiringsPaliath Narendran. 466-472
- Basic Paramodulation and Decidable Theories (Extended Abstract)Robert Nieuwenhuis. 473-482
- Counting Modulo Quantifiers on Finite Linearly Ordered TreesJuha Nurmonen. 484-493
- Simultaneous E-Unification and Related Algorithmic ProblemsAnatoli Degtyarev, Yuri Matiyasevich, Andrei Voronkov. 494-502
- Decidability Problems for the Prenex Fragment of Intuitionistic LogicAnatoli Degtyarev, Andrei Voronkov. 503-512
- On the Complexity of AbductionV. Wiktor Marek, Anil Nerode, Jeffrey B. Remmel. 513-522
- Decision Problems for Semi-Thue Systems with a Few RulesYuri Matiyasevich, Géraud Sénizergues. 523-531