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

Style="border-width:thin; border-color:#333333; border-Style:daShed; padding:5px;" align="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 ]