Problem
Research questions and friction points this paper is trying to address.
System I
type Top
isomorphic types
lambda calculus
formalization
A formalization of System I with type Top in Agda
📝 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.
Innovation
Methods, ideas, or system contributions that make the work stand out.
System I
Top type
Agda formalization
strong normalization
type isomorphism
🔎 Similar Papers
No similar papers found.
