Constraint-Based Type-Directed Program Synthesis

07/06/2019
by   Peter-Michael Osera, et al.
0

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.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

11/01/2019

Program Synthesis with Live Bidirectional Evaluation

We present an algorithm for completing program sketches (partial program...
02/23/2021

A tier-based typed programming language characterizing Feasible Functionals

The class of Basic Feasible Functionals BFF_2 is the type-2 counterpart ...
04/16/2021

A Gradual Type System for Elixir

Elixir is a functional programming language with dynamic typing. We prop...
10/09/2017

Synthesizing Bijective Lenses

Bidirectional transformations between different data representations occ...
07/24/2019

Sketch-n-Sketch: Output-Directed Programming for SVG

For creative tasks, programmers face a choice: Use a GUI and sacrifice f...
10/26/2018

Synthesizing Symmetric Lenses

Lenses are programs that can be run both "front to back" and "back to fr...
09/10/2021

Solver-based Gradual Type Migration

Gradually typed languages allow programmers to mix statically and dynami...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.