Abstract is missing.
- On the Unification Free Prolog ProgramsKrzysztof R. Apt, Sandro Etalle. 1-19
- Equivalences and Preorders of Transition SystemsAndré Arnold, Anne Dicky. 20-31
- Deliverables: A Categorial Approach to Program Development in Type TheoryJames McKinna, Rod M. Burstall. 32-67
- Complex and Complex-Like TracesVolker Diekert. 68-82
- Symbolic Bisimulations (Abstract)Matthew Hennessy. 83
- Some Results on the Full Abstraction Problem for Restricted Lambda CalculiFurio Honsell, Marina Lenisa. 84-104
- Action Calculi, or Syntactic Action StructuresRobin Milner. 105-121
- Observable Properties of Higher Order Functions that Dynamically Create Local Names, or What s new?Andrew M. Pitts, Ian D. B. Stark. 122-141
- The Second Calculus of Binary RelationsVaughan R. Pratt. 142-155
- An Introduction to Dynamic Labled 2-StructuresAndrzej Ehrenfeucht, Grzegorz Rozenberg. 156-173
- Post Correspondence Problem: Primitivity and Interrelations with Complexity ClassesAlexandru Mateescu, Arto Salomaa. 174-184
- A Taste of Linear LogicPhilip Wadler. 185-210
- On the Tree Inclusion ProblemLaurent Alonso, René Schott. 211-221
- On the Adequacy of Per ModelsRoberto M. Amadio. 222-231
- Hausdorff Reductions to Sparse Sets and to Sets of High Information ContentVikraman Arvind, Johannes Köbler, Martin Mundhenk. 232-241
- Stores as Homomorphisms and their TransformationsEgidio Astesiano, Gianna Reggio, Elena Zucca. 242-251
- Comparative Semantics for Linear Arrays of Communicating Processes: A Study of the UNIX Fork and Pipe CommandsJ. W. de Bakker, Franck van Breugel, Arie de Bruin. 252-261
- Rabin Tree Automata and Finite MonoidsDanièle Beauquier, Andreas Podelski. 262-271
- Efficient Type Reconstruction in the Presence of InheritanceMarcin Benke. 272-280
- A Characterization of Sturmian MorphismsJean Berstel, Patrice Séébold. 281-290
- On the Complexity of Scheduling Incompatible Jobs with Unit-TimesHans Leo Bodlaender, Klaus Jansen. 291-300
- Isomorphisms between Predicates and State TransformersMarcello M. Bonsangue, Joost N. Kok. 301-310
- On the Amount of Nondeterminism and the Power of Verifying (Extended Abstract)Liming Cai, Jianer Chen. 311-320
- Observing Distribution in ProcessesIlaria Castellani. 321-331
- Speedup of Recognizable Trace LanguagesChristophe Cérin, Antoine Petit. 332-341
- May I Borrow Your Logic?Maura Cerioli, José Meseguer. 342-351
- Approximate and Exact Deterministic Parallel SelectionShiva Chaudhuri, Torben Hagerup, Rajeev Raman. 352-361
- Defining Soft Sortedness by Abstract InterpretationJian Chen, John Staples. 362-371
- A Model for Real-Time Process Algebras (Extended Abstract)Liang Chen. 372-381
- Data Encapsulation and Modularity: Three Views of InheritanceJosé Félix Costa, Amílcar Sernadas, Cristina Sernadas. 382-391
- Image Compression Using Weighted Finite AutomataKarel Culik II, Jarkko Kari. 392-402
- Filter Models for a Parallel and Non Deterministic Lambda-CalculusMariangiola Dezani-Ciancaglini, Ugo de Liguoro, Adolfo Piperno. 403-412
- Real Number Computability and Domain TheoryPietro Di Gianantonio. 413-422
- Lambda Substitution AlgebrasZinovy Diskin, Ilya Beylin. 423-432
- Global Properties of 2D Cellular Automata: Some Complexity ResultsBruno Durand. 433-441
- Completeness Results for Linear Logic on Petri NetsUffe Engberg, Glynn Winskel. 442-452
- An Expressive Logic for Basic Process AlgebraAlessandro Fantechi, Stefania Gnesi, V. Perticaroli. 453-462
- The Complexity of Finding Replicas Using Equality TestsGudmund Skovbjerg Frandsen, Peter Bro Miltersen, Sven Skyum. 463-472
- A Complete Axiomatization for Branching Bisimulation Congruence of Finite-State BehavioursRob J. van Glabbeek. 473-484
- Object Oriented Application Flow Graphs and their SemanticsErik de Haas, Peter van Emde Boas. 485-494
- Some Hierarchies for the Communication Complexity Measures of Cooperating Grammar SystemsJuraj Hromkovic, Jarkko Kari, Lila Kari. 495-505
- Efficient Parallel Graph Algorithms Based on Open Ear DecompositionLouis Ibarra, Dana S. Richards. 506-516
- On the Communication Complexity of Parallel ComputationOscar H. Ibarra, Nicholas Q. Trân. 517-526
- A Taxonomy of Forgetting AutomataPetr Jancar, Frantisek Mráz, Martin Plátek. 527-536
- Hybrid Parallel Programming and Implementation of Synchronised CommunicationJifeng He. 537-546
- Proof Systems for Cause Based EquivalencesAstrid Kiehn. 547-556
- A Uniform Universal CREW PRAMBruno Martin. 557-565
- Observing Located ConcurrencyDavid Murphy. 566-576
- The Boundary of Substitution SystemsPhilippe Narbel. 577-587
- New Algorithms for Detecting Morphic Images of a WordJean Neraud. 588-597
- Ignoring Nonessential Interleavings in Assertional Reasoning on Concurrent ProgramsPawel Paczkowski. 598-607
- Constant Time Reductions in Lambda-CaculusMichel Parigot, Paul Rozière. 608-617
- Heterogeneous Unified AlgebrasFrancesco Parisi-Presicce, S. Veglioni. 618-628
- A Representation Theorem for Lambda Abstraction AlgebrasDon Pigozzi, Antonino Salibra. 629-639
- On Saturated Calculi for a Linear Temporal LogicRegimantas Pliuskevicius. 640-649
- The Snack Powerdomain for Database SemanticsHermann Puhlmann. 650-659
- Verifying Properties of Module Construction in Type TheoryBernhard Reus, Thomas Streicher. 660-670
- On Time-Space Trade-Offs in Dynamic Graph PebblingPeter Ruzicka, Juraj Waczulík. 671-681
- Deterministic Behavioural Models for ConcurrencyVladimiro Sassone, Mogens Nielsen, Glynn Winskel. 682-692
- Real-Time Refinement: Semantics and ApplicationDavid Scholefield, Hussein S. M. Zedan, Jifeng He. 693-702
- Deciding Testing Equivalence for Real-Time Processes with Dense TimeBernhard Steffen, Carsten Weise. 703-713
- A Calculus for Higher Order Procedures with Global VariablesWerner Stephan, Andreas Wolpers. 714-723
- Variable Substitution with Iconic CombinatorsDavid Stevens. 724-733
- Feature Constraints with First-Class FeaturesRalf Treinen. 734-743
- Between Min Cut and Graph BisectionDorothea Wagner, Frank Wagner. 744-750
- Paths and Cycles in Finite Periodic GraphsEgon Wanke. 751-760
- Learning Decision Lists from Noisy ExamplesJilei Yin, Zhu Hong. 761-766
- Analytic Tableaux for Finite and Infinite Post LogicsNicolas Zabel. 767-776