Synthesis of rewrite programs by higher-order and semantic unification

DOI10.1007/BF03037096zbMath0712.68057OpenAlexW1983718842MaRDI QIDQ749216

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

zbMATH Keywords

inductive inferencenarrowinghigher-order unificationterm rewriting systemanti-unificationprogramming by examplesemantic unification

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Related Items

From programming-by-example to proving-by-example ⋮ Decidable higher-order unification problems

Cites Work

• A typed \(\lambda\)-calculus for proving-by-example and bottom-up generalization procedure
• A unification algorithm for typed \(\overline\lambda\)-calculus
• Proving and applying program transformations expressed with second-order patterns
• Higher-order unification revisited: Complete sets of transformations
• A class of functions synthesized from a finite number of examples and a lisp program scheme
• A Methodology for LISP Program Construction from Examples
• The Inference of Regular LISP Programs from Examples
• Natural deduction as higher-order resolution
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item