A Note on Logical Relations Between Semantics and Syntax (1997)

Cached

Download Links

by Andrew Pitts
Citations:9 - 0 self

Documents Related by Co-Citation

36 From Operational Semantics to Domain Theory – Ian A. Mason, Scott F. Smith, Carolyn L. Talcott - 1995
109 Proving congruence of bisimulation in functional programming languages – Douglas J. Howe - 1996
15 Final Semantics for a Higher Order Concurrent Language – Marina Lenisa - 1995
121 Bisimilarity as a theory of functional programming – A D Gordon
658 Concurrency and automata on infinite sequences – D Park - 1981
26 Type Theories, Normal Forms and D1-Lambda-Models. Information and Computation 72 – M COPPO, M DEZANI-CIANCAGLINI, M ZACCHI - 1987
26 An approximation theorem for topological lambda models and the topological incompleteness of lambda calculus – F Honsell, S Ronchi Della Rocca - 1992
18 Ronchi Della Rocca S., “Operational, Denotational and Logical Description: a case study – L Egidi, F Honsell - 1992
134 Games and Full Abstraction for the Lazy lambda-calculus – Samson Abramsky, Guy Mccusker - 1995
218 A filter lambda model and the completeness of type assignment – M Coppo - 1983
1125 The Lambda Calculus: Its Syntax and Semantics – H P Barendregt - 1981
239 The Lazy Lambda Calculus – Samson Abramsky - 1990
76 Operationally-based theories of program equivalence – Andrew Pitts - 1997
4 A Uniform Syntactical Method for Proving Coinduction Principles in lambda-calculi – Marina Lenisa - 1997
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
10 Final semantics for untyped lambdacalculus – Furio Honsell, Marina Lenisa - 1995
202 Non–Well–Founded Sets – P Aczel - 1988
162 A final coalgebra theorem – Peter Aczel, Nax Mendler - 1989