Refined program extraction from classical proofs
- 1 April 2002
- journal article
- Published by Elsevier in Annals of Pure and Applied Logic
- Vol. 114 (1-3) , 3-25
- https://doi.org/10.1016/s0168-0072(01)00073-2
Abstract
No abstract availableThis publication has 10 references indexed in Scilit:
- λμ-Calculus: An algorithmic interpretation of classical natural deductionPublished by Springer Nature ,2005
- The Warshall Algorithm and Dickson's Lemma: Two Examples of Realistic Program ExtractionJournal of Automated Reasoning, 2001
- Programs from classical proofsPublished by Walter de Gruyter GmbH ,1995
- Program extraction from classical proofsPublished by Springer Nature ,1995
- Classical logic, storage operators and second-order lambda-calculusAnnals of Pure and Applied Logic, 1994
- The revised report on the syntactic theories of sequential control and stateTheoretical Computer Science, 1992
- A formulae-as-type notion of controlPublished by Association for Computing Machinery (ACM) ,1990
- A syntactic theory of sequential controlTheoretical Computer Science, 1987
- Syntactic translations and provably recursive functionsThe Journal of Symbolic Logic, 1985
- Finiteness of the Odd Perfect and Primitive Abundant Numbers with n Distinct Prime FactorsAmerican Journal of Mathematics, 1913