A formalization of System I with type Top in Agda
arXiv:2603.2365221.1h-index: 2
AI Analysis
This work addresses a formal verification problem for type theory researchers, but it is incremental as it builds on the existing System I calculus.
The authors tackled the formalization of a variant of System I, a simply-typed lambda calculus with pairs, by adding the type Top and provided a complete Agda formalization, including proofs of progress and strong normalization.
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.