aboutsummaryrefslogtreecommitdiff
path: root/contrib/extraction/README
diff options
context:
space:
mode:
authorletouzey2001-04-24 16:38:26 +0000
committerletouzey2001-04-24 16:38:26 +0000
commit3586c044d9f9e48f0043bb3af1bd3fbcc78485a0 (patch)
tree73967eb1a0efb3fc19168ea098c38aea500c3e65 /contrib/extraction/README
parente7d2a1a7e87e827773051b7cce904cb1b00fe609 (diff)
TODO in v.o., test/Makefile moins pire, README avec ref
git-svn-id: svn+ssh://scm.gforge.inria.fr/svn/coq/trunk@1694 85f007b7-540e-0410-9357-904b9bb8a0f7
Diffstat (limited to 'contrib/extraction/README')
-rw-r--r--contrib/extraction/README8
1 files changed, 8 insertions, 0 deletions
diff --git a/contrib/extraction/README b/contrib/extraction/README
index bcd278b335..2a7bc05645 100644
--- a/contrib/extraction/README
+++ b/contrib/extraction/README
@@ -25,6 +25,7 @@ Translation between Coq and ML is based upon the following principles:
- Terms of sort Prop don't have any computational meaning, so they are
merged in one ML term "prop", which is for the moment the ML constant ().
+This part is done according to P. Letouzey's work (*).
- Terms that are arities (i.e. something of shape ( : )( : )...s with
s a sort ) don't have any ML counterpart, since they are types of
@@ -101,6 +102,13 @@ Go there.
"make reals" to extract & compile a realization of the Reals axioms
+(*):
+Exécution de termes de preuves: une nouvelle méthode d'extraction
+pour le Calcul des Constructions Inductives, Pierre Letouzey,
+master thesis, 2000,
+http://www.eleves.ens.fr/home/letouzey/download/rapport_dea.ps.gz
+
+
Any feedback is welcome: