Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Compiling Self-Adjusting Programs with Continuations Ruy Ley-Wild
 

Summary: Compiling Self-Adjusting Programs with Continuations
Ruy Ley-Wild
Carnegie Mellon University
rleywild@cs.cmu.edu
Matthew Fluet Umut A. Acar
Toyota Technological Institute at Chicago
{fluet,acar}@tti-c.org
Abstract
Self-adjusting programs respond automatically and efficiently to
input changes by tracking the dynamic data dependences of the
computation and incrementally updating the output as needed.
In order to identify data dependences, previously proposed ap-
proaches require the user to make use of a set of monadic primi-
tives. Rewriting an ordinary program into a self-adjusting program
with these primitives, however, can be difficult and error-prone due
to various monadic and proper-usage restrictions, some of which
cannot be enforced statically. Previous work therefore suggests that
self-adjusting computation would benefit from direct language and
compiler support.
In this paper, we propose a language-based technique for writ-

  

Source: Acar, Umut - Programming Languages and Systems Group, Max-Planck Institute for Software Systems

 

Collections: Computer Technologies and Information Sciences