Abstract is missing.
- Seven Years of COMPASSBernd Krieg-Brückner. 1-13
- Inductively Defined Relations: A Brief Tutorial (Extended Abstract)Rod M. Burstall. 14-16
- On the Role of Category Theory in the Area of Algebraic SpecificationHartmut Ehrig, Martin Große-Rhode, Uwe Wolter. 17-48
- Unification of Theories: A Challenge for Computing ScienceC. A. R. Hoare. 49-57
- The Larch Shared Language: Some Open ProblemsJames J. Horning. 58-73
- The Lambda Calculus as an Abstract Data TypePierre Lescanne. 74-80
- Unifying Theories in Different InstitutionsM. Arrais, José Luiz Fiadeiro. 81-101
- Interchange Format for Inter-operability of Tools and Translation: The SALSA and ASSPEGIQU:::+:::/LP ExperienceMichel Bidoit, Christine Choppy, Frédéric Voisin. 102-124
- Experiments with Partial Evaluation Domains for Rewrite SpecificationsReinhard Bündgen, Werner Lauterbach. 125-142
- Class-Sort Polymorphism in GLIDERSilvia Clerici, Rosa M. Jiménez, Fernando Orejas. 143-160
- Deontic Concepts in the Algebraic Specification of Dynamic Systems: The Permission CaseEva Coscia, Gianna Reggio. 161-181
- Reification - Changing Viewpoint but Preserving TruthGrit Denker. 182-199
- A Category-Based Equational Logic Semantics to Constraint ProgrammingRazvan Diaconescu. 200-221
- Concurrent State Transformations on Abstract Data TypesMartin Große-Rhode. 222-236
- A View on Implementing Processes: Categories of CircuitsUlrich Hensel, David A. Spooner. 237-254
- Combining Algebraic and Set-Theoretic SpecificationsClaus Hintermeier, Hélène Kirchner, Peter D. Mosses. 255-273
- Minimal Term Rewriting SystemsJ. F. Th. Kamperman, H. R. Walters. 274-290
- ::::InterACT::::: An Interactive Theorem and Completeness Prover for Algebraic Specifications with Conditional EquationMarcus Klar, Robert Geisler, Felix Cornelius. 291-395
- Rewriting and Reasoning with Set-Relations II: The Non-ground Case CompletenessValentinas Kriauciukas, Michal Walicki. 306-321
- Termination of Curryfied Rewrite SystemsBjørn Kristoffersen. 322-341
- Formal Specifications and Test: Correctness and OraclePascale Le Gall, Agnès Arnould. 342-358
- Behavioural Equivalence, Bisimulation, and Minimal RealisationGrant Malcolm. 359-378
- Using Limits of Parchment to Systematically Construct Institutions of partial AlgebrasTill Mossakowski. 379-393
- Behavioural Specifications in Type TheoryNikos Mylonakis. 394-408
- Swinging Data Types: Syntax, Semantics, and TheoryPeter Padawitz. 409-435
- Context InstitutionsWieslaw Pawlowski. 436-457
- Object-Oriented Functional Programming and Type ReconstructionZhenyu Qian, Bernd Krieg-Brückner. 458-477
- Moving Between Logical SystemsAndrzej Tarlecki. 478-502
- Modular Algebraic Specifications and the Orientation of Equations into Rewrite RulesFrédéric Voisin, Michel Bidoit. 503-521
- A Model for I/O in Equational Languages with Don t Care Non-determinismH. R. Walters, J. F. Th. Kamperman. 522-535
- Tool Design for Structuring Mechanisms for Algebraic Specification Languages with Initial SemanticsDietmar Wolz. 536-550