Abstract
This paper presents a formulation of program extraction system from constructive proofs. It is designed as a simple system and is very similar to the ordinary Gentzen style of natural deduction as compared to other constructive logics to clarify the relationship between constructive proofs and programs. Proofs and λ-expressions are regarded as different things, and they are linked by the notion of proof compilation based on realizability.The program extraction algorithm is given explicitly, and two simple examples, simulation of course of value induction by mathematical induction and, by using this as a user-defined rule of inference, extraction of a gcd program, are investigated to check how the well known method of proof normalisation works as an optimisation technique and what kinds of inefficiency remain after the proof normalisation. Subtle points about the execution of extracted codes are also discussed. Finally, modified V-code is introduced as an easy but powerful optimisation technique,
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
