Top-down synthesis of divide-and-conquer algorithms
Artificial Intelligence
Conditional rewrite rules: Confluence and termination
Journal of Computer and System Sciences
Artificial Intelligence
Simplifying conditional term rewriting systems: Unification, termination and confluence
Journal of Symbolic Computation
Machine intelligence 11
Transformational derivation of programs using the focus system
SDE 3 Proceedings of the third ACM SIGSOFT/SIGPLAN software engineering symposium on Practical software development environments
Automatic proofs by induction in theories without constructors
Information and Computation
A strong restriction of the inductive completion procedure
Journal of Symbolic Computation
Logic programming: systematic program development
Logic programming: systematic program development
Formal methods in transformational derivation of programs
Conference proceedings on Formal methods in software development
ML for the working programmer
A completion procedure for conditional equationst
Journal of Symbolic Computation
Automating inductionless induction using test sets
Journal of Symbolic Computation
Handbook of theoretical computer science (vol. B)
Equational inference, canonical proofs, and proof orderings
Journal of the ACM (JACM)
A Transformation System for Developing Recursive Programs
Journal of the ACM (JACM)
Journal of the ACM (JACM)
A System for Assisting Program Transformation
ACM Transactions on Programming Languages and Systems (TOPLAS)
Some Techniques for Recursion Removal from Recursive Functions
ACM Transactions on Programming Languages and Systems (TOPLAS)
On proving inductive properties of abstract data types
POPL '80 Proceedings of the 7th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Partial Evaluation and Mixed Computation: Proceedings of the IFIP TC2 Workshop, Gammel Avernaes, Denmark, 18-24 Oct., 1987
On Word Problems in Equational Theories
ICALP '87 Proceedings of the 14th International Colloquium, on Automata, Languages and Programming
Rewrite Methods for Clausal and Non-Clausal Theorem Proving
Proceedings of the 10th Colloquium on Automata, Languages and Programming
Algorithmic Learning from Incomplete Information - Principles and Problems
Proceedings of the 5th International Meeting of Young Computer Scientists on Machines, Languages, and Complexity
A Rewrite Rule Based Approach for Synthesizing Abstract Data Types
CAAP '85 Proceedings of the International Joint Conference on Theory and Practice of Software Development (TAPSOFT), Volume 1: Colloquium on Trees in Algebra and Programming: Mathematical Foundations of Software Development
Computing Ground Reducability and Inductively Complete Positions
RTA '89 Proceedings of the 3rd International Conference on Rewriting Techniques and Applications
Program Transformation and Rewriting
RTA '91 Proceedings of the 4th International Conference on Rewriting Techniques and Applications
Knuth-Bendix Completion versus Fold/Unfold: a Comparative Study in Program Synthesis
GWAI-86 und 2. Österreichische Artificial-Intelligence-Tagung
Towards a Set of Inference Rules for Solving Divergence in Knuth-Bendix Completion
AII '89 Proceedings of the International Workshop on Analogical and Inductive Inference
Proceedings of the 7th International Conference on Automated Deduction
First-Order Theorem Proving Using Conditional Rewrite Rules
Proceedings of the 9th International Conference on Automated Deduction
Proceedings of the 10th International Conference on Automated Deduction
Complete Sets of Reductions with Constraints
Proceedings of the 10th International Conference on Automated Deduction
Proceedings of the 2nd International CTRS Workshop on Conditional and Typed Rewriting Systems
Reduction Techniques for First-Order Reasoning
CTRS '92 Proceedings of the Third International Workshop on Conditional Term Rewriting Systems
Rewriting Techniques for Program Synthesis
RTA '89 Proceedings of the 3rd International Conference on Rewriting Techniques and Applications
Conditional Rewriting in Focus
Proceedings of the 2nd International CTRS Workshop on Conditional and Typed Rewriting Systems
A lemma driven automatic theorem prover for recursive function theory
IJCAI'77 Proceedings of the 5th international joint conference on Artificial intelligence - Volume 1
IJCAI'85 Proceedings of the 9th international joint conference on Artificial intelligence - Volume 1
Inductive synthesis of equational programs
AAAI'90 Proceedings of the eighth National conference on Artificial intelligence - Volume 1
Partial evaluation of functional logic programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
Specialization of inductively sequential functional logic programs
Proceedings of the fourth ACM SIGPLAN international conference on Functional programming
Automated Software Engineering
Specialization of functional logic programs based on needed narrowing
Theory and Practice of Logic Programming
ACM Transactions on Computational Logic (TOCL)
Correction of functional logic programs
ESOP'03 Proceedings of the 12th European conference on Programming
An integrated framework for the diagnosis and correction of rule-based programs
Theoretical Computer Science
Dealing with non-orientable equations in rewriting induction
RTA'06 Proceedings of the 17th international conference on Term Rewriting and Applications
Simple and Minimal Ground Term Equation Systems
Fundamenta Informaticae
| Hi-index | 0.00 |
An equational approach to the synthesis of functional and logic program is taken. In this context, the synthesis task involves finding executable equations such that the given specification holds in their standard model. Hence, to synthesize such programs, induction is necessary. We formulate procedures for inductive proof, as well as for program synthesis, using the framework of ''ordered rewriting''. We also propose heuristics for generalizing from a sequence of equational consequences. These heuristics handle cases where the deductive process alone is inadequate for coming up with a program.