Final Universes of Processes (1994)

Cached

Download Links

by Peter Aczel
Venue:PROC. MATH. FOUNDATIONS OF PROGRAMMING SEMANTICS. SPRINGER LECT. NOTES COMP. SCI. (802
Citations:19 - 1 self

Active Bibliography

37 A Coinduction Principle for Recursive Data Types Based on Bisimulation – Marcelo P. Fiore - 1996
4 Semantics for Finite Delay – Chrysafis Hartonas - 1997
12 Branching vs. linear time – semantical perspective – Sumit Nain, Moshe Y. Vardi
1 Modeling Fresh Names in the π-calculus Using Abstractions – Roberto Bruni, Furio Honsell, Marina Lenisa, Marino Miculan - 2004
13 On the Foundations of Corecursion – Lawrence S. Moss, NORMAN DANNER - 1997
1 Uniform Functors on Sets – Lawrence S. Moss
89 Coalgebraic Logic – Lawrence S. Moss - 1999
7 A Structural Co-Induction Theorem – J. J. M. M. Rutten - 1993
55 Initial Algebra and Final Coalgebra Semantics for Concurrency – Jan Rutten, Daniele Turi - 1994
7 A Small Final Coalgebra Theorem – Yasuo Kawahara, Masao Mori - 1998
3 Lectures on Semantics: The initial algebra and final coalgebra perspectives – Peter Aczel
2 Final Coalgebras as Greatest Fixed Points in ZF Set Theory – Lawrence C. Paulson, L. C. Paulson - 1999
28 Mathematical Modal Logic: a View of its Evolution – Robert Goldblatt - 2001
3 On a Functor for Probabilistic Bisimulation and Preservation of Weak Pullbacks – E. P. De Vink - 1998
Axioms for Asynchronous Processes – Eleftherios Matsikoudis, Eleftherios Matsikoudis, Eleftherios Matsikoudis, Eleftherios Matsikoudis
5 Fixpoint Semantics and Simulation – Wim H. Hesselink, Albert Thijs, Rd February - 2000
68 Objects and Classes, Coalgebraically – B. Jacobs, Issn -x, Bart Jacobs - 1995
30 On the Foundations of Final Coalgebra Semantics: non-well-founded sets, partial orders, metric spaces – Daniele Turi, Jan Rutten - 1998
journal homepage: www.elsevier.com/locate/tcs – Venanzio Capretta