Synthesis of rewrite programs by higher-order and semantic unification
From MaRDI portal
Publication:749216
DOI10.1007/BF03037096zbMATH Open0712.68057OpenAlexW1983718842MaRDI QIDQ749216FDOQ749216
Authors: Masami Hagiya
Publication date: 1991
Published in: New Generation Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf03037096
Recommendations
inductive inferencenarrowingterm rewriting systemanti-unificationhigher-order unificationprogramming by examplesemantic unification
Cites Work
- Title not available (Why is that?)
- A typed \(\lambda\)-calculus for proving-by-example and bottom-up generalization procedure
- Title not available (Why is that?)
- Title not available (Why is that?)
- Proving and applying program transformations expressed with second-order patterns
- Title not available (Why is that?)
- Title not available (Why is that?)
- A unification algorithm for typed \(\overline\lambda\)-calculus
- Natural deduction as higher-order resolution
- Higher-order unification revisited: Complete sets of transformations
- A Methodology for LISP Program Construction from Examples
- A class of functions synthesized from a finite number of examples and a lisp program scheme
- 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)