natural deduction metalanguage, practical foundations
type theory (dependent, intensional, observational type theory, homotopy type theory)
computational trinitarianism =
propositions as types +programs as proofs +relation type theory/category theory
Intensional type theory is the flavor of type theory in which identity types are not necessarily propositions (that is, (-1)-truncated). Martin-Löf‘s original definition of identity types, and the equivalent formulation as an inductive type, are by default intensional; one has to impose extra axioms or rules in order to get extensional type theory (in which identity types are propositions).
In particular, homotopy type theory is intensional, because identity types represent path objects.
Note that some type theorists use “intensional type theory” to refer to type theory which fails to satisfy function extensionality. This is in general an orthogonal requirement to how we are using the term here.
Only the intensional but not the extensional Martin-Löf type theory has decidable type checking. (Martin-Löf 75, Hofmann 95).
Per Martin-Löf, An intuitionistic theory of types: predicative part, in: H. E. Rose, J. C. Shepherdson (eds.), Logic Colloquium ‘73, Proceedings of the Logic Colloquium, Studies in Logic and the Foundations of Mathematics 80 Pages 73-118, Elsevier 1975 (doi:10.1016/S0049-237X(08)71945-1, CiteSeer)
Martin Hofmann, Extensional concepts in intensional type theory, Ph.D. thesis, University of
Edinburgh, (1995) (ECS-LFCS-95-327, pdf)
Last revised on May 13, 2021 at 01:50:47. See the history of this page for a list of all contributions to it.