Jeremy Gibbons. Generic downwards accumulations. Science of Computer Programming, 37:37--65, 2000. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Generic Accumulations - Pardo (2002) (5 citations) (Correct)
....We present a generic definition of accumulations, achieved by the introduction of a new recursive operator on inductive types. We also show that the notion of downwards accumulation developed by Gibbons is subsumed by our notion of accumulation. 1 Introduction often called accumulators [20, 5, 15]. In functional programming, the notion of accumulation is usually associated with the so called accumulation technique [8, 4, 18, 3] which transforms recursive definitions by the introduction of additional arguments over which intermediate results are computed. The accumulation technique is ....
....of the acuumulating parameters. This problem has been eliminated in the version developed in this paper, which shows a higher degree of genericity in addition to being more elegant. Generic accumulations have already been the subject of study of other works in program calculation. Gibbons [15], for example, develops a generic definition of downwards accumulations, which are functions that label every node of a tree with a function of its ancestors. In this paper, we show that our notion of accumulation subsumes that of downwards accumulation. The remainder of the paper is organized as ....
[Article contains additional citation context not shown here]
J. Gibbons. Generic Downwards Accumulations. Science of Computer Programming, 37(1-- 3):37--65, 2000.
Towards Merging Recursion and Comonads - Pardo (2000) (3 citations) (Correct)
.... prune = pfold BA (T(alg s) That is, prune(empty; 0 prune(node(t; a; t 0 ) if a 2 then 0 else 1 count(t; count(t 0 ; 2 5 Accumulations Accumulations are functions that use an extra parameter to keep intermediate results to be used during the computation (see e.g. [4, 13, 14, 18]) In this section we build up a comonadic operator for a kind of downwards accumulations by adding some ingredients to the definition of pfold. For defining accumulations we can follow, essentially, the same two alternatives discussed before for functions with parameters. One is to define ....
J. Gibbons. Generic Downwards Accumulations. Science of Computer Programming, 37(1--3):37--65, 2000. 18
Streaming Representation-Changers - Gibbons (2004) Self-citation (Gibbons) (Correct)
No context found.
Jeremy Gibbons. Generic downwards accumulations. Science of Computer Programming, 37:37--65, 2000.
Metamorphisms: Streaming Representation-Changers - Gibbons (2005) Self-citation (Gibbons) (Correct)
No context found.
J. Gibbons, Generic downwards accumulations, Science of Computer Programming 37 (2000) 37--65.
Streaming Representation-Changers - Gibbons (2004) Self-citation (Gibbons) (Correct)
No context found.
Jeremy Gibbons. Generic downwards accumulations. Science of Computer Programming, 37:37--65, 2000.
Streaming Algorithms (Extended Abstract) - Gibbons (Correct)
No context found.
Jeremy Gibbons. Generic downwards accumulations. Science of Computer Programming, 37:37--65, 2000.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC