Abstract. Programs in functional programming languages with alge-braic datatypes are often datatype-centric and use folds or fold-like func-tions. Incrementalization of such a program can significantly improve its performance. Functional incrementalization separates the recursion from the calculation and significantly reduces redundant computation. In this paper, we motivate incrementalization with a simple example and present a library for transforming programs using upwards, down-wards, and circular incrementalization. We also give a datatype-generic implementation for the library and demonstrate the incremental zipper, a zipper extended with attributes.
A systematic approach isgiven for deriving incremental programs from non-incremental programs writte...
this paper we will essentially refer to these techniques as they have been developed in the fields o...
AbstractWe study one dimension in program evolution, namely the evolution of the datatype declaratio...
Abstract. Programs in languages such as Haskell are often datatype-centric and make extensive use of...
Incrementalization is at the core of a systematic program de-sign method, especially for the design ...
A systematic approach is given for deriving incremental programs from non-incremental programs writt...
One style of functional programming is based purely on recursive equations. Such equations are easy ...
AbstractThe paper presents a system, ADATE, for automatic functional programming. ADATE uses specifi...
The paper presents a system, ADATE, for automatic functional programming. ADATE uses speci cations t...
Incremental computation takes advantage of repeated computations on inputs that differ slightly fro...
AbstractA systematic approach is given for deriving incremental programs from non-incremental progra...
The difficulty of programming indicates the value of possible further reduction in the complexity of...
Incremental computations can improve the performance of interactive programs such as spreadsheet pro...
This paper presents a monadic approach to incremental computation, suitable for purely functional la...
These notes discuss the simultaneous use of generalised fold operators and monads to structure funct...
A systematic approach isgiven for deriving incremental programs from non-incremental programs writte...
this paper we will essentially refer to these techniques as they have been developed in the fields o...
AbstractWe study one dimension in program evolution, namely the evolution of the datatype declaratio...
Abstract. Programs in languages such as Haskell are often datatype-centric and make extensive use of...
Incrementalization is at the core of a systematic program de-sign method, especially for the design ...
A systematic approach is given for deriving incremental programs from non-incremental programs writt...
One style of functional programming is based purely on recursive equations. Such equations are easy ...
AbstractThe paper presents a system, ADATE, for automatic functional programming. ADATE uses specifi...
The paper presents a system, ADATE, for automatic functional programming. ADATE uses speci cations t...
Incremental computation takes advantage of repeated computations on inputs that differ slightly fro...
AbstractA systematic approach is given for deriving incremental programs from non-incremental progra...
The difficulty of programming indicates the value of possible further reduction in the complexity of...
Incremental computations can improve the performance of interactive programs such as spreadsheet pro...
This paper presents a monadic approach to incremental computation, suitable for purely functional la...
These notes discuss the simultaneous use of generalised fold operators and monads to structure funct...
A systematic approach isgiven for deriving incremental programs from non-incremental programs writte...
this paper we will essentially refer to these techniques as they have been developed in the fields o...
AbstractWe study one dimension in program evolution, namely the evolution of the datatype declaratio...