src/Doc/Prog_Prove/document/intro-isabelle.tex
changeset 58502 d37c712cc01b
parent 58483 d5f24630c104
child 58504 5f88c142676d
equal deleted inserted replaced
58501:fb6508a73261 58502:d37c712cc01b
     1 Isabelle is a generic system for
     1 Isabelle is a generic system for
     2 implementing logical formalisms, and Isabelle/HOL is the specialisation
     2 implementing logical formalisms, and Isabelle/HOL is the specialization
     3 of Isabelle for HOL, which abbreviates Higher-Order Logic. We introduce
     3 of Isabelle for HOL, which abbreviates Higher-Order Logic. We introduce
     4 HOL step by step following the equation
     4 HOL step by step following the equation
     5 \[ \mbox{HOL} = \mbox{Functional Programming} + \mbox{Logic}. \]
     5 \[ \mbox{HOL} = \mbox{Functional Programming} + \mbox{Logic}. \]
     6 We assume that the reader is used to logical and set-theoretic notation
     6 We assume that the reader is used to logical and set-theoretic notation
     7 and is familiar with the basic concepts of functional programming.
     7 and is familiar with the basic concepts of functional programming.