1.1 --- a/doc-src/HOL/Makefile Wed May 05 18:07:38 1999 +0200
1.2 +++ b/doc-src/HOL/Makefile Wed May 05 18:08:01 1999 +0200
1.3 @@ -1,34 +1,29 @@
1.4 -# $Id$
1.5 -#########################################################################
1.6 -# #
1.7 -# Makefile for the report "Isabelle's Logics: HOL" #
1.8 -# #
1.9 -#########################################################################
1.10 +#
1.11 +# $Id$
1.12 +#
1.13
1.14 +## targets
1.15
1.16 -FILES = logics-HOL.tex ../Logics/syntax.tex HOL.tex \
1.17 +default: dvi
1.18 +dist: dvi
1.19 +
1.20 +
1.21 +## dependencies
1.22 +
1.23 +include ../Makefile.in
1.24 +
1.25 +NAME = logics-HOL
1.26 +FILES = logics-HOL.tex ../Logics/syntax.tex HOL.tex \
1.27 ../rail.sty ../proof.sty ../iman.sty ../extra.sty
1.28
1.29 -logics-HOL.dvi.gz: $(FILES)
1.30 - test -r isabelle_hol.eps || ln -s ../gfx/isabelle_hol.eps .
1.31 - -rm logics-HOL.dvi*
1.32 - latex logics-HOL
1.33 - rail logics-HOL
1.34 - bibtex logics-HOL
1.35 - latex logics-HOL
1.36 - latex logics-HOL
1.37 - ../sedindex logics-HOL
1.38 - latex logics-HOL
1.39 - gzip -f logics-HOL.dvi
1.40 +dvi: $(NAME).dvi
1.41
1.42 -dist: $(FILES)
1.43 - test -r isabelle_hol.eps || ln -s ../gfx/isabelle_hol.eps .
1.44 - -rm logics-HOL.dvi*
1.45 - latex logics-HOL
1.46 - latex logics-HOL
1.47 - ../sedindex logics-HOL
1.48 - latex logics-HOL
1.49 -
1.50 -clean:
1.51 - @rm *.aux *.log *.toc *.idx *.rai
1.52 -
1.53 +$(NAME).dvi: $(FILES) isabelle_hol.eps
1.54 + touch $(NAME).ind
1.55 + $(LATEX) $(NAME)
1.56 + $(RAIL) $(NAME)
1.57 + $(BIBTEX) $(NAME)
1.58 + $(LATEX) $(NAME)
1.59 + $(LATEX) $(NAME)
1.60 + $(SEDINDEX) $(NAME)
1.61 + $(LATEX) $(NAME)
2.1 --- a/doc-src/HOL/logics-HOL.bbl Wed May 05 18:07:38 1999 +0200
2.2 +++ /dev/null Thu Jan 01 00:00:00 1970 +0000
2.3 @@ -1,123 +0,0 @@
2.4 -\begin{thebibliography}{10}
2.5 -
2.6 -\bibitem{andrews86}
2.7 -Peter Andrews.
2.8 -\newblock {\em An Introduction to Mathematical Logic and Type Theory: to Truth
2.9 - through Proof}.
2.10 -\newblock Computer Science and Applied Mathematics. Academic Press, 1986.
2.11 -
2.12 -\bibitem{church40}
2.13 -Alonzo Church.
2.14 -\newblock A formulation of the simple theory of types.
2.15 -\newblock {\em J. Symb. Logic}, 5:56--68, 1940.
2.16 -
2.17 -\bibitem{frost93}
2.18 -Jacob Frost.
2.19 -\newblock A case study of co-induction in {Isabelle HOL}.
2.20 -\newblock Technical Report 308, Computer Laboratory, University of Cambridge,
2.21 - August 1993.
2.22 -
2.23 -\bibitem{mgordon-hol}
2.24 -M.~J.~C. Gordon and T.~F. Melham.
2.25 -\newblock {\em Introduction to {HOL}: A Theorem Proving Environment for Higher
2.26 - Order Logic}.
2.27 -\newblock Cambridge University Press, 1993.
2.28 -
2.29 -\bibitem{mw81}
2.30 -Zohar Manna and Richard Waldinger.
2.31 -\newblock Deductive synthesis of the unification algorithm.
2.32 -\newblock {\em Science of Computer Programming}, 1(1):5--48, 1981.
2.33 -
2.34 -\bibitem{milner78}
2.35 -Robin Milner.
2.36 -\newblock A theory of type polymorphism in programming.
2.37 -\newblock {\em J. Comp.\ Sys.\ Sci.}, 17:348--375, 1978.
2.38 -
2.39 -\bibitem{milner-coind}
2.40 -Robin Milner and Mads Tofte.
2.41 -\newblock Co-induction in relational semantics.
2.42 -\newblock {\em Theoretical Computer Science}, 87:209--220, 1991.
2.43 -
2.44 -\bibitem{nipkow-W}
2.45 -Wolfgang Naraschewski and Tobias Nipkow.
2.46 -\newblock Type inference verified: Algorithm {W} in {Isabelle/HOL}.
2.47 -\newblock In E.~Gim\'enez and C.~Paulin-Mohring, editors, {\em Types for Proofs
2.48 - and Programs: Intl. Workshop TYPES '96}, volume 1512 of {\em Lect.\ Notes in
2.49 - Comp.\ Sci.}, pages 317--332. Springer-Verlag, 1998.
2.50 -
2.51 -\bibitem{NaraschewskiW-TPHOLs98}
2.52 -Wolfgang Naraschewski and Markus Wenzel.
2.53 -\newblock Object-oriented verification based on record subtyping in
2.54 - higher-order logic.
2.55 -\newblock In {\em Theorem Proving in Higher Order Logics (TPHOLs'98)}, volume
2.56 - 1479 of {\em Lect.\ Notes in Comp.\ Sci.} Springer-Verlag, 1998.
2.57 -
2.58 -\bibitem{Nipkow-CR}
2.59 -Tobias Nipkow.
2.60 -\newblock More {Church-Rosser} proofs (in {Isabelle/HOL}).
2.61 -\newblock In M.~McRobbie and J.K. Slaney, editors, {\em Automated Deduction ---
2.62 - CADE-13}, volume 1104 of {\em Lect.\ Notes in Comp.\ Sci.}, pages 733--747.
2.63 - Springer-Verlag, 1996.
2.64 -
2.65 -\bibitem{nipkow-IMP}
2.66 -Tobias Nipkow.
2.67 -\newblock Winskel is (almost) right: Towards a mechanized semantics textbook.
2.68 -\newblock {\em Formal Aspects Comput.}, 10:171--186, 1998.
2.69 -
2.70 -\bibitem{paulson85}
2.71 -Lawrence~C. Paulson.
2.72 -\newblock Verifying the unification algorithm in {LCF}.
2.73 -\newblock {\em Science of Computer Programming}, 5:143--170, 1985.
2.74 -
2.75 -\bibitem{paulson-CADE}
2.76 -Lawrence~C. Paulson.
2.77 -\newblock A fixedpoint approach to implementing (co)inductive definitions.
2.78 -\newblock In Alan Bundy, editor, {\em Automated Deduction --- {CADE}-12
2.79 - International Conference}, LNAI 814, pages 148--161. Springer, 1994.
2.80 -
2.81 -\bibitem{paulson-set-II}
2.82 -Lawrence~C. Paulson.
2.83 -\newblock Set theory for verification: {II}. {Induction} and recursion.
2.84 -\newblock {\em J. Auto. Reas.}, 15(2):167--215, 1995.
2.85 -
2.86 -\bibitem{paulson-coind}
2.87 -Lawrence~C. Paulson.
2.88 -\newblock Mechanizing coinduction and corecursion in higher-order logic.
2.89 -\newblock {\em J. Logic and Comput.}, 7(2):175--204, March 1997.
2.90 -
2.91 -\bibitem{paulson-jcs}
2.92 -Lawrence~C. Paulson.
2.93 -\newblock The inductive approach to verifying cryptographic protocols.
2.94 -\newblock {\em J. Comput. Secur.}, 6:85--128, 1998.
2.95 -
2.96 -\bibitem{paulson-COLOG}
2.97 -Lawrence~C. Paulson.
2.98 -\newblock A formulation of the simple theory of types (for {Isabelle}).
2.99 -\newblock In P.~Martin-L\"of and G.~Mints, editors, {\em COLOG-88:
2.100 - International Conference on Computer Logic}, LNCS 417, pages 246--274,
2.101 - Tallinn, Published 1990. Estonian Academy of Sciences, Springer.
2.102 -
2.103 -\bibitem{pelletier86}
2.104 -F.~J. Pelletier.
2.105 -\newblock Seventy-five problems for testing automatic theorem provers.
2.106 -\newblock {\em J. Auto. Reas.}, 2:191--216, 1986.
2.107 -\newblock Errata, JAR 4 (1988), 235--236 and JAR 18 (1997), 135.
2.108 -
2.109 -\bibitem{plaisted90}
2.110 -David~A. Plaisted.
2.111 -\newblock A sequent-style model elimination strategy and a positive refinement.
2.112 -\newblock {\em J. Auto. Reas.}, 6(4):389--402, 1990.
2.113 -
2.114 -\bibitem{slind-tfl}
2.115 -Konrad Slind.
2.116 -\newblock Function definition in higher order logic.
2.117 -\newblock In J.~von Wright, J.~Grundy, and J.~Harrison, editors, {\em Theorem
2.118 - Proving in Higher Order Logics}, volume 1125 of {\em Lect.\ Notes in Comp.\
2.119 - Sci.}, pages 381--397. Springer-Verlag, 1996.
2.120 -
2.121 -\bibitem{winskel93}
2.122 -Glynn Winskel.
2.123 -\newblock {\em The Formal Semantics of Programming Languages}.
2.124 -\newblock MIT Press, 1993.
2.125 -
2.126 -\end{thebibliography}
3.1 --- a/doc-src/HOL/logics-HOL.ind Wed May 05 18:07:38 1999 +0200
3.2 +++ /dev/null Thu Jan 01 00:00:00 1970 +0000
3.3 @@ -1,439 +0,0 @@
3.4 -\begin{theindex}
3.5 -
3.6 - \item {\tt !} symbol, 4, 6, 13, 14, 26
3.7 - \item {\tt[]} symbol, 26
3.8 - \item {\tt\#} symbol, 26
3.9 - \item {\tt\&} symbol, 4
3.10 - \item {\tt *} symbol, 5, 23
3.11 - \item {\tt *} type, 21
3.12 - \item {\tt +} symbol, 5, 23
3.13 - \item {\tt +} type, 21
3.14 - \item {\tt -} symbol, 5, 23
3.15 - \item {\tt -->} symbol, 4
3.16 - \item {\tt :} symbol, 12
3.17 - \item {\tt <} constant, 24
3.18 - \item {\tt <} symbol, 23
3.19 - \item {\tt <=} constant, 24
3.20 - \item {\tt <=} symbol, 12
3.21 - \item {\tt =} symbol, 4
3.22 - \item {\tt ?} symbol, 4, 6, 13, 14
3.23 - \item {\tt ?!} symbol, 4
3.24 - \item {\tt\at} symbol, 4, 26
3.25 - \item {\tt ``} symbol, 12
3.26 - \item \verb'{}' symbol, 12
3.27 - \item {\tt |} symbol, 4
3.28 -
3.29 - \indexspace
3.30 -
3.31 - \item {\tt 0} constant, 23
3.32 -
3.33 - \indexspace
3.34 -
3.35 - \item {\tt Addsplits}, \bold{20}
3.36 - \item {\tt addsplits}, \bold{20}, 25, 37
3.37 - \item {\tt ALL} symbol, 4, 6, 13, 14
3.38 - \item {\tt All} constant, 4
3.39 - \item {\tt All_def} theorem, 8
3.40 - \item {\tt all_dupE} theorem, 10
3.41 - \item {\tt allE} theorem, 10
3.42 - \item {\tt allI} theorem, 10
3.43 - \item {\tt and_def} theorem, 8
3.44 - \item {\tt arg_cong} theorem, 9
3.45 - \item {\tt Arith} theory, 24
3.46 - \item {\tt arith_tac}, 25
3.47 -
3.48 - \indexspace
3.49 -
3.50 - \item {\tt Ball} constant, 12, 14
3.51 - \item {\tt Ball_def} theorem, 15
3.52 - \item {\tt ballE} theorem, 16
3.53 - \item {\tt ballI} theorem, 16
3.54 - \item {\tt Bex} constant, 12, 14
3.55 - \item {\tt Bex_def} theorem, 15
3.56 - \item {\tt bexCI} theorem, 14, 16
3.57 - \item {\tt bexE} theorem, 16
3.58 - \item {\tt bexI} theorem, 14, 16
3.59 - \item {\textit {bool}} type, 5
3.60 - \item {\tt box_equals} theorem, 9, 11
3.61 - \item {\tt bspec} theorem, 16
3.62 - \item {\tt butlast} constant, 26
3.63 -
3.64 - \indexspace
3.65 -
3.66 - \item {\tt case} symbol, 7, 24, 25, 37
3.67 - \item {\tt case_tac}, \bold{11}
3.68 - \item {\tt ccontr} theorem, 10
3.69 - \item {\tt classical} theorem, 10
3.70 - \item {\tt coinductive}, 49--51
3.71 - \item {\tt Collect} constant, 12, 14
3.72 - \item {\tt Collect_mem_eq} theorem, 14, 15
3.73 - \item {\tt CollectD} theorem, 16, 54
3.74 - \item {\tt CollectE} theorem, 16
3.75 - \item {\tt CollectI} theorem, 16, 55
3.76 - \item {\tt Compl} constant, 12
3.77 - \item {\tt Compl_def} theorem, 15
3.78 - \item {\tt Compl_disjoint} theorem, 18
3.79 - \item {\tt Compl_Int} theorem, 18
3.80 - \item {\tt Compl_partition} theorem, 18
3.81 - \item {\tt Compl_Un} theorem, 18
3.82 - \item {\tt ComplD} theorem, 17
3.83 - \item {\tt ComplI} theorem, 17
3.84 - \item {\tt concat} constant, 26
3.85 - \item {\tt cong} theorem, 9
3.86 - \item {\tt conj_cong}, 19
3.87 - \item {\tt conjE} theorem, 9
3.88 - \item {\tt conjI} theorem, 9
3.89 - \item {\tt conjunct1} theorem, 9
3.90 - \item {\tt conjunct2} theorem, 9
3.91 - \item {\tt context}, 55
3.92 -
3.93 - \indexspace
3.94 -
3.95 - \item {\tt datatype}, 34--42
3.96 - \item {\tt Delsplits}, \bold{20}
3.97 - \item {\tt delsplits}, \bold{20}
3.98 - \item {\tt disjCI} theorem, 10
3.99 - \item {\tt disjE} theorem, 9
3.100 - \item {\tt disjI1} theorem, 9
3.101 - \item {\tt disjI2} theorem, 9
3.102 - \item {\tt div} symbol, 23
3.103 - \item {\tt div_geq} theorem, 24
3.104 - \item {\tt div_less} theorem, 24
3.105 - \item {\tt Divides} theory, 24
3.106 - \item {\tt double_complement} theorem, 18
3.107 - \item {\tt drop} constant, 26
3.108 - \item {\tt dropWhile} constant, 26
3.109 -
3.110 - \indexspace
3.111 -
3.112 - \item {\tt empty_def} theorem, 15
3.113 - \item {\tt emptyE} theorem, 17
3.114 - \item {\tt Eps} constant, 4, 6
3.115 - \item {\tt equalityCE} theorem, 14, 16, 54, 55
3.116 - \item {\tt equalityD1} theorem, 16
3.117 - \item {\tt equalityD2} theorem, 16
3.118 - \item {\tt equalityE} theorem, 16
3.119 - \item {\tt equalityI} theorem, 16
3.120 - \item {\tt EX} symbol, 4, 6, 13, 14
3.121 - \item {\tt Ex} constant, 4
3.122 - \item {\tt EX!} symbol, 4
3.123 - \item {\tt Ex1} constant, 4
3.124 - \item {\tt Ex1_def} theorem, 8
3.125 - \item {\tt ex1E} theorem, 10
3.126 - \item {\tt ex1I} theorem, 10
3.127 - \item {\tt Ex_def} theorem, 8
3.128 - \item {\tt exCI} theorem, 10
3.129 - \item {\tt excluded_middle} theorem, 10
3.130 - \item {\tt exE} theorem, 10
3.131 - \item {\tt exhaust_tac}, \bold{38}
3.132 - \item {\tt exI} theorem, 10
3.133 - \item {\tt Exp} theory, 53
3.134 - \item {\tt ext} theorem, 7, 8
3.135 -
3.136 - \indexspace
3.137 -
3.138 - \item {\tt False} constant, 4
3.139 - \item {\tt False_def} theorem, 8
3.140 - \item {\tt FalseE} theorem, 9
3.141 - \item {\tt filter} constant, 26
3.142 - \item {\tt foldl} constant, 26
3.143 - \item {\tt fst} constant, 21
3.144 - \item {\tt fst_conv} theorem, 21
3.145 - \item {\tt Fun} theory, 19
3.146 - \item {\textit {fun}} type, 5
3.147 - \item {\tt fun_cong} theorem, 9
3.148 -
3.149 - \indexspace
3.150 -
3.151 - \item {\tt hd} constant, 26
3.152 - \item higher-order logic, 3--55
3.153 - \item {\tt HOL} theory, 3
3.154 - \item {\sc hol} system, 3, 6
3.155 - \item {\tt HOL_basic_ss}, \bold{19}
3.156 - \item {\tt HOL_cs}, \bold{20}
3.157 - \item {\tt HOL_quantifiers}, \bold{6}, 14
3.158 - \item {\tt HOL_ss}, \bold{19}
3.159 - \item {\tt hyp_subst_tac}, 19
3.160 -
3.161 - \indexspace
3.162 -
3.163 - \item {\tt If} constant, 4
3.164 - \item {\tt if_def} theorem, 8
3.165 - \item {\tt if_not_P} theorem, 10
3.166 - \item {\tt if_P} theorem, 10
3.167 - \item {\tt iff} theorem, 7, 8
3.168 - \item {\tt iffCE} theorem, 10, 14
3.169 - \item {\tt iffD1} theorem, 9
3.170 - \item {\tt iffD2} theorem, 9
3.171 - \item {\tt iffE} theorem, 9
3.172 - \item {\tt iffI} theorem, 9
3.173 - \item {\tt image_def} theorem, 15
3.174 - \item {\tt imageE} theorem, 17
3.175 - \item {\tt imageI} theorem, 17
3.176 - \item {\tt impCE} theorem, 10
3.177 - \item {\tt impE} theorem, 9
3.178 - \item {\tt impI} theorem, 7
3.179 - \item {\tt in} symbol, 5
3.180 - \item {\textit {ind}} type, 22
3.181 - \item {\tt induct_tac}, 24, \bold{38}
3.182 - \item {\tt inductive}, 49--51
3.183 - \item {\tt inj} constant, 19
3.184 - \item {\tt inj_def} theorem, 19
3.185 - \item {\tt inj_Inl} theorem, 23
3.186 - \item {\tt inj_Inr} theorem, 23
3.187 - \item {\tt inj_on} constant, 19
3.188 - \item {\tt inj_on_def} theorem, 19
3.189 - \item {\tt inj_Suc} theorem, 23
3.190 - \item {\tt Inl} constant, 23
3.191 - \item {\tt Inl_not_Inr} theorem, 23
3.192 - \item {\tt Inr} constant, 23
3.193 - \item {\tt insert} constant, 12
3.194 - \item {\tt insert_def} theorem, 15
3.195 - \item {\tt insertE} theorem, 17
3.196 - \item {\tt insertI1} theorem, 17
3.197 - \item {\tt insertI2} theorem, 17
3.198 - \item {\tt INT} symbol, 12--14
3.199 - \item {\tt Int} symbol, 12
3.200 - \item {\tt Int_absorb} theorem, 18
3.201 - \item {\tt Int_assoc} theorem, 18
3.202 - \item {\tt Int_commute} theorem, 18
3.203 - \item {\tt INT_D} theorem, 17
3.204 - \item {\tt Int_def} theorem, 15
3.205 - \item {\tt INT_E} theorem, 17
3.206 - \item {\tt Int_greatest} theorem, 18
3.207 - \item {\tt INT_I} theorem, 17
3.208 - \item {\tt Int_Inter_image} theorem, 18
3.209 - \item {\tt Int_lower1} theorem, 18
3.210 - \item {\tt Int_lower2} theorem, 18
3.211 - \item {\tt Int_Un_distrib} theorem, 18
3.212 - \item {\tt Int_Union} theorem, 18
3.213 - \item {\tt IntD1} theorem, 17
3.214 - \item {\tt IntD2} theorem, 17
3.215 - \item {\tt IntE} theorem, 17
3.216 - \item {\tt INTER} constant, 12
3.217 - \item {\tt Inter} constant, 12
3.218 - \item {\tt INTER1} constant, 12
3.219 - \item {\tt INTER1_def} theorem, 15
3.220 - \item {\tt INTER_def} theorem, 15
3.221 - \item {\tt Inter_def} theorem, 15
3.222 - \item {\tt Inter_greatest} theorem, 18
3.223 - \item {\tt Inter_lower} theorem, 18
3.224 - \item {\tt Inter_Un_distrib} theorem, 18
3.225 - \item {\tt InterD} theorem, 17
3.226 - \item {\tt InterE} theorem, 17
3.227 - \item {\tt InterI} theorem, 17
3.228 - \item {\tt IntI} theorem, 17
3.229 - \item {\tt inv} constant, 19
3.230 - \item {\tt inv_def} theorem, 19
3.231 -
3.232 - \indexspace
3.233 -
3.234 - \item {\tt last} constant, 26
3.235 - \item {\tt LEAST} constant, 5, 6, 24
3.236 - \item {\tt Least} constant, 4
3.237 - \item {\tt Least_def} theorem, 8
3.238 - \item {\tt length} constant, 26
3.239 - \item {\tt less_induct} theorem, 25
3.240 - \item {\tt Let} constant, 4, 7
3.241 - \item {\tt let} symbol, 5, 7
3.242 - \item {\tt Let_def} theorem, 7, 8
3.243 - \item {\tt LFilter} theory, 53
3.244 - \item {\tt List} theory, 25, 26
3.245 - \item {\textit{list}} type, 25
3.246 - \item {\tt LList} theory, 52
3.247 -
3.248 - \indexspace
3.249 -
3.250 - \item {\tt map} constant, 26
3.251 - \item {\tt max} constant, 5, 24
3.252 - \item {\tt mem} symbol, 26
3.253 - \item {\tt mem_Collect_eq} theorem, 14, 15
3.254 - \item {\tt min} constant, 5, 24
3.255 - \item {\tt minus} class, 5
3.256 - \item {\tt mod} symbol, 23
3.257 - \item {\tt mod_geq} theorem, 24
3.258 - \item {\tt mod_less} theorem, 24
3.259 - \item {\tt mono} constant, 5
3.260 - \item {\tt mp} theorem, 7
3.261 - \item {\tt mutual_induct_tac}, \bold{38}
3.262 -
3.263 - \indexspace
3.264 -
3.265 - \item {\tt n_not_Suc_n} theorem, 23
3.266 - \item {\tt Nat} theory, 24
3.267 - \item {\textit {nat}} type, 23, 24
3.268 - \item {\textit{nat}} type, 22--25
3.269 - \item {\tt nat_induct} theorem, 23
3.270 - \item {\tt nat_rec} constant, 24
3.271 - \item {\tt NatDef} theory, 22
3.272 - \item {\tt Not} constant, 4
3.273 - \item {\tt not_def} theorem, 8
3.274 - \item {\tt not_sym} theorem, 9
3.275 - \item {\tt notE} theorem, 9
3.276 - \item {\tt notI} theorem, 9
3.277 - \item {\tt notnotD} theorem, 10
3.278 - \item {\tt null} constant, 26
3.279 -
3.280 - \indexspace
3.281 -
3.282 - \item {\tt o} symbol, 4, 15
3.283 - \item {\tt o_def} theorem, 8
3.284 - \item {\tt of} symbol, 7
3.285 - \item {\tt or_def} theorem, 8
3.286 - \item {\tt Ord} theory, 5
3.287 - \item {\tt ord} class, 5, 6, 24
3.288 - \item {\tt order} class, 5, 24
3.289 -
3.290 - \indexspace
3.291 -
3.292 - \item {\tt Pair} constant, 21
3.293 - \item {\tt Pair_eq} theorem, 21
3.294 - \item {\tt Pair_inject} theorem, 21
3.295 - \item {\tt PairE} theorem, 21
3.296 - \item {\tt plus} class, 5
3.297 - \item {\tt Pow} constant, 12
3.298 - \item {\tt Pow_def} theorem, 15
3.299 - \item {\tt PowD} theorem, 17
3.300 - \item {\tt PowI} theorem, 17
3.301 - \item {\tt primrec}, 43--46
3.302 - \item {\tt primrec} symbol, 24
3.303 - \item priorities, 1
3.304 - \item {\tt Prod} theory, 21
3.305 - \item {\tt prop_cs}, \bold{20}
3.306 -
3.307 - \indexspace
3.308 -
3.309 - \item {\tt qed_spec_mp}, 41
3.310 -
3.311 - \indexspace
3.312 -
3.313 - \item {\tt range} constant, 12, 54
3.314 - \item {\tt range_def} theorem, 15
3.315 - \item {\tt rangeE} theorem, 17, 54
3.316 - \item {\tt rangeI} theorem, 17
3.317 - \item {\tt recdef}, 46--49
3.318 - \item {\tt record}, 31
3.319 - \item {\tt record_split_tac}, 33, 34
3.320 - \item recursion
3.321 - \subitem general, 46--49
3.322 - \subitem primitive, 43--46
3.323 - \item recursive functions, \see{recursion}{42}
3.324 - \item {\tt refl} theorem, 7
3.325 - \item {\tt res_inst_tac}, 6
3.326 - \item {\tt rev} constant, 26
3.327 -
3.328 - \indexspace
3.329 -
3.330 - \item search
3.331 - \subitem best-first, 55
3.332 - \item {\tt select_equality} theorem, 8, 10
3.333 - \item {\tt selectI} theorem, 7, 8
3.334 - \item {\tt Set} theory, 11, 14
3.335 - \item {\tt set} constant, 26
3.336 - \item {\tt set} type, 11
3.337 - \item {\tt set_diff_def} theorem, 15
3.338 - \item {\tt show_sorts}, 6
3.339 - \item {\tt show_types}, 6
3.340 - \item {\tt Sigma} constant, 21
3.341 - \item {\tt Sigma_def} theorem, 21
3.342 - \item {\tt SigmaE} theorem, 21
3.343 - \item {\tt SigmaI} theorem, 21
3.344 - \item simplification
3.345 - \subitem of conjunctions, 19
3.346 - \item {\tt size} constant, 38
3.347 - \item {\tt snd} constant, 21
3.348 - \item {\tt snd_conv} theorem, 21
3.349 - \item {\tt spec} theorem, 10
3.350 - \item {\tt split} constant, 21
3.351 - \item {\tt split} theorem, 21
3.352 - \item {\tt split_all_tac}, \bold{22}
3.353 - \item {\tt split_if} theorem, 10, 20
3.354 - \item {\tt split_list_case} theorem, 25
3.355 - \item {\tt split_split} theorem, 21
3.356 - \item {\tt split_sum_case} theorem, 23
3.357 - \item {\tt ssubst} theorem, 9, 11
3.358 - \item {\tt stac}, \bold{19}
3.359 - \item {\tt strip_tac}, \bold{11}
3.360 - \item {\tt subset_def} theorem, 15
3.361 - \item {\tt subset_refl} theorem, 16
3.362 - \item {\tt subset_trans} theorem, 16
3.363 - \item {\tt subsetCE} theorem, 14, 16
3.364 - \item {\tt subsetD} theorem, 14, 16
3.365 - \item {\tt subsetI} theorem, 16
3.366 - \item {\tt subst} theorem, 7
3.367 - \item {\tt Suc} constant, 23
3.368 - \item {\tt Suc_not_Zero} theorem, 23
3.369 - \item {\tt Sum} theory, 22
3.370 - \item {\tt sum_case} constant, 23
3.371 - \item {\tt sum_case_Inl} theorem, 23
3.372 - \item {\tt sum_case_Inr} theorem, 23
3.373 - \item {\tt sumE} theorem, 23
3.374 - \item {\tt surj} constant, 15, 19
3.375 - \item {\tt surj_def} theorem, 19
3.376 - \item {\tt surjective_pairing} theorem, 21
3.377 - \item {\tt surjective_sum} theorem, 23
3.378 - \item {\tt swap} theorem, 10
3.379 - \item {\tt swap_res_tac}, 55
3.380 - \item {\tt sym} theorem, 9
3.381 -
3.382 - \indexspace
3.383 -
3.384 - \item {\tt take} constant, 26
3.385 - \item {\tt takeWhile} constant, 26
3.386 - \item {\tt term} class, 5
3.387 - \item {\tt times} class, 5
3.388 - \item {\tt tl} constant, 26
3.389 - \item tracing
3.390 - \subitem of unification, 6
3.391 - \item {\tt trans} theorem, 9
3.392 - \item {\tt True} constant, 4
3.393 - \item {\tt True_def} theorem, 8
3.394 - \item {\tt True_or_False} theorem, 7, 8
3.395 - \item {\tt TrueI} theorem, 9
3.396 - \item {\tt Trueprop} constant, 4
3.397 - \item type definition, \bold{28}
3.398 - \item {\tt typedef}, 25
3.399 -
3.400 - \indexspace
3.401 -
3.402 - \item {\tt UN} symbol, 12--14
3.403 - \item {\tt Un} symbol, 12
3.404 - \item {\tt Un1} theorem, 14
3.405 - \item {\tt Un2} theorem, 14
3.406 - \item {\tt Un_absorb} theorem, 18
3.407 - \item {\tt Un_assoc} theorem, 18
3.408 - \item {\tt Un_commute} theorem, 18
3.409 - \item {\tt Un_def} theorem, 15
3.410 - \item {\tt UN_E} theorem, 17
3.411 - \item {\tt UN_I} theorem, 17
3.412 - \item {\tt Un_Int_distrib} theorem, 18
3.413 - \item {\tt Un_Inter} theorem, 18
3.414 - \item {\tt Un_least} theorem, 18
3.415 - \item {\tt Un_Union_image} theorem, 18
3.416 - \item {\tt Un_upper1} theorem, 18
3.417 - \item {\tt Un_upper2} theorem, 18
3.418 - \item {\tt UnCI} theorem, 14, 17
3.419 - \item {\tt UnE} theorem, 17
3.420 - \item {\tt UnI1} theorem, 17
3.421 - \item {\tt UnI2} theorem, 17
3.422 - \item unification
3.423 - \subitem incompleteness of, 6
3.424 - \item {\tt Unify.trace_types}, 6
3.425 - \item {\tt UNION} constant, 12
3.426 - \item {\tt Union} constant, 12
3.427 - \item {\tt UNION1} constant, 12
3.428 - \item {\tt UNION1_def} theorem, 15
3.429 - \item {\tt UNION_def} theorem, 15
3.430 - \item {\tt Union_def} theorem, 15
3.431 - \item {\tt Union_least} theorem, 18
3.432 - \item {\tt Union_Un_distrib} theorem, 18
3.433 - \item {\tt Union_upper} theorem, 18
3.434 - \item {\tt UnionE} theorem, 17
3.435 - \item {\tt UnionI} theorem, 17
3.436 - \item {\tt unit_eq} theorem, 22
3.437 -
3.438 - \indexspace
3.439 -
3.440 - \item {\tt ZF} theory, 3
3.441 -
3.442 -\end{theindex}
4.1 --- a/doc-src/HOL/logics-HOL.rao Wed May 05 18:07:38 1999 +0200
4.2 +++ /dev/null Thu Jan 01 00:00:00 1970 +0000
4.3 @@ -1,122 +0,0 @@
4.4 -% This file was generated by 'rail' from 'logics-HOL.rai'
4.5 -\rail@i {1}{ typedef : 'typedef' ( () | '(' name ')') type '=' set witness; \par type : typevarlist name ( () | '(' infix ')' ); set : string; witness : () | '(' id ')'; }
4.6 -\rail@o {1}{
4.7 -\rail@begin{2}{typedef}
4.8 -\rail@term{typedef}[]
4.9 -\rail@bar
4.10 -\rail@nextbar{1}
4.11 -\rail@term{(}[]
4.12 -\rail@nont{name}[]
4.13 -\rail@term{)}[]
4.14 -\rail@endbar
4.15 -\rail@nont{type}[]
4.16 -\rail@term{=}[]
4.17 -\rail@nont{set}[]
4.18 -\rail@nont{witness}[]
4.19 -\rail@end
4.20 -\rail@begin{2}{type}
4.21 -\rail@nont{typevarlist}[]
4.22 -\rail@nont{name}[]
4.23 -\rail@bar
4.24 -\rail@nextbar{1}
4.25 -\rail@term{(}[]
4.26 -\rail@nont{infix}[]
4.27 -\rail@term{)}[]
4.28 -\rail@endbar
4.29 -\rail@end
4.30 -\rail@begin{1}{set}
4.31 -\rail@nont{string}[]
4.32 -\rail@end
4.33 -\rail@begin{2}{witness}
4.34 -\rail@bar
4.35 -\rail@nextbar{1}
4.36 -\rail@term{(}[]
4.37 -\rail@nont{id}[]
4.38 -\rail@term{)}[]
4.39 -\rail@endbar
4.40 -\rail@end
4.41 -}
4.42 -\rail@i {2}{ record : 'record' typevarlist name '=' parent (field +); \par parent : ( () | type '+'); field : name '::' type; }
4.43 -\rail@o {2}{
4.44 -\rail@begin{2}{record}
4.45 -\rail@term{record}[]
4.46 -\rail@nont{typevarlist}[]
4.47 -\rail@nont{name}[]
4.48 -\rail@term{=}[]
4.49 -\rail@nont{parent}[]
4.50 -\rail@plus
4.51 -\rail@nont{field}[]
4.52 -\rail@nextplus{1}
4.53 -\rail@endplus
4.54 -\rail@end
4.55 -\rail@begin{2}{parent}
4.56 -\rail@bar
4.57 -\rail@nextbar{1}
4.58 -\rail@nont{type}[]
4.59 -\rail@term{+}[]
4.60 -\rail@endbar
4.61 -\rail@end
4.62 -\rail@begin{1}{field}
4.63 -\rail@nont{name}[]
4.64 -\rail@term{::}[]
4.65 -\rail@nont{type}[]
4.66 -\rail@end
4.67 -}
4.68 -\rail@i {3}{ datatype : 'datatype' typedecls; \par typedecls: ( newtype '=' (cons + '|') ) + 'and' ; newtype : typevarlist id ( () | '(' infix ')' ) ; cons : name (argtype *) ( () | ( '(' mixfix ')' ) ) ; argtype : id | tid | ('(' typevarlist id ')') ; }
4.69 -\rail@o {3}{
4.70 -\rail@begin{1}{datatype}
4.71 -\rail@term{datatype}[]
4.72 -\rail@nont{typedecls}[]
4.73 -\rail@end
4.74 -\rail@begin{3}{typedecls}
4.75 -\rail@plus
4.76 -\rail@nont{newtype}[]
4.77 -\rail@term{=}[]
4.78 -\rail@plus
4.79 -\rail@nont{cons}[]
4.80 -\rail@nextplus{1}
4.81 -\rail@cterm{|}[]
4.82 -\rail@endplus
4.83 -\rail@nextplus{2}
4.84 -\rail@cterm{and}[]
4.85 -\rail@endplus
4.86 -\rail@end
4.87 -\rail@begin{2}{newtype}
4.88 -\rail@nont{typevarlist}[]
4.89 -\rail@nont{id}[]
4.90 -\rail@bar
4.91 -\rail@nextbar{1}
4.92 -\rail@term{(}[]
4.93 -\rail@nont{infix}[]
4.94 -\rail@term{)}[]
4.95 -\rail@endbar
4.96 -\rail@end
4.97 -\rail@begin{3}{cons}
4.98 -\rail@nont{name}[]
4.99 -\rail@bar
4.100 -\rail@nextbar{1}
4.101 -\rail@plus
4.102 -\rail@nont{argtype}[]
4.103 -\rail@nextplus{2}
4.104 -\rail@endplus
4.105 -\rail@endbar
4.106 -\rail@bar
4.107 -\rail@nextbar{1}
4.108 -\rail@term{(}[]
4.109 -\rail@nont{mixfix}[]
4.110 -\rail@term{)}[]
4.111 -\rail@endbar
4.112 -\rail@end
4.113 -\rail@begin{3}{argtype}
4.114 -\rail@bar
4.115 -\rail@nont{id}[]
4.116 -\rail@nextbar{1}
4.117 -\rail@nont{tid}[]
4.118 -\rail@nextbar{2}
4.119 -\rail@term{(}[]
4.120 -\rail@nont{typevarlist}[]
4.121 -\rail@nont{id}[]
4.122 -\rail@term{)}[]
4.123 -\rail@endbar
4.124 -\rail@end
4.125 -}