This paper develops a version of dependent type theory in which isomorphism is handled through a direct generalization of the 1939 definitions of Bourbaki. More specifically we generalize the Bourbaki definition of structure from simple type signatures to dependent type signatures. Both the original Bourbaki notion of isomorphism and its generalization given here define an isomorphism between two structures N and N ′ to consist of bijections between their sorts that transport the structure of N to the structure of N ′. Here transport is defined by commutativity conditions stated with set-theoretic equality. This differs from the dependent type theoretic treatments of isomorphism given in the groupoid model and homotopy type theory where no analogously straightforward set-theoretic definition of transport is specified. The straightforward definition of transport also leads to a straightforward constructive proof (constructive content) for the validity of the substitution of isomorphics — something that is difficult in the groupoid model or homotopy type theory.
[1]
M. Hofmann,et al.
The groupoid interpretation of type theory
,
1998
.
[2]
Benjamin Werner,et al.
The Not So Simple Proof-Irrelevant Model of CC
,
2002,
TYPES.
[3]
P. Martin-Löf.
An Intuitionistic Theory of Types: Predicative Part
,
1975
.
[4]
Gyesik Lee,et al.
Proof-irrelevant model of CC with predicative induction and judgmental equality
,
2011,
Log. Methods Comput. Sci..
[5]
Maintaining a Library of Formal Mathematics
,
2020,
CICM.
[6]
C. Flori,et al.
Homotopy Type Theory : Univalent Foundations of Mathematics
,
2014
.
[7]
Bengt Nordström,et al.
Programming in Martin-Löf's Type Theory
,
1990
.
[8]
John C. Reynolds,et al.
Polymorphism is not Set-Theoretic
,
1984,
Semantics of Data Types.
[9]
P. Lumsdaine,et al.
THE SIMPLICIAL MODEL OF UNIVALENT FOUNDATIONS
,
2014
.
[10]
Jeremy Avigad,et al.
The Lean Theorem Prover (System Description)
,
2015,
CADE.