Synthesizing programs using example input/outputs is a classic problem in artificial
intelligence. We present a method for solving Programming By Example (PBE) problems by …

Building effective symbolic execution engines poses challenges in multiple dimensions: an
engine must correctly model the program semantics, provide flexibility in symbolic execution …

Macros provide a powerful means of extending languages. They have proven useful in both
general-purpose and domain-specific programming contexts. This paper presents an …

Students learning to program often need help completing assignments and understanding
why their code does not work as they expect it to. One common place where they seek such …

Given a tower of interpreters, ie, a sequence of multiple interpreters interpreting one another
as input programs, we aim to collapse this tower into a compiler that removes all interpretive …

Implementations of domain-specific languages should offer both extensibility and
performance optimizations. With the new syntax-spec metalanguage in Racket …

1 INTRODUCTION Verifying a solution for a problem is much easier than finding one—this
common wisdom can be confirmed by anyone who used both to learn and to teach. This …

We address the problem of transforming typed functional programs into relational form. In
this form, a program can be run in various “directions” with some arguments left free, making …

We present a completely declarative approach to synthesizing pattern matching construct
implementations based on application of relational programming, a specific form of …

We present a solver for Java generics type system implemented using relational verifier-to-
solver approach. The solver finds solutions for a system of subtyping inequations with free …