src/HOL/ROOT
changeset 62995 7d5ac15ff88f
parent 62734 38fefd98c929
child 62999 65f279853449
equal deleted inserted replaced
62994:19a19ee36daa 62995:7d5ac15ff88f
   397     Various decision procedures, typically involving reflection.
   397     Various decision procedures, typically involving reflection.
   398   *}
   398   *}
   399   options [document = false]
   399   options [document = false]
   400   theories Decision_Procs
   400   theories Decision_Procs
   401 
   401 
   402 session "HOL-Proofs-ex" in "Proofs/ex" = "HOL-Proofs" +
   402 session "HOL-Proofs-ex" (slow) in "Proofs/ex" = "HOL-Proofs" +
   403   options [document = false, parallel_proofs = 0]
   403   options [document = false, parallel_proofs = 0]
   404   theories
   404   theories
   405     Hilbert_Classical
   405     Hilbert_Classical
   406     Proof_Terms
   406     Proof_Terms
   407     XML_Data
   407     XML_Data
   408 
   408 
   409 session "HOL-Proofs-Extraction" in "Proofs/Extraction" = "HOL-Proofs" +
   409 session "HOL-Proofs-Extraction" (slow) in "Proofs/Extraction" = "HOL-Proofs" +
   410   description {*
   410   description {*
   411     Examples for program extraction in Higher-Order Logic.
   411     Examples for program extraction in Higher-Order Logic.
   412   *}
   412   *}
   413   options [parallel_proofs = 0, quick_and_dirty = false]
   413   options [parallel_proofs = 0, quick_and_dirty = false]
   414   theories [document = false]
   414   theories [document = false]
   423     Higman_Extraction
   423     Higman_Extraction
   424     Pigeonhole
   424     Pigeonhole
   425     Euclid
   425     Euclid
   426   document_files "root.bib" "root.tex"
   426   document_files "root.bib" "root.tex"
   427 
   427 
   428 session "HOL-Proofs-Lambda" in "Proofs/Lambda" = "HOL-Proofs" +
   428 session "HOL-Proofs-Lambda" (slow) in "Proofs/Lambda" = "HOL-Proofs" +
   429   description {*
   429   description {*
   430     Lambda Calculus in de Bruijn's Notation.
   430     Lambda Calculus in de Bruijn's Notation.
   431 
   431 
   432     This session defines lambda-calculus terms with de Bruijn indixes and
   432     This session defines lambda-calculus terms with de Bruijn indixes and
   433     proves confluence of beta, eta and beta+eta.
   433     proves confluence of beta, eta and beta+eta.