default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMathematical 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
Volume 8, Number 2, April 1998
- 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
Volume 8, Number 3, June 1998
- Luca Aceto, Wan J. 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
Volume 8, Number 4, August 1998
- 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
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 - Daniele Turi, Jan J. M. M. Rutten:
On the Foundations of Final Coalgebra Semantics. Math. Struct. Comput. Sci. 8(5): 481-540 (1998)
Volume 8, Number 6, December 1998
- 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
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-11-21 20:33 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
