## Operationally-based theories of program equivalence (1997)

Venue: | Semantics and Logics of Computation |

Citations: | 75 - 4 self |

### BibTeX

@INPROCEEDINGS{Pitts97operationally-basedtheories,

author = {Andrew Pitts},

title = {Operationally-based theories of program equivalence},

booktitle = {Semantics and Logics of Computation},

year = {1997},

pages = {241--298},

publisher = {Cambridge University Press}

}

### Years of Citing Articles

### OpenURL

### Abstract

### Citations

1311 | Introduction to Functional Programming - Bird, Wadler - 1988 |

731 |
Structure and interpretation of computer programs. MIT electrical engineering and computer science series
- Abelson, Sussman, et al.
- 1991
(Show Context)
Citation Context ...lymorphic types. Languages with state One can extend the methods described in this article to lambda-calculus based imperative programming languages---such as Idealised Algol (Reynolds 1981), Scheme (=-=Abelson and Susman 1985-=-), or Standard ML (Milner, Tofte, and Harper 1990). For work based directly on contextual equivalence for a Scheme-like language, see (Mason and Talcott 1991; Mason and Talcott 1992). For work employi... |

200 |
1984] The Lambda Calculus: its Syntax and Semantics , revised edition
- Barendregt
(Show Context)
Citation Context ...probably be better, both from an implementation as well as a semantic point of view, to use a more abstract form of representation without explicit bound variables---such as de Bruijn's notation (see =-=Barendregt 1984-=-, Appendix C). However such a representation tends to be hard to read, so we will stick with the more familiar form of syntax given in Figure 1. But be warned that we will not make a notational distin... |

133 | Full Abstraction in the Lazy Lambda Calculus
- Abramsky, Ong
- 1993
(Show Context)
Citation Context ... M ' 0 ffi M 0 : The relation ' 0 is a version for PCFL of Abramsky's notion of applicative bisimulation which he developed in his work with Ong on the untyped, `lazy' lambda calculus (Abramsky 1990; =-=Abramsky and Ong 1993). T-=-he above theorem can be proved using the operationally-based methods developed by Howe (1989, Howe (1996) and which we employ in the Appendix. to prove the coincidence of �� = gnd and '. Convergen... |

121 |
Bisimilarity as a theory of functional programming
- Gordon
- 1999
(Show Context)
Citation Context ...equal" means contextually equivalent, then one can prove the validity of this principle by appealing to the coinductive characterisation of �� = gnd at list types given by Proposition 3.10. (=-=See also Gordon 1995b, Section 4.6.) Pro-=-of. Fixing the type �� , define R ` Exp [�� ] \Theta Exp [�� ] by: R def = f(L; L 0 ) j 8n 2 N (take nL �� = gnd [�� ] take nL 0 )g I claim that R satisfies the conditions (3.8)--(... |

105 |
Functional programming and Input/Output
- Gordon
- 1994
(Show Context)
Citation Context ...ted into the world of lambda calculus and functional programming by several people: see Dybjer and Sander (1989); Abramsky (1990); Howe (1989, Howe (1996); Egidi, Honsell, and della Rocca (1992); and =-=Gordon 1994-=-. I will also present proofs of some `domain-theoretic' properties 242 Pitts of the operational semantics. To keep things simple, but non-trivial, the example programming language used throughout is a... |

23 |
The lazy -calculus
- Abramsky
- 1990
(Show Context)
Citation Context ...: oe , \Gamma ` M ' 0 ffi M 0 : The relation ' 0 is a version for PCFL of Abramsky's notion of applicative bisimulation which he developed in his work with Ong on the untyped, `lazy' lambda calculus (=-=Abramsky 1990; Ab-=-ramsky and Ong 1993). The above theorem can be proved using the operationally-based methods developed by Howe (1989, Howe (1996) and which we employ in the Appendix. to prove the coincidence of ��... |

8 | E.: Do-it-yourself type theory. Formal Aspects of Computing 1(1 - Backhouse, Chisholm, et al. - 1989 |

7 | Relating Operational and Denotational Semantics for Input/Output Effects
- Crole, Gordon
- 1999
(Show Context)
Citation Context ...n terms in a strict version of PCFL. Operationally-Based Theories of Program Equivalence 283 to ML- and Algol-like languages, see (Pitts and Stark 1993; Ritter and Pitts 1995; Stark 1995; Pitts 1996; =-=Crole and Gordon 1996-=-). Concerning the status of Operational Extensionality theorems for functional languages with state, the situation is as follows. With some simplifying assumptions, an evaluation relation for such lan... |

7 | On backtracking and greatest fixpoints - ROEVER - 1977 |

7 | A functional programming approach to the specification and verification of concurrent systems - Dybjer, Sanders - 1989 |

7 | Operational, denotational and logical descriptions: a case study - Egidi, Honsell, et al. - 1992 |