Mathematical Structures in Computer Science, Volume 8

Volume 8, Number 1, February 1998

• Clifford Bergman, Joel Berman: Algorithms for Categorical Equivalence. 1-15 BibTeX
• Maura Cerioli, Gianna Reggio: Very Abstract Specifications: A Formalism Independent Approach. 17-66 BibTeX
• Hermann Puhlmann: Re-Grouping Information in a Domain-Theoretic Data Model. 67-92 BibTeX

Volume 8, Number 2, April 1998

• Robert D. Rosebrugh, Nicoletta Sabadini, Robert F. C. Walters: Minimal Realization in Bicategories of Automata. 93-116 BibTeX
• Vladimiro Sassone: An Axiomatization of the Category of Petri Net Computations. 117-151 BibTeX
• Djordje Cubric, Peter Dybjer, Philip J. Scott: Normalization and the Yoneda Embedding. 153-192 BibTeX

Volume 8, Number 3, June 1998

• Luca Aceto, Wan Fokkink, Anna Ingólfsdóttir: A Menagerie of NonFfinitely Based Process Semantics over BPA* - From Ready Simulation to Completed Traces. 193-230 BibTeX
• Ernest G. Manes: Implementing Collection Classes with Monads. 231-276 BibTeX
• Burghard von Karger: Temporal Algebra. 277-320 BibTeX

Volume 8, Number 4, August 1998

• Hideki Tsuiki: A Computationally Adequate Model for Overloading via Domain-Valued Functors. 321-349 BibTeX
• David A. Naumann: A Categorical Model for Higher Order Imperative Programming. 351-399 BibTeX
• Davide Ancona, Elena Zucca: A Theory of Mixin Modules: Basic and Derived Operators. 401-446 BibTeX

Volume 8, Number 5, October 1998

• Davide Sangiorgi: On the Foundations of Final Coalgebra Semantics: Non-Well-Founded Sets, Partial Orders, Metric Spaces. 447-480 BibTeX
• Daniele Turi, Jan J. M. M. Rutten: On the Foundations of Final Coalgebra Semantics. 481-540 BibTeX

Volume 8, Number 6, December 1998

• Thomas Ehrhard, Yves Lafont, Laurent Regnier: Foreword. 541 BibTeX
• Denis Béchet: Minimality of the correctness criterion for multiplicative proof nets. 543-558 BibTeX
• Pierre-Louis Curien: Abstract Böhm trees. 559-591 BibTeX
• Maribel Fernández: Type assignment and termination of interaction nets. 593-636 BibTeX
• Philippe de Groote: An environment machine for the lambda-mu-calculus. 637-669 BibTeX
• Gérard P. Huet: Regular Böhm trees. 671-680 BibTeX
• Guy Perrier: Concurrent programming as proof net construction. 681-710 BibTeX