The following libraries are pre-loaded:
Acc (accessibility)BoolDecidableEventually (simulated partial computable objects)FiniteFiniteMapFunctionIntegerIrrelevance (proof irrelevance)Kindlike (types eligible for impredicative quantification)LogicListMiscNatNatural (natural numbers using “native” arithmetic)OptionPartial (partial computable objects)Permutation (permutations on lists)Quotient (tools for manipulating quotient types)RelationsSqstableStableSymbolTupleWeaksum (an improved interface for union types)Wtype (well-founded types)The following libraries can be loaded from the library directory:
GirardParadox (type is not a type)SmithParadox (there exist inadmissible types)