On the public citation graph

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

https://doi.org/10.1007/bf00995500
0 signed · 32 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1109/tse.1976.233533openalex-snapshot
Goal-Directed Program Transformation
inferredcites →https://doi.org/10.1109/tsmc.1978.4310035openalex-snapshot
The Inference of Regular LISP Programs from Examples
inferredcites →https://doi.org/10.1145/321864.321875openalex-snapshot
Proving Theorems about LISP Functions
inferredcites →https://doi.org/10.1145/321992.322002openalex-snapshot
A Methodology for LISP Program Construction from Examples
inferredcites →https://doi.org/10.1145/355609.362336openalex-snapshot
Inductive methods for proving properties of programs
inferredcites →https://doi.org/10.21236/ad0406138openalex-snapshot
LISP 1.5 PROGRAMMER'S MANUAL
inferredcites →https://doi.org/10.21236/ad0787035openalex-snapshot
Program-Understanding Systems
inferredcites →https://doi.org/10.21236/ada239419openalex-snapshot
Mathematical Theory of Computation

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/3-540-52885-7_116openalex-snapshot
Programming by example and proving by example using higher-order unification
inferred← citeshttps://doi.org/10.1007/3-540-54415-1_56openalex-snapshot
From programming-by-example to proving-by-example
inferred← citeshttps://doi.org/10.1007/978-1-4615-3602-4_3openalex-snapshot
Generalizing Explanation Structures
inferred← citeshttps://doi.org/10.1007/978-3-642-04125-9_60openalex-snapshot
On Computational Creativity, ‘Inventing’ Theorem Proofs
inferred← citeshttps://doi.org/10.1007/978-3-642-67838-7_43openalex-snapshot
Inducing Non-Trivial Programs from Examples
inferred← citeshttps://doi.org/10.1007/978-3-642-68826-3_12openalex-snapshot
Inductive Inference in Finite Algebraic Structures
inferred← citeshttps://doi.org/10.1007/978-94-009-7019-9_7openalex-snapshot
Program Synthesis from Examples of Behavior
inferred← citeshttps://doi.org/10.1007/bf00115894openalex-snapshot
Acquiring recursive and iterative concepts with explanation-based learning
inferred← citeshttps://doi.org/10.1007/bf01070244openalex-snapshot
Inductive synthesis of programs: State of the art, problems, prospects
inferred← citeshttps://doi.org/10.1007/bf01101651openalex-snapshot
Semantics of algorithmic languages
inferred← citeshttps://doi.org/10.1007/bf03037096openalex-snapshot
Synthesis of rewrite programs by higher-order and semantic unification
inferred← citeshttps://doi.org/10.1007/s13218-010-0071-xopenalex-snapshot
A Combined Analytical and Search-Based Approach for the Inductive Synthesis of Functional Programs
inferred← citeshttps://doi.org/10.1016/0304-3975(86)90029-0openalex-snapshot
Generalized regular expressions—A language for synthesis of programs with branching in loops
inferred← citeshttps://doi.org/10.1016/b978-0-08-050930-3.50019-1openalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1016/b978-0-08-051054-5.50021-2openalex-snapshot
COMPREHENSIVE BIBLIOGRAPHY OF MACHINE LEARNING
inferred← citeshttps://doi.org/10.1016/b978-0-08-051055-2.50018-3openalex-snapshot
ACQUIRING GENERAL ITERATIVE CONCEPTS BY REFORMULATING EXPLANATIONS OF OBSERVED EXAMPLES
inferred← citeshttps://doi.org/10.1016/b978-0-273-08817-2.50014-5openalex-snapshot
References
inferred← citeshttps://doi.org/10.1023/a:1022659708512openalex-snapshot
Acquiring Recursive and Iterative Concepts with Explanation-Based Learning
inferred← citeshttps://doi.org/10.1145/1411829.1411835openalex-snapshot
Mechanical construction of a new efficient FLATTEN
inferred← citeshttps://doi.org/10.1145/24039.24071openalex-snapshot
A methodology for synthesis of recursive functional programs
inferred← citeshttps://doi.org/10.1145/3136040.3136058openalex-snapshot
Parser generation by example for legacy pattern languages
inferred← citeshttps://doi.org/10.1145/3170492.3136058openalex-snapshot
Parser generation by example for legacy pattern languages
inferred← citeshttps://doi.org/10.1145/356914.356918openalex-snapshot
Inductive Inference: Theory and Methods
inferred← citeshttps://doi.org/10.1145/357162.357171openalex-snapshot
Some Techniques for Recursion Removal from Recursive Functions
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.