Synthesis of rewrite programs by higher-order and semantic unification
- 1 February 1991
- journal article
- Published by Springer Nature in New Generation Computing
- Vol. 8 (4) , 403-420
- https://doi.org/10.1007/bf03037096
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Higher-order unification revisited: Complete sets of transformationsJournal of Symbolic Computation, 1989
- Natural deduction as higher-order resolutionThe Journal of Logic Programming, 1986
- Algorithmic program diagnosisPublished by Association for Computing Machinery (ACM) ,1982
- Canonical Forms and Unification.Published by Defense Technical Information Center (DTIC) ,1980
- A class of functions synthesized from a finite number of examples and a lisp program schemeInternational Journal of Parallel Programming, 1979
- Proving and applying program transformations expressed with second-order patternsActa Informatica, 1978
- The Inference of Regular LISP Programs from ExamplesIEEE Transactions on Systems, Man, and Cybernetics, 1978
- A Methodology for LISP Program Construction from ExamplesJournal of the ACM, 1977
- A unification algorithm for typed -calculusTheoretical Computer Science, 1975