Classical proofs as programs: How, what and why
- 1 January 1992
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Abstracting controlPublished by Association for Computing Machinery (ACM) ,1990
- A formulae-as-type notion of controlPublished by Association for Computing Machinery (ACM) ,1990
- Revised 3 report on the algorithmic language schemeACM SIGPLAN Notices, 1986
- Classically and intuitionistically provably recursive functionsPublished by Springer Nature ,1978
- Call-by-name, call-by-value and the λ-calculusTheoretical Computer Science, 1975
- Lambda calculus schemataACM SIGPLAN Notices, 1972