Galois Embedding from Polymorphic Types into Existential Types

Abstract

We show that there exist bijective translations between polymorphic λ-calculus and a subsystem of minimal logic with existential types, which form a Galois connection and moreover a Galois embedding. From a programming point of view, this result means that polymorphic functions can be represented by abstract data types. 
DOI: 10.1007/11417170_15

Topics

Cite this paper

@inproceedings{Fujita2005GaloisEF, title={Galois Embedding from Polymorphic Types into Existential Types}, author={Ken-etsu Fujita}, booktitle={TLCA}, year={2005} }