A formalization of System I with type Top in Agda
arXiv:2603.23652v1 Announce Type: new
Abstract: 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.
Like
0
Liked
Liked