Synthesis of rewrite programs by higher-order and semantic unification
type: Item
instance of: scholarly article
title: Synthesis of rewrite programs by higher-order and semantic unification
zbMATH Open document ID: 0712.68057
DOI: 10.1007/BF03037096
author: Masami Hagiya
published in: New Generation Computing
publication date: 1991-01-01T00:00:00Z
Mathematics Subject Classification ID: 68Q42
zbMATH DE Number: 4172397
zbMATH Keywords: narrowing
zbMATH Keywords: programming by example
zbMATH Keywords: inductive inference
zbMATH Keywords: anti-unification
zbMATH Keywords: higher-order unification
zbMATH Keywords: semantic unification
zbMATH Keywords: term rewriting system
MaRDI profile type: Publication
cites work: The Inference of Regular LISP Programs from Examples
cites work: Q4205074
cites work: Q3782762
cites work: A typed \(\lambda\)-calculus for proving-by-example and bottom-up generalization procedure
cites work: A unification algorithm for typed \(\overline\lambda\)-calculus
cites work: Proving and applying program transformations expressed with second-order patterns
cites work: Q3883561
cites work: A class of functions synthesized from a finite number of examples and a lisp program scheme
cites work: Natural deduction as higher-order resolution
cites work: Q5624681
cites work: Q5624680
cites work: Higher-order unification revisited: Complete sets of transformations
cites work: A Methodology for LISP Program Construction from Examples
full work available at URL: https://doi.org/10.1007/bf03037096
OpenAlex ID: W1983718842
description: scientific article; zbMATH DE number 4172397