Synthesis of rewrite programs by higher-order and semantic unification
From MaRDI portal
(Redirected from Publication:749216)
Recommendations
Cites work
- scientific article; zbMATH DE number 4045129 (Why is no real title available?)
- scientific article; zbMATH DE number 3688776 (Why is no real title available?)
- scientific article; zbMATH DE number 4124996 (Why is no real title available?)
- scientific article; zbMATH DE number 3349328 (Why is no real title available?)
- scientific article; zbMATH DE number 3349329 (Why is no real title available?)
- A Methodology for LISP Program Construction from Examples
- A class of functions synthesized from a finite number of examples and a lisp program scheme
- A typed -calculus for proving-by-example and bottom-up generalization procedure
- A unification algorithm for typed -calculus
- Higher-order unification revisited: Complete sets of transformations
- Natural deduction as higher-order resolution
- Proving and applying program transformations expressed with second-order patterns
- The Inference of Regular LISP Programs from Examples
Cited in
(4)
This page was built for publication: Synthesis of rewrite programs by higher-order and semantic unification
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q749216)