Example-directed synthesis: a type-theoretic interpretation
From MaRDI portal
Publication:2828323
DOI10.1145/2837614.2837629zbMATH Open1347.68049OpenAlexW2263738566MaRDI QIDQ2828323FDOQ2828323
Authors: Jonathan Frankle, Peter-Michael Osera, David Walker, Steve Zdancewic 
Publication date: 24 October 2016
Published in: Proceedings of the 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2837614.2837629
Recommendations
Cited In (13)
- Learning higher-order logic programs
- Deductive synthesis of programs with pointers: techniques, challenges, opportunities (invited paper)
- Counterexample-guided partial bounding for recursive function synthesis
- Programming by example and proving by example using higher-order unification
- Resourceful program synthesis from graded linear types
- Concise read-only specifications for better synthesis of programs with pointers
- Synthesis with abstract examples
- Synthesizing imperative programs from examples guided by static analysis
- Partial bounding for recursive function synthesis
- Abstraction-based interaction model for synthesis
- Type inference for rank-2 intersection types using set unification
- Automatic synthesis of data-flow analyzers
- Structural rules and algebraic properties of intersection types
Uses Software
This page was built for publication: Example-directed synthesis: a type-theoretic interpretation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2828323)
