A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2007; you can also visit the original URL.
The file type is `application/pdf`

.

## Filters

##
###
Self-Adjusting Computation
[chapter]

2004
*
Lecture Notes in Computer Science
*

This thesis investigates a model of

doi:10.1007/978-3-540-27836-8_1
fatcat:6tqe22fqhbejvna265jg7mddwa
*computation*, called*self*-*adjusting**computation*, where*computations**adjust*to any external change to their data (state) automatically. ... The techniques make writing*self*-*adjusting*programs nearly as easy as ordinary (non-*self*-*adjusting*) programs. ... A Library for*Self*-*Adjusting**Computation*We show that our techniques are practical by implementing*an*ML library to support*self*-*adjusting**computation*, implementing our list applications based on this ...##
###
Self-adjusting computation

2008
*
Proceedings of the 2009 ACM SIGPLAN workshop on Partial evaluation and program manipulation - PEPM '09
*

This thesis investigates a model of

doi:10.1145/1480945.1480946
dblp:conf/pepm/Acar09
fatcat:dkt7ohj7zffjhgojqgn3pl4lwq
*computation*, called*self*-*adjusting**computation*, where*computations**adjust*to any external change to their data (state) automatically. ... The techniques make writing*self*-*adjusting*programs nearly as easy as ordinary (non-*self*-*adjusting*) programs. ... A Library for*Self*-*Adjusting**Computation*We show that our techniques are practical by implementing*an*ML library to support*self*-*adjusting**computation*, implementing our list applications based on this ...##
###
Self-adjusting computation

2004
*
Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science, 2004.
*

This thesis investigates a model of

doi:10.1109/lics.2004.1319619
dblp:conf/lics/Harper04
fatcat:vvjwu4dq6nd7hpqgfhpk63pjrq
*computation*, called*self*-*adjusting**computation*, where*computations**adjust*to any external change to their data (state) automatically. ... The techniques make writing*self*-*adjusting*programs nearly as easy as ordinary (non-*self*-*adjusting*) programs. ... A Library for*Self*-*Adjusting**Computation*We show that our techniques are practical by implementing*an*ML library to support*self*-*adjusting**computation*, implementing our list applications based on this ...##
###
Imperative self-adjusting computation

2008
*
SIGPLAN notices
*

All previous work on

doi:10.1145/1328897.1328476
fatcat:af627tpl3vhmrhapxexzflorha
*self*-*adjusting**computation*, however, relied on a purely functional programming model. ... Recent work on*self*-*adjusting**computation*showed how to systematically write programs that respond efficiently to incremental changes in their inputs. ... Programming with "Mutable Modifiables" We give*an**overview*of our framework based on our ML library and a*self*-*adjusting*version of depth-first-search trees on graphs. The ML library. ...##
###
Imperative self-adjusting computation

2008
*
Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '08
*

All previous work on

doi:10.1145/1328438.1328476
dblp:conf/popl/AcarAB08
fatcat:c75hhva3cvdp3d5yp6xx3guxti
*self*-*adjusting**computation*, however, relied on a purely functional programming model. ... Recent work on*self*-*adjusting**computation*showed how to systematically write programs that respond efficiently to incremental changes in their inputs. ... Programming with "Mutable Modifiables" We give*an**overview*of our framework based on our ML library and a*self*-*adjusting*version of depth-first-search trees on graphs. The ML library. ...##
###
Non-monotonic Self-Adjusting Computation
[chapter]

2012
*
Lecture Notes in Computer Science
*

*Self*-

*adjusting*

*computation*is a language-based approach to writing programs that respond dynamically to input changes by maintaining a trace of the

*computation*consistent with the input, thus also updating ... For monotonic programs, i.e. where localized input changes cause localized changes in the

*computation*, the trace can be repaired efficiently by insertions and deletions. ...

*Overview*We illustrate how non-local input changes can cause

*computation*reordering with a pure,

*self*-

*adjusting*map program on lists: Ø ØÝÔ 'a cell = nil | :: Ó 'a * 'a list Û Ø ØÝÔ 'a list = 'a cell ref ...

##
###
Self-adjusting Computation with Delta ML
[chapter]

2009
*
Lecture Notes in Computer Science
*

In

doi:10.1007/978-3-642-04652-0_1
fatcat:4kkfaztuyjaktgtpzi6sbxbvii
*self*-*adjusting**computation*, programs respond automatically and efficiently to modifications to their data by tracking the dynamic data dependencies of the*computation*and incrementally updating the ... In this tutorial, we describe the*self*-adjustingcomputation model and present the language SaSML (*Self*-*Adjusting*SML) for writing*self*-*adjusting*programs. ... The Programming Model:*An**Overview*In*self*-*adjusting**computation*programs are stratified into two components: a*self*-*adjusting*program (core) and a top-level mutator. ...##
###
Memory management for self-adjusting computation

2008
*
Proceedings of the 7th international symposium on Memory management - ISMM '08
*

our approach • Compare to previous SML framework Matthew Hammer Memory Management for

doi:10.1145/1375634.1375642
dblp:conf/iwmm/HammerA08
fatcat:6nozipm7frad3jkskutk37rmlm
*Self*-*Adjusting**Computation*2 / 42*Self*-*Adjusting**Computation*Motivation : Incremental change is pervasive. ...*Overview*of Talk • Previous frameworks written in SML • We implement a framework for C In this talk, we • Briefly review*self*-*adjusting**computation*• Discuss memory management issues • Introduce and evaluate ... • The input is stored in a modref • We have to read it to see a list cell • We are given*an*empty modref to write the output Matthew Hammer Memory Management for*Self*-*Adjusting**Computation*...##
###
Kinetic Algorithms Via Self-adjusting Computation
[chapter]

2006
*
Lecture Notes in Computer Science
*

Define a static algorithm as

doi:10.1007/11841036_57
fatcat:yl67u273mndvllpqukydqtee2a
*an*algorithm that*computes*some combinatorial property of its input consisting of static, i.e., non-moving, objects. ... In this paper, we describe a technique for syntactically transforming static algorithms into kinetic algorithms, which*compute*properties of moving objects. ... The*self*-*adjusting*-*computation*library is described elsewhere [3, 2] . ...##
###
Streaming big data with self-adjusting computation

2013
*
Proceedings of the 2013 workshop on Data driven functional programming - DDFP '13
*

In this paper, we propose

doi:10.1145/2429376.2429382
dblp:conf/popl/AcarC12
fatcat:bfufhf354zchjaalfnfoym6wk4
*an*approach based on*self*-*adjusting**computation*that can dramatically improve the efficiency of such*computations*. ... As*an*example, we can perform the aforementioned streaming*computation*in just a couple of minutes. ...*Self*-*Adjusting**Computation**Overview*. ...##
###
Autonomic Computing: An Overview
[chapter]

2005
*
Lecture Notes in Computer Science
*

This paper presents

doi:10.1007/11527800_20
fatcat:zafwpgs46newlitm3mcnetqbz4
*an*introduction to autonomic*computing*, its challenges, and opportunities. ... Introduction Advances in networking and*computing*technology and software tools have resulted in*an*explosive growth in networked applications and information services that cover all aspects of our life ... We then outline the key challenges of autonomic*computing*and present*an**overview*of existing autonomic*computing*systems and applications. ...##
###
Traceable data types for self-adjusting computation

2010
*
SIGPLAN notices
*

*Self*-

*adjusting*

*computation*provides

*an*evaluation model where

*computations*can respond automatically to modifications to their data by using a mechanism for propagating modifications through the

*computation*... Current approaches to

*self*-

*adjusting*

*computation*guarantee correctness by recording dependencies in a trace at the granularity of individual memory operations. ...

*Self*-

*Adjusting*

*Computation*.

*Self*-

*adjusting*

*computation*combines dynamic dependence graphs [2] and a form of

*computation*memoization [5] to achieve efficient updates. ...

##
###
Traceable data types for self-adjusting computation

2010
*
Proceedings of the 2010 ACM SIGPLAN conference on Programming language design and implementation - PLDI '10
*

*Self*-

*adjusting*

*computation*provides

*an*evaluation model where

*computations*can respond automatically to modifications to their data by using a mechanism for propagating modifications through the

*computation*... Current approaches to

*self*-

*adjusting*

*computation*guarantee correctness by recording dependencies in a trace at the granularity of individual memory operations. ...

*Self*-

*Adjusting*

*Computation*.

*Self*-

*adjusting*

*computation*combines dynamic dependence graphs [2] and a form of

*computation*memoization [5] to achieve efficient updates. ...

##
###
An experimental analysis of self-adjusting computation

2009
*
ACM Transactions on Programming Languages and Systems
*

We refer to this approach as

doi:10.1145/1596527.1596530
fatcat:vmcusq2xdfb77mwxn5zimf52d4
*self*-*adjusting**computation*. ... We show that the proposed approach is realistic by describing a library for*self*-*adjusting**computation*, presenting efficient algorithms for realizing the library, and describing and evaluating*an*implementation ... memoization (Section 2 presents*an**overview*). ...##
###
An experimental analysis of self-adjusting computation

2006
*
SIGPLAN notices
*

We refer to this approach as

doi:10.1145/1133255.1133993
fatcat:2nn4zxjjmrgjbgdl4ge73vhfgm
*self*-*adjusting**computation*. ... We show that the proposed approach is realistic by describing a library for*self*-*adjusting**computation*, presenting efficient algorithms for realizing the library, and describing and evaluating*an*implementation ... memoization (Section 2 presents*an**overview*). ...
« Previous

*Showing results 1 — 15 out of 236,500 results*