Remarks on isomorphisms in typed lambda calculi with empty and sum types

• Published in: Proceedings - Symposium on Logic in Computer Science pp. 147 - 156
• Main Authors: Fiore, M., Di Cosmo, R., Balat, V.
• Format: Conference Proceeding Journal Article
• Language: English
• Published: Los Alamitos CA IEEE 01.01.2002
• Subjects: Algebra; Applied sciences; Calculus; Computer languages; Computer science; control theory; systems; Digital arithmetic; Educational institutions; Equations; Exact sciences and technology; Functional programming; Laboratories; Language theory and syntactical analysis; Libraries; Logic programming; Theoretical computing; Type theory; Isomorphism; Programming language; Lambda calculus; Category theory; Equational theory
• ISBN: 9780769514833; 0769514839
• ISSN: 1043-6871; 2575-5528
• DOI: 10.1109/LICS.2002.1029824

Tarski asked whether the arithmetic identities taught in high school are complete for showing all arithmetic equations valid for the natural numbers. The answer to this question for the language of arithmetic expressions using a constant for the number one and the operations of product and exponentiation is affirmative, and the complete equational theory also characterises isomorphism in the typed lambda calculus, where the constant for one and the operations of product and exponentiation respectively correspond to the unit type and the product and arrow type constructors. This paper studies isomorphisms in typed lambda calculi with empty and sum types from this viewpoint. We close an open problem by establishing that the theory of type isomorphisms in the presence of product, arrow, and sum types (with or without the unit type) is not finitely axiomatisable. Further, we observe that for type theories with arrow, empty and sum types the correspondence between isomorphism and arithmetic equality generally breaks down, but that it still holds in some particular cases including that of type isomorphism with the empty type and equality with zero.