Machine Deduction

We present in this paper a new type system which allows to extract code for an abstract machine instead of lambda-terms. Thus, we get a framework to compile correctly programs extracted from proof by translating their proof in our system and then extracting the code. Moreover, we will see that we can associate programs to classical proofs.

[1]  Daniel Leivant,et al.  Typing and Computational Properties of Lambda Expressions , 1986, Theor. Comput. Sci..

[2]  Michel Parigot,et al.  Programming with Proofs , 1990, J. Inf. Process. Cybern..

[3]  Michel Parigot Recursive Programming with Proofs , 1992, Theor. Comput. Sci..