Eliminating Proofs from Programs

Abstract This paper presents a step in the development of an operational approach to program extraction in type theory. In order to get a program from a lambda term, the logical parts need to be removed. This is done by a reduction relation →e. We study the combination of β-reduction and e-reduction, both in the setting of simply typed lambda calculus and for pure type systems. In the general setting the properties confluence, subject reduction, and strong normalization are studied.

[1]  Christine C. Paulin.  Extraction de programmes dans le calcul des constructions , 1989 .

[2]  Tristan Crolard.  A type theory which is complete for Kreisel's modified realizability , 1999, Electron. Notes Theor. Comput. Sci..

[3]  Nora Szasz,et al.  Internal Program Extractionin the Calculus of Inductive , 2002 .

[4]  Maribel Fernández,et al.  An Operational Approach to Program Extraction in the Calculus of Constructions , 2002, LOPSTR.

[5]  Herman Geuvers,et al.  The Church-Rosser property for beta eta -reduction in typed lambda -calculi , 1992, [1992] Proceedings of the Seventh Annual IEEE Symposium on Logic in Computer Science.

[6]  J. H. Geuvers.  Logics and type systems , 1993 .

[7]  E Erik Poll.  A programming logic based on type theory , 1994 .

[8]  Erik Poll,et al.  Pure Type Systems with Definitions , 1994, LFCS.

[9]  Vincent van Oostrom.  Development Closed Critical Pairs , 1995, HOA.

[10]  Zhaohui Luo,et al.  ECC, an extended calculus of constructions , 1989, [1989] Proceedings. Fourth Annual Symposium on Logic in Computer Science.

[11]  Christine Paulin-Mohring,et al.  Extracting ω's programs from proofs in the calculus of constructions , 1989, POPL '89.

[12]  Paula Severi,et al.  Studies of a Theory of Specifications with Built-in Program Extraction , 2004, Journal of Automated Reasoning.

[13]  Christine Paulin-Mohring,et al.  The coq proof assistant reference manual , 2000 .

[14]  Christian Prehofer,et al.  Higher-order narrowing with definitional trees , 1999, Journal of Functional Programming.

[15]  Gilles Barthe,et al.  On the Subject Reduction Property for Algebraic Type Systems , 1996, CSL.

[16]  Rod M. Burstall,et al.  Deliverables: A Categorial Approach to Program Development in Type Theory , 1993, MFCS.

[17]  H. Geuvers.  The Church-Rosser property for βη-reduction in typed λ-calculi , 1992, LICS 1992.

[18]  Ian Mackie,et al.  A uniform approach to program extraction: Pure Type Systems with Ultra-Sigma Types , 2002 .

[19]  Hugo Herbelin,et al.  The Coq proof assistant : reference manual, version 6.1 , 1997 .