Operationally-based theories of program equivalence (1997)

by Andrew Pitts
Venue:Semantics and Logics of Computation
Citations:75 - 4 self

Documents Related by Co-Citation

110 Operational Reasoning for Functions With Local State – Andrew Pitts, Ian Stark
106 Proving congruence of bisimulation in functional programming languages – Douglas J. Howe - 1996
111 Equivalence in Functional Languages with Effects – Ian Mason, Carolyn Talcott - 1991
397 LCF considered as a programming language – Gordon D Plotkin - 1977
36 From Operational Semantics to Domain Theory – Ian A. Mason, Scott F. Smith, Carolyn L. Talcott - 1995
105 Functional Programming and Input/Output – Andrew D Gordon - 1993
239 The Lazy Lambda Calculus – Samson Abramsky - 1990
120 Bisimilarity as a theory of functional programming – A D Gordon - 1995
34 Operational Semantics and Program Equivalence – Andrew M. Pitts - 2000
109 Fully abstract models of the typed lambda calculus – Robin Milner - 1977
95 Equality In Lazy Computation Systems – Douglas J. Howe - 1998
18 From Operational to Denotational Semantics – Scott Smith - 1989
31 Relational Reasoning about Functions and Nondeterminism – Søren Bøgh Lassen, Søren Bøgh Lassen - 1998
32 Reasoning about local variables with operationally-based logical relations – Andrew M. Pitts - 1996
1286 A Structural Approach to Operational Semantics – G. D. Plotkin - 1981
133 Games and Full Abstraction for the Lazy lambda-calculus – Samson Abramsky, Guy Mccusker - 1995
3204 Communication and Concurrency – R Milner - 1989
34 Relational interpretations of recursive types in an operational setting – Lars Birkedal, Robert Harper - 1997
99 Relational Properties of Domains – Andrew M. Pitts - 1996