DOIAbstract
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
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
Based on the Calculus of Constructions extended with inductive definitions we present a Theory of Sp...
We present a method using an extended logical system for obtaining "correct" programs from specifica...
. In the proofs as programs methodology a program is derived from a formal constructive proof. Becau...
We introduce Pure Type Systems with Pairs generalising earlier work on program extraction in Typed L...
AbstractThis paper presents a step in the development of an operational approach to program extracti...
This paper outlines the author’s experiences using the methodology of program extraction within a pr...
AbstractWe investigate an automated program synthesis system based on the paradigm of programming by...
The Theory of Specifications is an extension of the Calculus of Constructions where the specificatio...
. This paper demonstrates a method of extracting programs from formal deductions represented in the ...
The logic programming refinement calculus is a method for transforming specifications to executable ...
PPDP'06 - Proceedings of the Eight ACM SIGPLAN Symposium on Principles and Practice of Declarative P...
Abstract. We present a proof theoretical method for de-compiling lowlevel code to the typed lambda c...
This paper outlines the author’s experiences using the methodology of program extraction within a pr...
We investigate an automated program synthesis system that is based on the paradigm of programming by...
AbstractWe introduce a new type system called “System ST” (ST stands for subtyping), based on subtyp...
Based on the Calculus of Constructions extended with inductive definitions we present a Theory of Sp...
We present a method using an extended logical system for obtaining "correct" programs from specifica...
. In the proofs as programs methodology a program is derived from a formal constructive proof. Becau...
We introduce Pure Type Systems with Pairs generalising earlier work on program extraction in Typed L...
AbstractThis paper presents a step in the development of an operational approach to program extracti...
This paper outlines the author’s experiences using the methodology of program extraction within a pr...
AbstractWe investigate an automated program synthesis system based on the paradigm of programming by...
The Theory of Specifications is an extension of the Calculus of Constructions where the specificatio...
. This paper demonstrates a method of extracting programs from formal deductions represented in the ...
The logic programming refinement calculus is a method for transforming specifications to executable ...
PPDP'06 - Proceedings of the Eight ACM SIGPLAN Symposium on Principles and Practice of Declarative P...
Abstract. We present a proof theoretical method for de-compiling lowlevel code to the typed lambda c...
This paper outlines the author’s experiences using the methodology of program extraction within a pr...
We investigate an automated program synthesis system that is based on the paradigm of programming by...
AbstractWe introduce a new type system called “System ST” (ST stands for subtyping), based on subtyp...
Based on the Calculus of Constructions extended with inductive definitions we present a Theory of Sp...
We present a method using an extended logical system for obtaining "correct" programs from specifica...
. In the proofs as programs methodology a program is derived from a formal constructive proof. Becau...
Add to ORKG