|
43
|
Presheaf Models for Concurrency
– Gian Luca Cattani
- 1999
|
|
29
|
On the Foundations of Final Coalgebra Semantics: non-well-founded sets, partial orders, metric spaces
– Daniele Turi, Jan Rutten
- 1998
|
|
92
|
Relational Properties of Domains
– Andrew M. Pitts
- 1996
|
|
7
|
A Structural Co-Induction Theorem
– J. J. M. M. Rutten
- 1993
|
|
21
|
Correspondence between Operational and Denotational Semantics
– C. -h. L. Ong
- 1995
|
|
27
|
Domains and Denotational Semantics: History, Accomplishments and Open Problems
– Marcelo Fiore, Achim Jung, Eugenio Moggi, Peter O'Hearn, Jon Riecke, Giuseppe Rosolini, Ian Stark
- 1996
|
|
47
|
On the Foundations of Final Semantics: Non-Standard Sets, Metric Spaces, Partial Orders
– Jan J. M. M. Rutten , Daniele Turi
- 1998
|
|
279
|
Universal coalgebra: a theory of systems
– J. J. M. M. Rutten
- 2000
|
|
40
|
A Co-induction Principle for Recursively Defined Domains
– Andrew Pitts
|
|
5
|
Themes in Final Semantics
– Marina Lenisa
- 1998
|
|
3
|
Coinduction for recursive data types: partial orders, metric spaces and Omega-categories
– James Worrell
- 2000
|
|
27
|
Syntactic considerations on recursive types
– Marcelo P. Fiore
- 1996
|
|
1
|
The Convex Powerdomain in a Category of Posets Realized By Cpos
– Alex K. Simpson
- 1995
|
|
8
|
Topology, Domain Theory and Theoretical Computer Science
– Michael W. Mislove
- 1997
|
|
|
Axioms for Asynchronous Processes
– Eleftherios Matsikoudis, Eleftherios Matsikoudis, Eleftherios Matsikoudis, Eleftherios Matsikoudis
|
|
23
|
A Theory of Recursive Domains with Applications to Concurrency
– Gian Luca Cattani, Marcelo P. Fiore, Glynn Winskel
- 1997
|
|
1
|
Implicit Programming and Computable Optimal Fixed Points
– Anna Patterson, Tom Costello
- 1997
|
|
11
|
From Set-theoretic Coinduction to Coalgebraic Coinduction: some results, some problems
– Marina Lenisa
- 1999
|
|
16
|
Higher Order Logic
– Daniel Leivant
- 1994
|
