Acc
(accessibility)Bar
(simulated partial computable objects)Bool
Decidable
Finite
FiniteMap
GirardParadox
(type is not a type)Integer
Logic
List
Miscellaneous
Nat
Natural
(natural numbers using “native” arithmetic)Option
Partial
(partial computable objects)Permutation
(permutations on lists)Relations
SmithParadox
(there exist inadmissible types)Stable
Symbol
Tuple
Union
(elimination forms for union
and iexists
)Wtype
(well-founded types)