Call-by-need supercompilation

MC Bolingbroke - 2013 - cl.cam.ac.uk
This thesis shows how supercompilation, a powerful technique for transformation and
analysis of functional programs, can be effectively applied to a call-by-need language. Our …

Supercompiling Erlang

G WEINHOLT - 2013 - odr.chalmers.se
Erlang is a programming language with excellent support for parallel and distributed
programming. The functional programming paradigm with its higherorder functions is used …

[PDF][PDF] On the Termination of Higher-Order Positive Supercompilation

GW Hamilton - Proc. of the First International Workshop on …, 2013 - easychair.org
The verification of program transformation systems requires that we prove their termination.
For positive supercompilation, ensuring termination requires the memoisation of …

[PDF][PDF] Tailored Termination for Optimal Supercompilation

A Askar, B Delaware - cs.purdue.edu
Supercompilation is a simple, powerful program specialization technique, but it can face
issues with tractability and code bloat. In this paper, we examine how the choice of the …

[PDF][PDF] Local Driving in Higher-Order Positive Supercompilation via the Ω-theorem

GW Hamilton, MH Sørensen - easychair.org
A program transformation technique should terminate, return efficient output programs and
be efficient itself. These requirements are mutually conflicting, so a balance must be sought …

[PDF][PDF] 2 Program Optimization

PA Jonsson - 2011 - Citeseer
Two of the identified problems with performance of functional programming languages are
temporary intermediate structures that are used to pass data between functions, and higher …