On the public citation graph
Trace-Guided Inductive Synthesis of Recursive Functional Programs
0 signed · 59 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/3-540-58085-9_72openalex-snapshot
Infinite objects in type theory
inferredcites →https://doi.org/10.1007/978-3-030-25540-4_17openalex-snapshot
Overfitting in Synthesis: Theory and Practice
inferredcites →https://doi.org/10.1007/978-3-030-81685-8_39openalex-snapshot
Counterexample-Guided Partial Bounding for Recursive Function Synthesis
inferredcites →https://doi.org/10.1007/978-3-319-21668-3_10openalex-snapshot
Synthesis Through Unification
inferredcites →https://doi.org/10.1007/978-3-642-39799-8_67openalex-snapshot
Recursive Program Synthesis
inferredcites →https://doi.org/10.1007/978-3-662-54577-5_18openalex-snapshot
Scaling Enumerative Program Synthesis via Divide and Conquer
inferredcites →https://doi.org/10.1016/0004-3702(82)90040-6openalex-snapshot
Generalization as search
inferredcites →https://doi.org/10.1023/a:1025671410623openalex-snapshot
Programming by Demonstration Using Version Space Algebra
inferredcites →https://doi.org/10.1145/1706299.1706339openalex-snapshot
Programming with angelic nondeterminism
inferredcites →https://doi.org/10.1145/1706356.1706364openalex-snapshot
IGOR2 - an analytical inductive functional programming system
inferredcites →https://doi.org/10.1145/1806596.1806632openalex-snapshot
Complete functional synthesis
inferredcites →https://doi.org/10.1145/1926385.1926423openalex-snapshot
Automating string processing in spreadsheets using input-output examples
inferredcites →https://doi.org/10.1145/2509136.2509555openalex-snapshot
Synthesis modulo recursive functions
inferredcites →https://doi.org/10.1145/2737924.2737952openalex-snapshot
FlashRelate: extracting relational data from semi-structured spreadsheets using examples
inferredcites →https://doi.org/10.1145/2737924.2737977openalex-snapshot
Synthesizing data structure transformations from input-output examples
inferredcites →https://doi.org/10.1145/2737924.2738007openalex-snapshot
Type-and-example-directed program synthesis
inferredcites →https://doi.org/10.1145/2814270.2814310openalex-snapshot
FlashMeta: a framework for inductive program synthesis
inferredcites →https://doi.org/10.1145/2837614.2837666openalex-snapshot
Optimizing synthesis with metasketches
inferredcites →https://doi.org/10.1145/2908080.2908093openalex-snapshot
Program synthesis from polymorphic refinement types
inferredcites →https://doi.org/10.1145/2980983.2908103openalex-snapshot
Programmatic and direct manipulation, together at last
inferredcites →https://doi.org/10.1145/2983990.2984030openalex-snapshot
FIDEX: filtering spreadsheet data using examples
inferredcites →https://doi.org/10.1145/3133886openalex-snapshot
Synthesis of data completion scripts using finite tree automata
inferredcites →https://doi.org/10.1145/3158151openalex-snapshot
Program synthesis using abstraction refinement
inferredcites →https://doi.org/10.1145/321992.322002openalex-snapshot
A Methodology for LISP Program Construction from Examples
inferredcites →https://doi.org/10.1145/322217.322228openalex-snapshot
Variations on the Common Subexpression Problem
inferredcites →https://doi.org/10.1145/3290327openalex-snapshot
Live functional programming with typed holes
inferredcites →https://doi.org/10.1145/3290386openalex-snapshot
FrAngel: component-based synthesis with control structures
inferredcites →https://doi.org/10.1145/3408991openalex-snapshot
Program sketching with live bidirectional evaluation
inferredcites →https://doi.org/10.1145/3428295openalex-snapshot
Just-in-time learning for bottom-up enumerative synthesis
inferredcites →https://doi.org/10.1145/3434335openalex-snapshot
Combining the top-down propagation and bottom-up enumeration for inductive program synthesis
inferredcites →https://doi.org/10.1145/3485544openalex-snapshot
Generalizable synthesis through unification
inferredcites →https://doi.org/10.1145/3498682openalex-snapshot
Bottom-up synthesis of recursive functional programs using angelic execution
inferredcites →https://doi.org/10.1145/3519939.3523726openalex-snapshot
Recursion synthesis with unrealizability witnesses
inferredcites →https://doi.org/10.1145/3571263openalex-snapshot
Inductive Synthesis of Structurally Recursive Functional Programs from Non-recursive Expressions
inferredcites →https://doi.org/10.24963/ijcai.2017/227openalex-snapshot
Learning to Learn Programs from Examples: Going Beyond Program Structure
inferredcites →https://doi.org/10.5281/zenodo.7713149openalex-snapshot
Artifact for "Trace-Guided Inductive Synthesis of Recursive Functional Programs"
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-031-57262-3_4openalex-snapshot
Program Synthesis from Graded Types
inferred← citeshttps://doi.org/10.1007/978-3-031-65633-0_3openalex-snapshot
Relational Synthesis of Recursive Programs via Constraint Annotated Tree Automata
inferred← citeshttps://doi.org/10.1007/978-3-031-99751-8_15openalex-snapshot
Synthesizing Accumulative Functions Via Program Transformation
inferred← citeshttps://doi.org/10.1007/978-3-032-22723-2_13openalex-snapshot
Dependently-Typed AARA: A Non-Affine Approach for Resource Analysis of Higher-Order Programs
inferred← citeshttps://doi.org/10.1017/s0956796825100063openalex-snapshot
Inductive synthesis of structurally recursive functional programs from non-recursive expressions
inferred← citeshttps://doi.org/10.1145/3648440openalex-snapshot
Decomposition-based Synthesis for Applying Divide-and-Conquer-like Algorithmic Paradigms
inferred← citeshttps://doi.org/10.1145/3656381openalex-snapshot
Recursive Program Synthesis using Paramorphisms
inferred← citeshttps://doi.org/10.1145/3656418openalex-snapshot
From Batch to Stream: Automatic Generation of Online Algorithms
inferred← citeshttps://doi.org/10.1145/3656453openalex-snapshot
Equivalence by Canonicalization for Synthesis-Backed Refactoring
inferred← citeshttps://doi.org/10.1145/3689789openalex-snapshot
Control-Flow Deobfuscation using Trace-Informed Compositional Program Synthesis
inferred← citeshttps://doi.org/10.1145/3744916.3787779openalex-snapshot
Distance-Guided Search in Program Synthesis with Imperfect LLM Solutions
inferred← citeshttps://doi.org/10.1145/3759429.3762619openalex-snapshot
ScooPy: Enhancing Program Synthesis with Nested Example Specifications
inferred← citeshttps://doi.org/10.1145/3763158openalex-snapshot
We’ve Got You Covered: Type-Guided Repair of Incomplete Input Generators
inferred← citeshttps://doi.org/10.1145/3772318.3791327openalex-snapshot
Programming By Scaffolded Demonstration with Perpend
inferred← citeshttps://doi.org/10.1145/3814885.3816413openalex-snapshot
Synthesizing Recursive Functional Programs via Structure-Element Separation
inferred← citeshttps://doi.org/10.3390/info16050401openalex-snapshot
Review and Mapping of Search-Based Approaches for Program Synthesis
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.