Jeremy Gibbons. Origami programming. In Jeremy Gibbons and Oege de Moor, editors, The Fun of Programming, Cornerstones in Computing, pages 41--60. Palgrave, 2003. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Fission for Program Comprehension - Jeremy Gibbons Oxford Self-citation (Gibbons) (Correct)
No context found.
Jeremy Gibbons. Origami programming. In Jeremy Gibbons and Oege de Moor, editors, The Fun of Programming, Cornerstones in Computing, pages 41--60. Palgrave, 2003.
Design Patterns as Higher-Order Datatype-Generic Programs - Gibbons (2006) Self-citation (Gibbons) (Correct)
No context found.
J. Gibbons. Origami programming. In J. Gibbons and O. de Moor, editors, The Fun of Programming, Cornerstones in Computing, pages 41--60. Palgrave, 2003.
Streaming Representation-Changers - Gibbons (2004) Self-citation (Gibbons) (Correct)
No context found.
Jeremy Gibbons. Origami programming. In Jeremy Gibbons and Oege de Moor, editors, The Fun of Programming, Cornerstones in Computing. Palgrave, 2003.
Metamorphisms: Streaming Representation-Changers - Gibbons (2005) Self-citation (Gibbons) (Correct)
No context found.
J. Gibbons, Origami programming, in: J. Gibbons, O. de Moor (Eds.), The Fun of Programming, Cornerstones in Computing, Palgrave, 2003, pp. 41--60.
Patterns in Datatype-Generic Programming - Gibbons (2003) (1 citation) Self-citation (Gibbons) (Correct)
No context found.
Jeremy Gibbons. Origami programming. In Jeremy Gibbons and Oege de Moor, editors, The Fun of Programming. Palgrave, 2003.
Streaming Representation-Changers - Gibbons (2004) Self-citation (Gibbons) (Correct)
No context found.
Jeremy Gibbons. Origami programming. In Jeremy Gibbons and Oege de Moor, editors, The Fun of Programming, Cornerstones in Computing. Palgrave, 2003.
Arithmetic Coding with Folds and Unfolds - Bird, Gibbons (2003) (6 citations) Self-citation (Gibbons) (Correct)
....Nevertheless, our aim in these lectures is to provide a formal derivation of basic algorithms for coding and decoding. Our development of arithmetic coding makes heavy use of the algebraic laws of folds and unfolds. Although much of the general theory of folds and unfolds is well known, see [3, 6], we will need one or two novel results. One concerns a new pattern of computation, which we call streaming. In streaming, elements of an output list are produced as soon as they are determined. This may sound like lazy evaluation but it is actually quite di#erent. 2 Arithmetic coding, ....
J. Gibbons. Origami programming. In The Fun of Programming,J.Gibbonsand O. de Moor, eds, Palgrave, 2003.
Streaming Algorithms (Extended Abstract) - Gibbons (Correct)
No context found.
Jeremy Gibbons. Origami programming. In Jeremy Gibbons and Oege de Moor, editors, The Fun of Programming, Cornerstones in Computing. Palgrave, 2003.
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