Polymorphic System I

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

Full description

Saved in:
Bibliographic Details
Published inarXiv.org
Main Authors Sottile, Cristian F, Díaz-Caro, Alejandro, Martínez López, Pablo E
Format Paper Journal Article
LanguageEnglish
Published Ithaca Cornell University Library, arXiv.org 19.05.2021
Subjects
Computer Science - Logic in Computer Science
Isomorphism
Online AccessGet full text

Cover

More Information
Summary: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.
Bibliography:SourceType-Working Papers-1
ObjectType-Working Paper/Pre-Print-1
content type line 50
ISSN:2331-8422
DOI:10.48550/arxiv.2101.03215