H. Schwichtenberg. Classifying Recursive Functions, in Handbook of computability theory, ed. E. R. Gri or, Elsevier 1999. Home/Search Document Not in Database Summary Related Articles |
This paper is cited in the following contexts:
Grundlagenstreit in the Theory of Programming - Voda (2003) (Correct)
....in computer programs then one can use the system PA which is PA conservatively enriched with the primitive recursive functionals in nite types. Or even better, one can interprete without any diculties the Scott Ershov Schwichtenberg theory of partial continuous functionals in ACA 0 (see [12]) The use of stronger theories seems to be unwarranted and a programming recreation without ontological rights . The system CL, which has been extensively used at our university for seven years now in undergraduate teaching of theory of programming and logic (about four hundred students pass ....
H. Schwichtenberg. Classifying Recursive Functions, in Handbook of computability theory, ed. E. R. Gri or, Elsevier 1999.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC