1.1 --- a/doc-src/Logics/Makefile Wed May 05 18:16:03 1999 +0200
1.2 +++ b/doc-src/Logics/Makefile Wed May 05 18:19:03 1999 +0200
1.3 @@ -1,34 +1,28 @@
1.4 -# $Id$
1.5 -#########################################################################
1.6 -# #
1.7 -# Makefile for the report "Isabelle's Object-Logics" #
1.8 -# #
1.9 -#########################################################################
1.10 +#
1.11 +# $Id$
1.12 +#
1.13
1.14 +## targets
1.15
1.16 -FILES = logics.tex preface.tex syntax.tex LK.tex CTT.tex\
1.17 - ../rail.sty ../proof.sty ../iman.sty ../extra.sty
1.18 +default: dvi
1.19 +dist: dvi
1.20
1.21 -logics.dvi.gz: $(FILES)
1.22 - test -r isabelle.eps || ln -s ../gfx/isabelle.eps .
1.23 - -rm logics.dvi*
1.24 - latex logics
1.25 - rail logics
1.26 - bibtex logics
1.27 - latex logics
1.28 - latex logics
1.29 - ../sedindex logics
1.30 - latex logics
1.31 - gzip -f logics.dvi
1.32
1.33 -dist: $(FILES)
1.34 - test -r isabelle.eps || ln -s ../gfx/isabelle.eps .
1.35 - -rm logics.dvi*
1.36 - latex logics
1.37 - latex logics
1.38 - ../sedindex logics
1.39 - latex logics
1.40 +## dependencies
1.41
1.42 -clean:
1.43 - @rm *.aux *.log *.toc *.idx *.rai
1.44 +include ../Makefile.in
1.45
1.46 +NAME = logics
1.47 +FILES = logics.tex preface.tex syntax.tex LK.tex CTT.tex \
1.48 + ../proof.sty ../iman.sty ../extra.sty
1.49 +
1.50 +dvi: $(NAME).dvi
1.51 +
1.52 +$(NAME).dvi: $(FILES) isabelle_hol.eps
1.53 + touch $(NAME).ind
1.54 + $(LATEX) $(NAME)
1.55 + $(BIBTEX) $(NAME)
1.56 + $(LATEX) $(NAME)
1.57 + $(LATEX) $(NAME)
1.58 + $(SEDINDEX) $(NAME)
1.59 + $(LATEX) $(NAME)
2.1 --- a/doc-src/Logics/logics.bbl Wed May 05 18:16:03 1999 +0200
2.2 +++ /dev/null Thu Jan 01 00:00:00 1970 +0000
2.3 @@ -1,77 +0,0 @@
2.4 -\begin{thebibliography}{10}
2.5 -
2.6 -\bibitem{coen92}
2.7 -Martin~D. Coen.
2.8 -\newblock {\em Interactive Program Derivation}.
2.9 -\newblock PhD thesis, University of Cambridge, November 1992.
2.10 -\newblock Computer Laboratory Technical Report 272.
2.11 -
2.12 -\bibitem{constable86}
2.13 -R.~L. Constable et~al.
2.14 -\newblock {\em Implementing Mathematics with the Nuprl Proof Development
2.15 - System}.
2.16 -\newblock Prentice-Hall, 1986.
2.17 -
2.18 -\bibitem{felty91a}
2.19 -Amy Felty.
2.20 -\newblock A logic program for transforming sequent proofs to natural deduction
2.21 - proofs.
2.22 -\newblock In Peter Schroeder-Heister, editor, {\em Extensions of Logic
2.23 - Programming}, LNAI 475, pages 157--178. Springer, 1991.
2.24 -
2.25 -\bibitem{gallier86}
2.26 -J.~H. Gallier.
2.27 -\newblock {\em Logic for Computer Science: Foundations of Automatic Theorem
2.28 - Proving}.
2.29 -\newblock Harper \& Row, 1986.
2.30 -
2.31 -\bibitem{huet78}
2.32 -G.~P. Huet and B.~Lang.
2.33 -\newblock Proving and applying program transformations expressed with
2.34 - second-order patterns.
2.35 -\newblock {\em Acta Informatica}, 11:31--55, 1978.
2.36 -
2.37 -\bibitem{alf}
2.38 -Lena Magnusson and Bengt {Nordstr\"{o}m}.
2.39 -\newblock The {ALF} proof editor and its proof engine.
2.40 -\newblock In Henk Barendregt and Tobias Nipkow, editors, {\em Types for Proofs
2.41 - and Programs: International Workshop {TYPES '93}}, LNCS 806, pages 213--237.
2.42 - Springer, published 1994.
2.43 -
2.44 -\bibitem{martinlof84}
2.45 -Per Martin-L\"of.
2.46 -\newblock {\em Intuitionistic type theory}.
2.47 -\newblock Bibliopolis, 1984.
2.48 -
2.49 -\bibitem{nordstrom90}
2.50 -Bengt {Nordstr\"om}, Kent Petersson, and Jan Smith.
2.51 -\newblock {\em Programming in {Martin-L\"of}'s Type Theory. An Introduction}.
2.52 -\newblock Oxford University Press, 1990.
2.53 -
2.54 -\bibitem{paulson87}
2.55 -Lawrence~C. Paulson.
2.56 -\newblock {\em Logic and Computation: Interactive proof with Cambridge LCF}.
2.57 -\newblock Cambridge University Press, 1987.
2.58 -
2.59 -\bibitem{isabelle-ZF}
2.60 -Lawrence~C. Paulson.
2.61 -\newblock {Isabelle}'s logics: {FOL} and {ZF}.
2.62 -\newblock Technical report, Computer Laboratory, University of Cambridge, 1999.
2.63 -
2.64 -\bibitem{pelletier86}
2.65 -F.~J. Pelletier.
2.66 -\newblock Seventy-five problems for testing automatic theorem provers.
2.67 -\newblock {\em Journal of Automated Reasoning}, 2:191--216, 1986.
2.68 -\newblock Errata, JAR 4 (1988), 235--236 and JAR 18 (1997), 135.
2.69 -
2.70 -\bibitem{takeuti87}
2.71 -G.~Takeuti.
2.72 -\newblock {\em Proof Theory}.
2.73 -\newblock North-Holland, 2nd edition, 1987.
2.74 -
2.75 -\bibitem{thompson91}
2.76 -Simon Thompson.
2.77 -\newblock {\em Type Theory and Functional Programming}.
2.78 -\newblock Addison-Wesley, 1991.
2.79 -
2.80 -\end{thebibliography}
3.1 --- a/doc-src/Logics/logics.ind Wed May 05 18:16:03 1999 +0200
3.2 +++ /dev/null Thu Jan 01 00:00:00 1970 +0000
3.3 @@ -1,307 +0,0 @@
3.4 -\begin{theindex}
3.5 -
3.6 - \item {\tt\#*} symbol, 30
3.7 - \item {\tt\#+} symbol, 30
3.8 - \item {\tt\&} symbol, 6
3.9 - \item {\tt *} symbol, 21
3.10 - \item {\tt +} symbol, 21
3.11 - \item {\tt -} symbol, 30
3.12 - \item {\tt -->} symbol, 6, 21
3.13 - \item {\tt <->} symbol, 6
3.14 - \item {\tt =} symbol, 6, 21
3.15 - \item {\tt `} symbol, 21
3.16 - \item {\tt |} symbol, 6
3.17 - \item {\tt |-|} symbol, 30
3.18 -
3.19 - \indexspace
3.20 -
3.21 - \item {\tt 0} constant, 19
3.22 -
3.23 - \indexspace
3.24 -
3.25 - \item {\tt absdiff_def} theorem, 30
3.26 - \item {\tt add_assoc} theorem, 30
3.27 - \item {\tt add_commute} theorem, 30
3.28 - \item {\tt add_def} theorem, 30
3.29 - \item {\tt add_inverse_diff} theorem, 30
3.30 - \item {\tt add_mp_tac}, \bold{28}
3.31 - \item {\tt add_mult_dist} theorem, 30
3.32 - \item {\tt add_safes}, \bold{12}
3.33 - \item {\tt add_typing} theorem, 30
3.34 - \item {\tt add_unsafes}, \bold{12}
3.35 - \item {\tt addC0} theorem, 30
3.36 - \item {\tt addC_succ} theorem, 30
3.37 - \item {\tt ALL} symbol, 6
3.38 - \item {\tt All} constant, 6
3.39 - \item {\tt allL} theorem, 8, 12
3.40 - \item {\tt allL_thin} theorem, 9
3.41 - \item {\tt allR} theorem, 8
3.42 - \item {\tt Arith} theory, 29
3.43 - \item assumptions
3.44 - \subitem in {\CTT}, 18, 28
3.45 -
3.46 - \indexspace
3.47 -
3.48 - \item {\tt basic} theorem, 8
3.49 - \item {\tt basic_defs}, \bold{26}
3.50 - \item {\tt best_tac}, \bold{13}
3.51 -
3.52 - \indexspace
3.53 -
3.54 - \item {\tt CCL} theory, 1
3.55 - \item {\tt comp_rls}, \bold{26}
3.56 - \item {\tt conjL} theorem, 8
3.57 - \item {\tt conjR} theorem, 8
3.58 - \item {\tt conL} theorem, 9
3.59 - \item {\tt conR} theorem, 9
3.60 - \item Constructive Type Theory, 18--40
3.61 - \item {\tt contr} constant, 19
3.62 - \item {\tt could_res}, \bold{11}
3.63 - \item {\tt could_resolve_seq}, \bold{11}
3.64 - \item {\tt CTT} theory, 1, 18
3.65 - \item {\tt Cube} theory, 1
3.66 - \item {\tt cut} theorem, 8
3.67 - \item {\tt cutL_tac}, \bold{10}
3.68 - \item {\tt cutR_tac}, \bold{10}
3.69 -
3.70 - \indexspace
3.71 -
3.72 - \item {\tt diff_0_eq_0} theorem, 30
3.73 - \item {\tt diff_def} theorem, 30
3.74 - \item {\tt diff_self_eq_0} theorem, 30
3.75 - \item {\tt diff_succ_succ} theorem, 30
3.76 - \item {\tt diff_typing} theorem, 30
3.77 - \item {\tt diffC0} theorem, 30
3.78 - \item {\tt disjL} theorem, 8
3.79 - \item {\tt disjR} theorem, 8
3.80 - \item {\tt div} symbol, 30
3.81 - \item {\tt div_def} theorem, 30
3.82 -
3.83 - \indexspace
3.84 -
3.85 - \item {\tt Elem} constant, 19
3.86 - \item {\tt elim_rls}, \bold{26}
3.87 - \item {\tt elimL_rls}, \bold{26}
3.88 - \item {\tt empty_pack}, \bold{12}
3.89 - \item {\tt Eq} constant, 19
3.90 - \item {\tt eq} constant, 19, 24
3.91 - \item {\tt EqC} theorem, 25
3.92 - \item {\tt EqE} theorem, 25
3.93 - \item {\tt Eqelem} constant, 19
3.94 - \item {\tt EqF} theorem, 25
3.95 - \item {\tt EqFL} theorem, 25
3.96 - \item {\tt EqI} theorem, 25
3.97 - \item {\tt Eqtype} constant, 19
3.98 - \item {\tt equal_tac}, \bold{27}
3.99 - \item {\tt equal_types} theorem, 22
3.100 - \item {\tt equal_typesL} theorem, 22
3.101 - \item {\tt EX} symbol, 6
3.102 - \item {\tt Ex} constant, 6
3.103 - \item {\tt exL} theorem, 8
3.104 - \item {\tt exR} theorem, 8, 12, 14
3.105 - \item {\tt exR_thin} theorem, 9, 14, 15
3.106 -
3.107 - \indexspace
3.108 -
3.109 - \item {\tt F} constant, 19
3.110 - \item {\tt False} constant, 6
3.111 - \item {\tt FalseL} theorem, 8
3.112 - \item {\tt fast_tac}, \bold{13}
3.113 - \item {\tt FE} theorem, 25, 29
3.114 - \item {\tt FEL} theorem, 25
3.115 - \item {\tt FF} theorem, 25
3.116 - \item {\tt filseq_resolve_tac}, \bold{11}
3.117 - \item {\tt filt_resolve_tac}, 11, 27
3.118 - \item flex-flex constraints, 7
3.119 - \item {\tt FOL} theory, 28
3.120 - \item {\tt form_rls}, \bold{26}
3.121 - \item {\tt formL_rls}, \bold{26}
3.122 - \item {\tt forms_of_seq}, \bold{10}
3.123 - \item {\tt fst} constant, 19, 24
3.124 - \item {\tt fst_def} theorem, 24
3.125 - \item function applications
3.126 - \subitem in \CTT, 21
3.127 -
3.128 - \indexspace
3.129 -
3.130 - \item {\tt HOL} theory, 1
3.131 - \item {\tt HOLCF} theory, 1
3.132 - \item {\tt hyp_rew_tac}, \bold{28}
3.133 -
3.134 - \indexspace
3.135 -
3.136 - \item {\textit {i}} type, 18
3.137 - \item {\tt iff_def} theorem, 8
3.138 - \item {\tt iffL} theorem, 9, 16
3.139 - \item {\tt iffR} theorem, 9
3.140 - \item {\tt ILL} theory, 1
3.141 - \item {\tt impL} theorem, 8
3.142 - \item {\tt impR} theorem, 8
3.143 - \item {\tt inl} constant, 19, 24, 34
3.144 - \item {\tt inr} constant, 19, 24
3.145 - \item {\tt intr_rls}, \bold{26}
3.146 - \item {\tt intr_tac}, \bold{27}, 36, 37
3.147 - \item {\tt intrL_rls}, \bold{26}
3.148 -
3.149 - \indexspace
3.150 -
3.151 - \item {\tt lam} symbol, 21
3.152 - \item {\tt lambda} constant, 19, 21
3.153 - \item $\lambda$-abstractions
3.154 - \subitem in \CTT, 21
3.155 - \item {\tt LCF} theory, 1
3.156 - \item {\tt LK} theory, 1, 5, 9
3.157 - \item {\tt LK_dup_pack}, \bold{12}, 13
3.158 - \item {\tt LK_pack}, \bold{12}
3.159 -
3.160 - \indexspace
3.161 -
3.162 - \item {\tt mod} symbol, 30
3.163 - \item {\tt mod_def} theorem, 30
3.164 - \item {\tt Modal} theory, 1
3.165 - \item {\tt mp_tac}, \bold{28}
3.166 - \item {\tt mult_assoc} theorem, 30
3.167 - \item {\tt mult_commute} theorem, 30
3.168 - \item {\tt mult_def} theorem, 30
3.169 - \item {\tt mult_typing} theorem, 30
3.170 - \item {\tt multC0} theorem, 30
3.171 - \item {\tt multC_succ} theorem, 30
3.172 -
3.173 - \indexspace
3.174 -
3.175 - \item {\tt N} constant, 19
3.176 - \item {\tt NC0} theorem, 23
3.177 - \item {\tt NC_succ} theorem, 23
3.178 - \item {\tt NE} theorem, 22, 23, 31
3.179 - \item {\tt NEL} theorem, 23
3.180 - \item {\tt NF} theorem, 23, 32
3.181 - \item {\tt NI0} theorem, 23
3.182 - \item {\tt NI_succ} theorem, 23
3.183 - \item {\tt NI_succL} theorem, 23
3.184 - \item {\tt NIO} theorem, 31
3.185 - \item {\tt Not} constant, 6
3.186 - \item {\tt notL} theorem, 8
3.187 - \item {\tt notR} theorem, 8
3.188 -
3.189 - \indexspace
3.190 -
3.191 - \item {\textit {o}} type, 5
3.192 -
3.193 - \indexspace
3.194 -
3.195 - \item {\tt pack} ML type, 11
3.196 - \item {\tt pair} constant, 19
3.197 - \item {\tt pc_tac}, \bold{13}, \bold{29}, 35, 36
3.198 - \item {\tt PlusC_inl} theorem, 25
3.199 - \item {\tt PlusC_inr} theorem, 25
3.200 - \item {\tt PlusE} theorem, 25, 29, 33
3.201 - \item {\tt PlusEL} theorem, 25
3.202 - \item {\tt PlusF} theorem, 25
3.203 - \item {\tt PlusFL} theorem, 25
3.204 - \item {\tt PlusI_inl} theorem, 25, 34
3.205 - \item {\tt PlusI_inlL} theorem, 25
3.206 - \item {\tt PlusI_inr} theorem, 25
3.207 - \item {\tt PlusI_inrL} theorem, 25
3.208 - \item priorities, 3
3.209 - \item {\tt PROD} symbol, 20, 21
3.210 - \item {\tt Prod} constant, 19
3.211 - \item {\tt ProdC} theorem, 23, 39
3.212 - \item {\tt ProdC2} theorem, 23
3.213 - \item {\tt ProdE} theorem, 23, 36, 38, 40
3.214 - \item {\tt ProdEL} theorem, 23
3.215 - \item {\tt ProdF} theorem, 23
3.216 - \item {\tt ProdFL} theorem, 23
3.217 - \item {\tt ProdI} theorem, 23, 29, 31
3.218 - \item {\tt ProdIL} theorem, 23
3.219 - \item {\tt prop_pack}, \bold{12}
3.220 -
3.221 - \indexspace
3.222 -
3.223 - \item {\tt rec} constant, 19, 22
3.224 - \item {\tt red_if_equal} theorem, 22
3.225 - \item {\tt Reduce} constant, 19, 22, 28
3.226 - \item {\tt refl} theorem, 8
3.227 - \item {\tt refl_elem} theorem, 22, 26
3.228 - \item {\tt refl_red} theorem, 22
3.229 - \item {\tt refl_type} theorem, 22, 26
3.230 - \item {\tt REPEAT_FIRST}, 27
3.231 - \item {\tt repeat_goal_tac}, \bold{13}
3.232 - \item {\tt replace_type} theorem, 26, 38
3.233 - \item {\tt reresolve_tac}, \bold{13}
3.234 - \item {\tt rew_tac}, \bold{28}
3.235 - \item {\tt RL}, 33
3.236 - \item {\tt RS}, 38, 40
3.237 -
3.238 - \indexspace
3.239 -
3.240 - \item {\tt safe_goal_tac}, \bold{13}
3.241 - \item {\tt safe_tac}, \bold{29}
3.242 - \item {\tt safestep_tac}, \bold{29}
3.243 - \item {\tt Seqof} constant, 6
3.244 - \item sequent calculus, 5--17
3.245 - \item {\tt snd} constant, 19, 24
3.246 - \item {\tt snd_def} theorem, 24
3.247 - \item {\tt sobj} type, 9
3.248 - \item {\tt split} constant, 19, 33
3.249 - \item {\tt step_tac}, \bold{13}, \bold{29}
3.250 - \item {\tt subst_elem} theorem, 22
3.251 - \item {\tt subst_elemL} theorem, 22
3.252 - \item {\tt subst_eqtyparg} theorem, 26, 38
3.253 - \item {\tt subst_prodE} theorem, 24, 26
3.254 - \item {\tt subst_type} theorem, 22
3.255 - \item {\tt subst_typeL} theorem, 22
3.256 - \item {\tt succ} constant, 19
3.257 - \item {\tt SUM} symbol, 20, 21
3.258 - \item {\tt Sum} constant, 19
3.259 - \item {\tt SumC} theorem, 24
3.260 - \item {\tt SumE} theorem, 24, 29, 33
3.261 - \item {\tt SumE_fst} theorem, 24, 26, 38, 39
3.262 - \item {\tt SumE_snd} theorem, 24, 26, 40
3.263 - \item {\tt SumEL} theorem, 24
3.264 - \item {\tt SumF} theorem, 24
3.265 - \item {\tt SumFL} theorem, 24
3.266 - \item {\tt SumI} theorem, 24, 34
3.267 - \item {\tt SumIL} theorem, 24
3.268 - \item {\tt SumIL2} theorem, 26
3.269 - \item {\tt sym} theorem, 8
3.270 - \item {\tt sym_elem} theorem, 22
3.271 - \item {\tt sym_type} theorem, 22
3.272 - \item {\tt symL} theorem, 9
3.273 -
3.274 - \indexspace
3.275 -
3.276 - \item {\tt T} constant, 19
3.277 - \item {\textit {t}} type, 18
3.278 - \item {\tt TC} theorem, 25
3.279 - \item {\tt TE} theorem, 25
3.280 - \item {\tt TEL} theorem, 25
3.281 - \item {\tt term} class, 5
3.282 - \item {\tt test_assume_tac}, \bold{27}
3.283 - \item {\tt TF} theorem, 25
3.284 - \item {\tt THE} symbol, 6
3.285 - \item {\tt The} constant, 6
3.286 - \item {\tt The} theorem, 8
3.287 - \item {\tt thinL} theorem, 8
3.288 - \item {\tt thinR} theorem, 8
3.289 - \item {\tt TI} theorem, 25
3.290 - \item {\tt trans} theorem, 8
3.291 - \item {\tt trans_elem} theorem, 22
3.292 - \item {\tt trans_red} theorem, 22
3.293 - \item {\tt trans_type} theorem, 22
3.294 - \item {\tt True} constant, 6
3.295 - \item {\tt True_def} theorem, 8
3.296 - \item {\tt Trueprop} constant, 6
3.297 - \item {\tt TrueR} theorem, 9
3.298 - \item {\tt tt} constant, 19
3.299 - \item {\tt Type} constant, 19
3.300 - \item {\tt typechk_tac}, \bold{27}, 32, 35, 39, 40
3.301 -
3.302 - \indexspace
3.303 -
3.304 - \item {\tt when} constant, 19, 24, 33
3.305 -
3.306 - \indexspace
3.307 -
3.308 - \item {\tt zero_ne_succ} theorem, 22, 23
3.309 -
3.310 -\end{theindex}
4.1 --- a/doc-src/Logics/logics.rao Wed May 05 18:16:03 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.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 -}
5.1 --- a/doc-src/Logics/logics.tex Wed May 05 18:16:03 1999 +0200
5.2 +++ b/doc-src/Logics/logics.tex Wed May 05 18:19:03 1999 +0200
5.3 @@ -4,7 +4,6 @@
5.4
5.5 \makeatletter
5.6 \input{../proof.sty}
5.7 -\input{../rail.sty}
5.8 \input{../iman.sty}
5.9 \input{../extra.sty}
5.10 \makeatother