Logic in Computer Science, Symposium on (2006)

Seattle, Washington

Aug. 12, 2006 to Aug. 15, 2006

ISSN: 1043-6871

ISBN: 0-7695-2631-4

pp: 297-306

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/LICS.2006.29

Soren B. Lassen , Google, Inc.

ABSTRACT

Bohm tree equivalence up to possibly infinite \eta expansion for the pure \lambda-calculus can be characterized as a bisimulation equivalence. We call this co-inductive syntactic theory extensional head normal form bisimilarity and in this paper we extend it to the \lambdaFP-calculus (the \lamda-calculus with functional and surjective pairing) and to two untyped variants of Parigot?s \lambda\mu-calculus. We relate the extensional head normal form bisimulation theories for the different calculi via Fujita?s extensional CPS transform into the \lambdaFPcalculus. We prove that extensional hnf bisimilarity is fully abstract for the pure \lambda-calculus by a co-inductive reformulation of Barendregt?s proof for Bohm tree equivalence up to possibly infinite \eta expansion. The proof uses the so-called Bohm-out technique from Bohm?s proof of the Separation Property for the \lambda-calculus. Moreover, we extend the full abstraction result to extensional hnf bisimilarity for the \lambdaFP-calculus. For the "standard" \lambda\mu-calculus, the Separation Property fails, as shown by David and Py, and for the same reason extensional hnf bisimilarity is not fully abstract. However, an "extended" variant of the \lambda\mu-calculus satisfies the Separation Property, as shown by Saurin, and we show that extensional hnf bisimilarity is fully abstract for this extended \lambda\mu-calculus.

INDEX TERMS

null

CITATION

S. B. Lassen, "Head Normal Form Bisimulation for Pairs and the \lambda\mu-Calculus,"

*21st Annual IEEE Symposium on Logic in Computer Science(LICS)*, Seattle, WA, 2006, pp. 297-306.

doi:10.1109/LICS.2006.29

CITATIONS

SEARCH