scientific article; zbMATH DE number 432701
From MaRDI portal
Publication:3138828
The first part of the paper contains a streamlined proof of the result due to Girard: provably recursive functions of Peano arithmetic are exactly those bounded by the functions of the slow-growing hierarchy up to the Howard ordinal. The second part contains some of the technical details of the implementation of a program-extraction system designed by the author. It was applied to upwind the proof from the first part. For the entire collection see [Zbl 0772.00018].
Recommendations
Cited in
(19)- A slow growing analogue to Buchholz' proof
- Total sets and objects in domain theory
- Well-ordering proofs for Martin-Löf type theory
- Proofs as processes
- Proofs and programs
- Type-theoretic approaches to ordinals
- Proofs and computations
- Provably recursive programs and program extraction
- Program extraction from Gentzen's proof of transfinite induction up to _0
- scientific article; zbMATH DE number 806754 (Why is no real title available?)
- Proof-theoretic notions for software maintenance
- From programming-by-example to proving-by-example
- What Is the Difference Between Proofs and Programs?
- A machine program for theorem-proving
- Intrinsic reasoning about functional programs. I: First order theories
- Program extraction from classical proofs
- Proof methods of declarative properties of definite programs
- Schwichtenberg's style analysis of parameter-free fragments of Girard's system F
- Formal proof of a program: find
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3138828)