An Injective CPS-translation for the Extensional λ-calculus

Abstract

We give a syntactical proof to the statement that a novel CPS translation with surjective pairing is injective for the extensional λ-calculus. The result itself might be preliminary, since the source language (the extensional λ-calculus) of the translation is a sublanguage of the target language (λ-calculus with surjective pairing). However this paper shows that there exists a nontrivial injection from the extensional λ-calculus into the λ-calculus with surjective pairing. In this sense our result can be regarded as an extension of Plotkin, i.e., a call-by-value simulation of call-by-name λ-calculus with η-rule (extensionality). Moreover, the method presented here can be naturally extended to the case of the extensional λη-calculus which is defined from the extensional λ-calculus together with control operators.