A formalization of System I with type Top in Agda
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2026
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866910070291300352 |
|---|---|
| author | Séttimo, Agustín Sottile, Cristian Manzino, Cecilia |
| author_facet | Séttimo, Agustín Sottile, Cristian Manzino, Cecilia |
| contents | System I is a recently introduced simply-typed lambda calculus with pairs where isomorphic types are considered equal. In this work we propose a variant of System I with the type Top, and present a complete formalization of this calculus in Agda, which includes the proofs of progress and strong normalization. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2603_23652 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | A formalization of System I with type Top in Agda Séttimo, Agustín Sottile, Cristian Manzino, Cecilia Logic in Computer Science Programming Languages System I is a recently introduced simply-typed lambda calculus with pairs where isomorphic types are considered equal. In this work we propose a variant of System I with the type Top, and present a complete formalization of this calculus in Agda, which includes the proofs of progress and strong normalization. |
| title | A formalization of System I with type Top in Agda |
| topic | Logic in Computer Science Programming Languages |
| url | https://arxiv.org/abs/2603.23652 |