author | wenzelm |
Mon, 16 Mar 2009 18:24:30 +0100 | |
changeset 30549 | d2d7874648bd |
parent 25420 | 0fe95159787a |
child 32479 | 521cc9bf2958 |
permissions | -rw-r--r-- |
13405 | 1 |
(* Title: HOL/Extraction/ROOT.ML |
2 |
ID: $Id$ |
|
3 |
||
4 |
Examples for program extraction in Higher-Order Logic. |
|
5 |
*) |
|
6 |
||
7 |
if HOL_proofs < 2 then |
|
8 |
warning "HOL proof terms required for running extraction examples" |
|
9 |
else |
|
25374 | 10 |
(Proofterm.proofs := 2; |
25420
0fe95159787a
Added new exampes Greatest_Common_Divisor and Euclid.
berghofe
parents:
25374
diff
changeset
|
11 |
no_document use_thys ["Efficient_Nat", "~~/src/HOL/NumberTheory/Factorization"]; |
0fe95159787a
Added new exampes Greatest_Common_Divisor and Euclid.
berghofe
parents:
25374
diff
changeset
|
12 |
use_thys ["Greatest_Common_Divisor", "Warshall", "Higman", "Pigeonhole", "Euclid"]); |