Constraint-Based Type-Directed Program Synthesis
Peter-Michael Osera
TL;DR
This paper introduces a constraint-based approach to type-directed program synthesis, enhancing the synthesis of polymorphic code and handling advanced features like GADTs, demonstrated through a Haskell tool called Scythe.
Contribution
It presents a novel constraint-based method for type inference in program synthesis, specifically addressing polymorphism and GADTs, with an implementation in a live Haskell programming environment.
Findings
Improved synthesis efficiency for polymorphic code
Effective handling of GADTs in type inference
Initial positive experience with the Scythe tool
Abstract
We explore an approach to type-directed program synthesis rooted in constraint-based type inference techniques. By doing this, we aim to more efficiently synthesize polymorphic code while also tackling advanced typing features such as GADTs that build upon polymorphism. Along the way, we also present an implementation of these techniques in Scythe, a prototype live, type-directed programming tool for the Haskell programming language and reflect on our initial experience with the tool.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.