A computational logic handbook
A computational logic handbook
Programming: the derivation of algorithms
Programming: the derivation of algorithms
An introduction to functional programming
An introduction to functional programming
Rippling: a heuristic for guiding inductive proofs
Artificial Intelligence
An Industrial Strength Theorem Prover for a Logic Based on Common Lisp
IEEE Transactions on Software Engineering
Functional Programming
The Use of Planning Critics in Mechanizing Inductive Proofs
LPAR '92 Proceedings of the International Conference on Logic Programming and Automated Reasoning
An Automatic Generalization Method for the Inductive Proof of Replicated and Parallel Architectures
TPCD '94 Proceedings of the Second International Conference on Theorem Provers in Circuit Design - Theory, Practice and Experience
Higher-Order Annotated Terms for Proof Search
TPHOLs '96 Proceedings of the 9th International Conference on Theorem Proving in Higher Order Logics
The Use of Explicit Plans to Guide Inductive Proofs
Proceedings of the 9th International Conference on Automated Deduction
Proceedings of the 10th International Conference on Automated Deduction
Using Middle-Out Reasoning to Control the Synthesis of Tail-Recursive Programs
CADE-11 Proceedings of the 11th International Conference on Automated Deduction: Automated Deduction
CADE-13 Proceedings of the 13th International Conference on Automated Deduction: Automated Deduction
A Colored Version of the Lambda-Calculus
CADE-14 Proceedings of the 14th International Conference on Automated Deduction
Mechanizing structural induction (formal system)
Mechanizing structural induction (formal system)
Proof planning for strategy development
Annals of Mathematics and Artificial Intelligence
Combining Proof Plans with Partial Order Planning for Imperative Program Synthesis
Automated Software Engineering
An Integrated Approach to High Integrity Software Verification
Journal of Automated Reasoning
Cooperative reasoning for automatic software verification
Proceedings of the second workshop on Automated formal methods
Tool Integration for Reasoned Programming
Verified Software: Theories, Tools, Experiments
Strategic Issues, Problems and Challenges in Inductive Theorem Proving
Electronic Notes in Theoretical Computer Science (ENTCS)
Poitín: Distilling Theorems From Conjectures
Electronic Notes in Theoretical Computer Science (ENTCS)
Hi-index | 0.00 |
Proof by mathematical induction plays a crucial role in reasoning about functional programs. A generalization step often holds the key to discovering an inductive proof. We present a generalization technique which is particularly applicable when reasoning about functional programs involving accumulating parameters. We provide empirical evidence for the success of our technique and show how it is contributing to the ongoing development of a parallelizing compiler for Standard ML.