Jump to content

Empty type

From Wikipedia, the free encyclopedia

This is an old revision of this page, as edited by GünniX (talk | contribs) at 03:47, 27 October 2022 (Reflist). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

In type theory, the empty type or absurd type, typically denoted is a type with no terms. Such a type may be defined as the nullary coproduct (i.e. disjoint sum of no types).[1] It may also be defined as the polymorphic type [2]

For any type , the type is defined as . As the notation suggests, by the Curry–Howard correspondence, a term of type is a false proposition, and a term of type is a disproof of proposition P.[1]

A type theory need not contain an empty type. Where it exists, an empty type is not generally unique.[2] For instance, is also uninhabited for any inhabited type .

If a type system contains an empty type, the bottom type must be uninhabited too, so no distinction is drawn between them and both are denoted .

References

  1. ^ a b Univalent Foundations Program (2013). Homotopy Type Theory: Univalent Foundations of Mathematics. Institute for Advanced Study.
  2. ^ a b "Empty types in polymorphic lambda calculus". POPL: Principles of Programming Languages. 87. doi:10.1145/41625.41648. Retrieved 25 October 2022.