Abstract is missing.
- On the Complexity of Branching Programs and Decision Trees for Clique FunctionsIngo Wegener. 1-12
- Average Complexity of Additive Properties for Multiway Tries: A Unified Approach (Extended Abstract)Wojciech Szpankowski. 13-25
- Longest Common Factor of Two WordsMaxime Crochemore. 26-36
- An Unification Semi-Algorithm for Intersection Type SchemesSimona Ronchi Della Rocca. 37-51
- Optimal Run Time Optimization Proved by a New Look at Abstract InterpretationBernhard Steffen. 52-68
- Transformation OrderingFrançoise Bellegarde, Pierre Lescanne. 69-80
- On Parametric Algebraic Specifications with Clean Error HandlingMartin Gogolla. 81-95
- Toward Formal Development of Programs from Algebraic Specifications: Implementations Revisited (Extended Abstract)Donald Sannella, Andrzej Tarlecki. 96-110
- Finite Algebraic Specifications of Semicomputable Data TypesGabriele Marongiu, Sauro Tulipani. 111-122
- On the Semantics of Concurrency: Partial Orders and Transition SystemsGérard Boudol, Ilaria Castellani. 123-137
- CCS without tau sRocco De Nicola, Matthew Hennessy. 138-152
- A Fullt Observational Model for Infinite Behaviours of Communicating SystemsPhilippe Darondeau, B. Gamatie. 153-168
- SMoLCS-Driven Concurrent CalculiEgidio Astesiano, Gianna Reggio. 169-201
- Parameterized Horn Clause Specifications: Proof Theory and CorrectnessMarisa Navarro, Fernando Orejas. 202-216
- Partial Composition and Recursion of Module SpecificationsFrancesco Parisi-Presicce. 217-231
- Efficient Representation of TaxonomiesGiorgio Gambosi, Jaroslav Nesetril, Maurizio Talamo. 232-240
- Applications of Compactness in the Smyth Powerdomain of Streams (Extended Abstract)John-Jules Ch. Meyer, Erik P. de Vink. 241-255
- Characterizing Kripke Structures in Temporal LogicMichael C. Browne, Edmund M. Clarke, Orna Grumberg. 256-270
- Dialogue with a Proof SystemRobin Milner. 271-275
- Induction Principles Formalized in the Calculus of ConstructionsGérard P. Huet. 276-286
- Algebraic Semantics (Abstract)James W. Thatcher. 287