/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)

N="left">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 ]