Abstract The GRACE International Meeting on Bidirectional Transformations was held in
December 2008 near Tokyo, Japan. The meeting brought together researchers and …

In this paper, we investigate the problem of semi-automated inversion of imperative
programs, which has the potential to make it much easier and less error prone to write …

In 1989 when functional programming was still considered a niche topic, Hughes wrote a
visionary paper arguing convincingly 'why functional programming matters'. More than two …

Divide-and-conquer is a common parallel programming skeleton supported by many cross-
platform multithreaded libraries, and most commonly used by programmers for …

We propose a fully automated method that takes as input an iterative or recursive reference
implementation and produces divide-and-conquer implementations that are functionally …

The generalizability of PBE solvers is the key to the empirical synthesis performance.
Despite the importance of generalizability, related studies on PBE solvers are still limited. In …

In this paper, we propose an automated approach to finding correct and efficient
memoization algorithms from a given declarative specification. This problem has two major …

We propose a methodology for automatic generation of divide-and-conquer parallel
implementations of sequential nested loops. We focus on a class of loops that traverse read …

Halide is a domain-specific language for fast image processing that separates pipelines into
the algorithm, which defines what values are computed, and the schedule, which defines …

Parallel programs on lists have been intensively studied. It is well known that associativity
provides a good characterization for divide-and-conquer parallel programs. In particular, the …