Operationally-based theories of program equivalence (1997)

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

Documents Related by Co-Citation

363 LCF considered as a programming language – G D Plotkin - 1977
102 Proving congruence of bisimulation in functional programming languages – Douglas J. Howe - 1996
35 From Operational Semantics to Domain Theory – Ian A. Mason, Scott F. Smith, Carolyn L. Talcott - 1995
102 Functional programming and input/output – A D Gordon - 1994
101 Operational Reasoning for Functions With Local State – Andrew Pitts, Ian Stark
109 Bisimilarity as a theory of functional programming – A Gordon - 1995
218 The Lazy Lambda Calculus – Samson Abramsky - 1990
108 Equivalence in Functional Languages with Effects – Ian Mason, Carolyn Talcott - 1991
104 Fully Abstract Models of Typed Lambda Calculi, Th – R Milner - 1977
92 Equality In Lazy Computation Systems – Douglas J. Howe - 1998
31 Relational Reasoning about Functions and Nondeterminism – Søren Bøgh Lassen, Søren Bøgh Lassen - 1998
33 Reasoning about local variables with operationally-based logical relations – Andrew M. Pitts - 1996
174 On full abstraction for pcf – M Hyland, L Ong - 2000
1182 A Structural Approach to Operational Semantics – G. D. Plotkin - 1981
128 Games and Full Abstraction for the Lazy lambda-calculus – Samson Abramsky, Guy Mccusker - 1995
2972 Communication and Concurrency – R Milner - 1989
33 Relational interpretations of recursive types in an operational setting – Lars Birkedal, Robert Harper - 1997
60 Remarks on algebraically compact categories – P Freyd - 1991
92 Relational Properties of Domains – Andrew M. Pitts - 1996