A class of functions synthesized from a finite number of examples and a lisp program scheme

DOI10.1007/BF00995500zbMath0427.68019MaRDI QIDQ3863043

Yves Kodratoff

Publication date: 1979

Published in: International Journal of Computer & Information Sciences (Search for Journal in Brave)

zbMATH Keywords

pattern matchingdifference equationprogram synthesisprogram prooffixed point semanticsinstantiationLISP programs

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items

From programming-by-example to proving-by-example, Synthesis of rewrite programs by higher-order and semantic unification, Semantics of algorithmic languages, Generalized regular expressions - a language for synthesis of programs with branching in loops

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Proving Theorems about LISP Functions
• A Methodology for LISP Program Construction from Examples
• Goal-Directed Program Transformation
• The Inference of Regular LISP Programs from Examples
• Inductive methods for proving properties of programs