Polymorphic System I
Logic in Computer Science
2021-07-28 v2
Abstract
System I is a simply-typed lambda calculus with pairs, extended with an equational theory obtained from considering the type isomorphisms as equalities. In this work we propose an extension of System I to polymorphic types, adding the corresponding isomorphisms. We provide non-standard proofs of subject reduction and strong normalisation, extending those of System I.
Keywords
Cite
@article{arxiv.2101.03215,
title = {Polymorphic System I},
author = {Cristian F. Sottile and Alejandro Díaz-Caro and Pablo E. Martínez López},
journal= {arXiv preprint arXiv:2101.03215},
year = {2021}
}
Comments
20 pages plus appendix