|
35
|
From Operational Semantics to Domain Theory
– Ian A. Mason, Scott F. Smith, Carolyn L. Talcott
- 1995
|
|
102
|
Proving congruence of bisimulation in functional programming languages
– Douglas J. Howe
- 1996
|
|
16
|
Final Semantics for a Higher Order Concurrent Language
– Marina Lenisa
- 1995
|
|
109
|
Bisimilarity as a theory of functional programming
– A Gordon
- 1995
|
|
599
|
Concurrency and automata on infinite sequences
– D Park
- 1981
|
|
17
|
S.Ronchi Della Rocca, Operational, denotational and logical Descriptions: a Case Study
– F Honsell L Egidi
- 1992
|
|
25
|
An approximation theorem for topological lambda models and the topological incompleteness of lambda calculus
– S Ronchi Della Rocca F Honsell
- 1992
|
|
26
|
Type Theories, Normal Forms and D1-Lambda-Models. Information and Computation 72
– M COPPO, M DEZANI-CIANCAGLINI, M ZACCHI
- 1987
|
|
200
|
A filter lambda model and the completeness of type assignment
– H Barendregt, M Coppo, M Dezani-Ciancaglini
- 1983
|
|
128
|
Games and Full Abstraction for the Lazy lambda-calculus
– Samson Abramsky, Guy Mccusker
- 1995
|
|
997
|
The Lambda Calculus: its Syntax and Semantics
– H P Barendregt
- 1984
|
|
73
|
Operationally-based theories of program equivalence
– Andrew Pitts
- 1997
|
|
218
|
The Lazy Lambda Calculus
– Samson Abramsky
- 1990
|
|
4
|
A Uniform Syntactical Method for Proving Coinduction Principles in lambda-calculi
– Marina Lenisa
- 1997
|
|
11
|
Final Semantics for untyped λ-calculus
– Furio Honsell, Marina Lenisa
- 1995
|
|
9
|
Semantic Techniques for Deriving Coinductive Characterizations of Observational Equivalences for -calculi
– M Lenisa
|
|
37
|
A Coinduction Principle for Recursive Data Types Based on Bisimulation
– Marcelo P. Fiore
- 1996
|
|
53
|
Set-theory with free construction principles
– M Forti, F Honsell
- 1983
|
|
186
|
Non-well-founded sets
– P ACZEL
- 1988
|
