Mathematical Structures in Computer Science, Volume 8

Volume 8, Number 1, February 1998

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

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

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
Ernest G. Manes: Implementing Collection Classes with Monads. 231-276
Burghard von Karger: Temporal Algebra. 277-320

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

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

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