summary |
shortlog |
changelog |
graph |
tags |
branches |
files |
changeset |
file |
revisions |
annotate |
diff |
raw

doc-src/Ref/classical.tex

changeset 6592 | c120262044b6 |

parent 6170 | 9a59cf8ae9b5 |

child 7990 | 0a604b2fc2b1 |

1.1 --- a/doc-src/Ref/classical.tex Wed May 05 14:31:31 1999 +0200 1.2 +++ b/doc-src/Ref/classical.tex Wed May 05 16:44:42 1999 +0200 1.3 @@ -112,7 +112,7 @@ 1.4 theorem and apply rules backwards in a fairly arbitrary manner. This yields a 1.5 surprisingly effective proof procedure. Quantifiers add few complications, 1.6 since Isabelle handles parameters and schematic variables. See Chapter~10 1.7 -of {\em ML for the Working Programmer}~\cite{paulson91} for further 1.8 +of {\em ML for the Working Programmer}~\cite{paulson-ml2} for further 1.9 discussion. 1.10 1.11