From e35fd10c4ef3c257e91156e07e65234e81672036 Mon Sep 17 00:00:00 2001
From: filliatr
Date: Fri, 26 Sep 2003 09:01:01 +0000
Subject: passage V8

git-svn-id: svn+ssh://scm.gforge.inria.fr/svn/coq/trunk@8343 85f007b7-540e-0410-9357-904b9bb8a0f7
---
 doc/Extraction.tex | 30 ++++++++++++++++--------------
 1 file changed, 16 insertions(+), 14 deletions(-)

(limited to 'doc/Extraction.tex')

diff --git a/doc/Extraction.tex b/doc/Extraction.tex
index cdc2d4aaf4..c2e3708fdd 100755
--- a/doc/Extraction.tex
+++ b/doc/Extraction.tex
@@ -234,9 +234,9 @@ The syntax is the following:
 \Example
 Typical examples are the following:
 \begin{coq_example}
-Extract Inductive unit => unit [ "()" ].
-Extract Inductive bool => bool [ true false ].
-Extract Inductive sumbool => bool [ true false ].
+Extract Inductive unit => "unit" [ "()" ].
+Extract Inductive bool => "bool" [ "true" "false" ].
+Extract Inductive sumbool => "bool" [ "true" "false" ].
 \end{coq_example}
 
 
@@ -314,7 +314,9 @@ The file {\tt Euclid} contains the proof of Euclidean division
 (theorem {\tt eucl\_dev}). The natural numbers defined in the example
 files are unary integers defined by two constructors $O$ and $S$:
 \begin{coq_example*}
-Inductive nat : Set := O : nat | S : nat -> nat.
+Inductive nat : Set :=
+  | O : nat
+  | S : nat -> nat.
 \end{coq_example*}
 
 This module contains a theorem {\tt eucl\_dev}, and its extracted term
@@ -327,9 +329,9 @@ We can now extract this program to \ocaml:
 Reset Initial.
 \end{coq_eval}
 \begin{coq_example}
-Require Euclid.
-Extraction Inline Wf_nat.gt_wf_rec Wf_nat.lt_wf_rec. 
-Recursive Extraction eucl_dev.
+Require Import Euclid.
+Extraction Inline Wf_nat.gt_wf_rec Wf_nat.lt_wf_rec.
+Recursive Extraction  eucl_dev.
 \end{coq_example}
 
 The inlining of {\tt gt\_wf\_rec} and {\tt lt\_wf\_rec} is not
@@ -379,20 +381,20 @@ treesort}, whose type is shown below:
 
 \begin{coq_eval}
 Reset Initial.
-Require Relation_Definitions. 
-Require PolyList.
-Require Sorting. 
-Require Permutation.
+Require Import Relation_Definitions.
+Require Import PolyList.
+Require Import Sorting.
+Require Import Permutation.
 \end{coq_eval}
 \begin{coq_example}
-Require Heap.
-Check treesort.
+Require Import Heap.
+Check   treesort.
 \end{coq_example}
 
 Let's now extract this function: 
 
 \begin{coq_example}
-Extraction Inline Sorting.sort_rec is_heap_rec.
+Extraction Inline sort_rec is_heap_rec.
 Extraction NoInline list_to_heap.
 Extraction "heapsort" treesort.
 \end{coq_example}
-- 
cgit v1.2.3

