Inferring the Equivalence of Functional Programs that Mutate Data

Inferring the Equivalence of Functional Programs that Mutate Data (1992)

Cached

Download Links

[turing.une.edu.au]

Other Repositories/Bibliography

DBLP

by Ian Mason , Carolyn Talcott

Venue:	Theoretical Computer Science
Citations:	24 - 7 self

Versions

Version History

Metadata Version 3

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	Inferring the Equivalence of Functional Programs that Mutate Data	user correction - Legacy Corrections
AUTHOR NAME	Ian Mason	SVM HeaderParse 0.1
AUTHOR AFFIL	Stanford University	SVM HeaderParse 0.2
AUTHOR NAME	Carolyn Talcott	SVM HeaderParse 0.1
AUTHOR AFFIL	Stanford University	SVM HeaderParse 0.2
ABSTRACT	this paper we study the constrained equivalence of programs with effects. In particular, we present a formal system for deriving such equivalences. Constrained equivalence is defined via a model theoretic characterization of operational, or observational, equivalence called strong isomorphism. Operational equivalence, as introduced by Morris [23] and Plotkin [27], treats programs as black boxes. Two expressions are operationally equivalent if they are indistinguishable in all program contexts. This equivalence is the basis for soundness results for program calculi and program transformation theories. Strong isomorphism, as introduced by Mason [14], also treats programs as black boxes. Two expressions are strongly isomorphic if in all memory states they return the same value, and have the same effect on memory (modulo the production of garbage). Strong isomorphism implies operational equivalence. The converse is true for first-order languages; it is false for full higher-order languages. However, even in the higher-order case, it remains an useful tool for establishing equivalence. Since strong isomorphism is defined by quantifying over memory states, rather than program contexts, it is a simple matter to restrict this equivalence to those memory states which satisfy a set of constraints. It is for this reason that strong isomorphism is a useful relation, even in the higher-order case. The formal system we present defines a single-conclusion consequence relation \Sigma ` \Phi where \Sigma is a finite set of constraints and \Phi is an assertion. The semantics of the formal system is given by a semantic consequence relation, \Sigma j= \Phi, defined in terms of a class of memory models for assertions and constraints. The assertions we consider are of the following two forms...	user correction - Legacy Corrections
YEAR	1992	INFERENCE
VENUE	Theoretical Computer Science	INFERENCE
VENUE TYPE	JOURNAL	INFERENCE
PAGES	186--197	INFERENCE
VOLUME	105	INFERENCE
CITATIONS	27 found	ParsCit 1.0