Program synthesis from polymorphic refinement types

Program synthesis from polymorphic refinement types

We present a method for synthesizing recursive functions that provably satisfy a given specification in the form of a polymorphic refinement type. We observe that such specifications are particularly suitable for program synthesis for two reasons. First, they offer a unique combination of expressive...

Full description

Bibliographic Details
Main Authors: Polikarpova, Nadezhda (Contributor), Kuraj, Ivan (Contributor), Solar Lezama, Armando (Contributor)
Other Authors: Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory (Contributor), Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science (Contributor)
Format: Article
Language:English
Published: Association for Computing Machinery, 2017-12-29T20:34:47Z.
Subjects:
Article
Online Access:Get fulltext

Internet

Get fulltext

Similar Items