From programming-by-example to proving-by-example
- 1 January 1991
- book chapter
- Published by Springer Nature
- p. 387-419
- https://doi.org/10.1007/3-540-54415-1_56
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Synthesis of rewrite programs by higher-order and semantic unificationNew Generation Computing, 1991
- Higher-order unification revisited: Complete sets of transformationsJournal of Symbolic Computation, 1989
- Explanation-based learning: a survey of programs and perspectivesACM Computing Surveys, 1989
- Explanation-based generalisation = partial evaluationArtificial Intelligence, 1988
- Inductive Inference: Theory and MethodsACM Computing Surveys, 1983
- 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
- A Methodology for LISP Program Construction from ExamplesJournal of the ACM, 1977
- A unification algorithm for typed -calculusTheoretical Computer Science, 1975