Augmenting Type Signatures for Program Synthesis

07/12/2019
by   Bruce Collie, et al.
0

Effective program synthesis requires a way to minimise the number of candidate programs being searched. A type signature, for example, places some small restrictions on the structure of potential candidates. We introduce and motivate a distilled program synthesis problem where a type signature is the only machine-readable information available, but does not sufficiently minimise the search space. To address this, we develop a system of property relations that can be used to flexibly encode and query information that was not previously available to the synthesiser. Our experience using these tools has been positive: by encoding simple properties and by using a minimal set of synthesis primitives, we have been able to synthesise complex programs in novel contexts

READ FULL TEXT

page 1

page 2

page 3

research
02/13/2020

Learning to Represent Programs with Property Signatures

We introduce the notion of property signatures, a representation for pro...
research
06/22/2020

Information-theoretic User Interaction: Significant Inputs for Program Synthesis

Programming-by-example technologies are being deployed in industrial pro...
research
08/14/2023

Modular System Synthesis

This paper describes a way to improve the scalability of program synthes...
research
11/26/2021

Modular Information Flow through Ownership

Statically analyzing information flow, or how data influences other data...
research
02/18/2021

Refinement Type Directed Search for Meta-Interpretive-Learning of Higher-Order Logic Programs

The program synthesis problem within the Inductive Logic Programming (IL...
research
03/30/2021

Geometry of Program Synthesis

We re-evaluate universal computation based on the synthesis of Turing ma...
research
02/21/2018

Learning to Synthesize

In many scenarios we need to find the most likely program under a local ...

Please sign up or login with your details

Forgot password? Click here to reset