DMCA
Program Extraction in a Logical Framework Setting (1994)
| Venue: | In Proceedings of the 5th International Conference on Logic Programming and Automated Reasoning |
BibTeX
@INPROCEEDINGS{Symbolique94programextraction,
author = {Calcul Symbolique and Penny Anderson and Penny Anderson and Projet Croap},
title = {Program Extraction in a Logical Framework Setting},
booktitle = {In Proceedings of the 5th International Conference on Logic Programming and Automated Reasoning},
year = {1994},
pages = {144--158},
publisher = {Springer-Verlag}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
: This paper demonstrates a method of extracting programs from formal deductions represented in the Edinburgh Logical Framework, using the Elf programming language. Deductive systems are given for the extraction of simple types from formulas of first-order arithmetic and of -calculus terms from natural deduction proofs. These systems are easily encoded in Elf, yielding an implementation of extraction that corresponds to modified realizability. Because extraction is itself implemented as a set of formal deductive systems, some of its correctness properties can be partially represented and mechanically checked in the Elf language. Key-words: Program extraction, Realisability, Typed lambda calculus, Logical framework, Higher-order logic programming language, Elf, Edinburgh Logical Framework, Natural deduction, Natural semantics (R'esum'e : tsvp) Unite de recherche INRIA Sophia-Antipolis 2004 route des Lucioles, BP 93, 06902 SOPHIA-ANTIPOLIS Cedex (France) Telephone : (33) 93 65 77 77 -- ...
Keyphrases
logical framework program extraction edinburgh logical framework deductive system elf language formal deduction elf programming language sophia-antipolis cedex typed lambda calculus formal deductive system route de lucioles natural deduction correctness property natural deduction proof higher-order logic programming language simple type calculus term natural semantics
