|
37
|
A Coinduction Principle for Recursive Data Types Based on Bisimulation
– Marcelo P. Fiore
- 1996
|
|
4
|
Semantics for Finite Delay
– Chrysafis Hartonas
- 1997
|
|
7
|
Branching vs. linear time – semantical perspective
– Sumit Nain, Moshe Y. Vardi
|
|
12
|
On the Foundations of Corecursion
– Lawrence S. Moss, NORMAN DANNER
- 1997
|
|
1
|
Modeling Fresh Names in the π-calculus Using Abstractions
– Roberto Bruni, Furio Honsell, Marina Lenisa, Marino Miculan
- 2004
|
|
85
|
Coalgebraic Logic
– Lawrence S. Moss
- 1999
|
|
7
|
A Structural Co-Induction Theorem
– J. J. M. M. Rutten
- 1993
|
|
52
|
Initial Algebra and Final Coalgebra Semantics for Concurrency
– Jan Rutten, Daniele Turi
- 1994
|
|
2
|
Lectures on Semantics: The initial algebra and final coalgebra perspectives
– Peter Aczel
|
|
7
|
A Small Final Coalgebra Theorem
– Yasuo Kawahara, Masao Mori
- 1998
|
|
19
|
Mathematical Modal Logic: a View of its Evolution
– Robert Goldblatt
- 2001
|
|
2
|
Final Coalgebras as Greatest Fixed Points in ZF Set Theory
– Lawrence C. Paulson, L. C. Paulson
- 1999
|
|
3
|
On a Functor for Probabilistic Bisimulation and Preservation of Weak Pullbacks
– E. P. De Vink
- 1998
|
|
9
|
Invariants, Bisimulations and the Correctness of Coalgebraic Refinements
– Bart Jacobs
- 1997
|
|
29
|
On the Foundations of Final Coalgebra Semantics: non-well-founded sets, partial orders, metric spaces
– Daniele Turi, Jan Rutten
- 1998
|
|
5
|
Fixpoint Semantics and Simulation
– Wim H. Hesselink, Albert Thijs, Rd February
- 2000
|
|
|
Axioms for Asynchronous Processes
– Eleftherios Matsikoudis, Eleftherios Matsikoudis, Eleftherios Matsikoudis, Eleftherios Matsikoudis
|
|
20
|
Finality Regained - A Coalgebraic Study of Scott-sets and Multisets
– Giovanna D'Agostino, Albert Visser
- 1999
|
|
55
|
Structural Induction and Coinduction in a Fibrational Setting
– Claudio Hermida, Bart Jacobs
- 1997
|
