HOL
Higher Order Logic. A proof-generating sy stem for {higher order logic} ba sed on {LCF}. Implementation s include {HOL-88} and HOL-90. . Mailing li st: info-hol@ted.c s.uidaho.edu. ["HOL: A Machine Oriented Formulation of Higher Order Logic", M.J.C. Gordon, Report 68, Comp Lab U Cambridge (1985)]. ["Introduction to HOL", M.J.C. Gordon et al, Cambridge U Pre ss 1993 I sBN 0-521-441897]. style="border-width:thin; border-color:#333333; border-style:dashed; padding:5px;" align="left">In addition suitable contents: [ 2 ] [ = ] [ @ ] [ ai ] [ al ] [ am ] [ an ] [ ar ] [ arc ] [ as ] [ at ] [ B ] [ b ] [ ba ] [ base ] [ br ] [ bridge ] [ C ] [ ch ] [ cl ] [ de ] [ do ] [ du ] [ ed ] [ edu ] [ er ] [ era ] [ es ] [ et ] [ fi ] [ file ] [ fo ] [ for ] [ G ] [ ge ] [ gen ] [ gh ] [ gi ] [ Go ] [ h ] [ HOL-88 ] [ HOL-90 ] [ hr ] [ id ] [ ie ] [ il ] [ in ] [ inc ] [ include ] [ io ] [ Is ] [ is ] [ J ] [ la ] [ LCF ] [ Lex ] [ li ] [ list ] [ lu ] [ M ] [ Mac ] [ Mach ] [ mo ] [ mod ] [ module ] [ mp ] [ mu ] [ N ] [ na ] [ nc ] [ ne ] [ nf ] [ ng ] [ ns ] [ O ] [ om ] [ ph ] [ pl ] [ port ] [ pr ] [ proof ] [ query ] [ rc ] [ re ] [ ro ] [ s ] [ se ] [ st ] [ sy ] [ system ] [ to ] [ tp ] [ tr ] [ uid ]
[ Go Back ]
Free On-line Dictionary of Computing Copyright © by OnlineWoerterBuecher.de - (3152 Reads) |