Program verification in a logical theory of construction
Proc. of a conference on Functional programming languages and computer architecture
Proving termination of normalization functions for conditional expressions
Journal of Automated Reasoning
Proving termination with multiset orderings
Communications of the ACM
The Identification of Propositions and types in Martin-Löf's Type Theory: A Programming Example
Proceedings of the 1983 International FCT-Conference on Fundamentals of Computation Theory
Constructive Mathematics as a Programming Logic I: Some Principles of Theory
Proceedings of the 1983 International FCT-Conference on Fundamentals of Computation Theory
Programming in Constructive Set Theory: Some examples
FPCA '81 Proceedings of the 1981 conference on Functional programming languages and computer architecture
Automatic Synthesis of Recursive Programs: The Proof-Planning Paradigm
Automated Software Engineering
A Machine-Checked Implementation of Buchberger's Algorithm
Journal of Automated Reasoning
Extracting General Recursive Program Schemes in Nuprl's Type Theory
LOPSTR '01 Selected papers from the 11th International Workshop on Logic Based Program Synthesis and Transformation
Building Certified Static Analysers by Modular Construction of Well-founded Lattices
Electronic Notes in Theoretical Computer Science (ENTCS)
Certifying properties of an efficient functional program for computing Gröbner bases
Journal of Symbolic Computation
Towards a certified and efficient computing of gröbner bases
EUROCAST'05 Proceedings of the 10th international conference on Computer Aided Systems Theory
| Hi-index | 0.00 |
Martin-Lof's Intuitionistic Theory of Types is becoming popular for formal reasoning about computer programs. To handle recursion schemes other than primitive recursion, a theory of well-founded relations is presented. Using primitive recursion over higher types, induction and recursion are formally derived for a large class of well-founded relations. Included are