A complete characterization of observational equivalence in polymorphic λ-calculus with general references

34Citations
Citations of this article
14Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We give the first sound and complete proof method for observational equivalence in full polymorphic λ-calculus with existential types and first-class, higher-order references. Our method is syntactic and elementary in the sense that it only employs simple structures such as relations on terms. It is nevertheless powerful enough to prove many interesting equivalences that can and cannot be proved by previous approaches, including the latest work by Ahmed, Dreyer and Rossberg (POPL 2009). © 2009 Springer Berlin Heidelberg.

Cite

CITATION STYLE

APA

Sumii, E. (2009). A complete characterization of observational equivalence in polymorphic λ-calculus with general references. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5771 LNCS, pp. 455–469). https://doi.org/10.1007/978-3-642-04027-6_33

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free