/nyu p*rl/ Nearly Ultimate PRL. A system for interactive creation of formal mathematics, including definitions and proofs. It has an extremely rich type system, including dependent functions, products, sets, quotients and universes. Types are first-class citizens. It is built on Franz Lisp and Edinburgh ML. ["Implementing Mathematics in the Nuprl Proof Development System", R.L. Constable et al, P-H 1986]. (1994-12-13)

In addition suitable contents:
[ 2 ] [ = ] [ al ] [ am ] [ an ] [ ar ] [ arc ] [ as ] [ at ] [ b ] [ C ] [ ch ] [ ci ] [ cl ] [ class ] [ cr ] [ D ] [ de ] [ ding ] [ du ] [ E ] [ er ] [ era ] [ es ] [ et ] [ fi ] [ file ] [ fo ] [ for ] [ Franz Lisp ] [ function ] [ gh ] [ h ] [ hr ] [ id ] [ ie ] [ il ] [ in ] [ inc ] [ int ] [ interactive ] [ io ] [ ir ] [ is ] [ it ] [ la ] [ Lex ] [ Lisp ] [ lt ] [ lu ] [ ly ] [ M ] [ ma ] [ ML ] [ mo ] [ mod ] [ module ] [ mp ] [ N ] [ na ] [ nc ] [ ng ] [ ni ] [ ns ] [ nz ] [ op ] [ pe ] [ ph ] [ pl ] [ pm ] [ PR ] [ pr ] [ PRL ] [ product ] [ proof ] [ query ] [ quotient ] [ rc ] [ re ] [ RL ] [ rl ] [ ro ] [ S ] [ se ] [ set ] [ st ] [ sy ] [ system ] [ T ] [ table ] [ th ] [ tr ] [ type ] [ up ] [ ve ] [ yu ] [ zen ]