Proof Theory at Work: Program Development in the Minlog System
- 1 January 1998
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Orthogonal higher-order rewrite systems are confluentPublished by Springer Nature ,2005
- Program extraction from classical proofsPublished by Springer Nature ,1995
- Strict functionals for termination proofsPublished by Springer Nature ,1995
- An inverse of the evaluation functional for typed lambda -calculusPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1991
- A Logic Programming Language with Lambda-Abstraction, Function Variables, and Simple UnificationJournal of Logic and Computation, 1991
- Syntactic translations and provably recursive functionsThe Journal of Symbolic Logic, 1985
- Domains for denotational semanticsPublished by Springer Nature ,1982
- Classically and intuitionistically provably recursive functionsPublished by Springer Nature ,1978
- Intensional interpretations of functionals of finite type IThe Journal of Symbolic Logic, 1967