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

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

33 Citations (Scopus)

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).

Original languageEnglish
Title of host publicationComputer Science Logic - 23rd International Workshop, CSL 2009 - 18th Annual Conference of the EACSL, Proceedings
Pages455-469
Number of pages15
DOIs
Publication statusPublished - 2009
Event23rd International Workshop on Computer Science Logic, CSL 2009 - 18th Annual Conference of the EACSL - Coimbra, Portugal
Duration: 2009 Sept 72009 Sept 11

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume5771 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference23rd International Workshop on Computer Science Logic, CSL 2009 - 18th Annual Conference of the EACSL
Country/TerritoryPortugal
CityCoimbra
Period09/9/709/9/11

Fingerprint

Dive into the research topics of 'A complete characterization of observational equivalence in polymorphic λ-calculus with general references'. Together they form a unique fingerprint.

Cite this