Relational reasoning for recursive types and references

Relational reasoning for recursive types and references (2006)

by Nina Bohr , Lars Birkedal

Venue:	ASIAN SYMPOSIUM ON PROGRAMMING LANGUAGES AND SYSTEMS (APLAS)
Citations:	22 - 5 self

User correction supplied by jfernandez

Datum	Value	Source
TITLE	Relational reasoning for recursive types and references	INFERENCE
AUTHOR NAME	Nina Bohr	user correction
AUTHOR AFFIL	IT University of Copenhagen (ITU)	user correction
AUTHOR NAME	Lars Birkedal	user correction
AUTHOR AFFIL	IT University of Copenhagen (ITU)	user correction
ABSTRACT	We present a local relational reasoning method for reasoning about contextual equivalence of expressions in a λ-calculus with recursive types and general references. Our development builds on the work of Benton and Leperchey, who devised a nominal semantics and a local relational reasoning method for a language with simple types and simple references. Their method uses a parameterized logical relation. Here we extend their approach to recursive types and general references. For the extension, we build upon Pitts ’ and Shinwell’s work on relational reasoning about recursive types (but no references) in nominal semantics. The extension is non-trivial because of general references (higher-order store) and makes use of some new ideas for proving the existence of the parameterized logical relation and for the choice of parameters.	user correction
YEAR	2006	INFERENCE
VENUE	ASIAN SYMPOSIUM ON PROGRAMMING LANGUAGES AND SYSTEMS (APLAS)	user correction
VENUE TYPE	CONFERENCE	INFERENCE
PAGES	79--96	INFERENCE
VOLUME	4279	user correction
CITATIONS	8 found	ParsCit 1.0