Searching for "Recursive Programming with Proofs." – sorted by Relevance.
-
Automatic Synthesis of Recursive Programs: The Proof-Planning Paradigm
- Automatic Synthesis of Recursive Programs: The Proof-Planning Paradigm Alessandro Armando DIST
- Cited by 15 (1 self) – Add To MetaCart
-
A Modality for Recursion
- range of programs and a new framework for natural construction of recursive programs in the proofs-as-programs
- Cited by 6 (0 self) – Add To MetaCart
-
Dependent Type Theory with Parameterized First-Order Data Types and Well-Founded Recursion
- the case-notation. Their proofs had the shape of recursive programs, but proofs were not considered
- Cited by 1 (0 self) – Add To MetaCart
-
What is a proof
- that the φ(n) premises be proved in a uniform way, i.e. that there exists a recursive program, proof φ, which
- Cited by 2 (0 self) – Add To MetaCart
-
Verification of Diagrammatic Proofs
- is extracted from these proof instances, and is captured in a recursive program. This recursive program
- Cited by 1 (0 self) – Add To MetaCart
-
Proof Methods for Corecursive Programs
- programs. It is aimed at a reader who is familiar with the basics of recursive programming and proof
- Cited by 11 (4 self) – Add To MetaCart
-
A Method of Program Refinement
- technique for developing recursive programs. The proof of such developments is usually complicated because
- Cited by 9 (0 self) – Add To MetaCart

