Gibbons, J.: Calculating functional programs. In Backhouse, R.C., Crole, R.L., Gibbons, J., eds.: Revised Lectures from Int. Summer School and Wksh. on Algebraic and Coalgebraic Methods in the Mathematics of Program Construction. Vol. 2297 of Lect. Notes in Comput. Sci., Springer-Verlag, Berlin (2000) 149--202 Home/Search Document Details and Download
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. Calculating functional programs. In Roland Backhouse, Roy Crole, and Jeremy Gibbons, editors, Algebraic and Coalgebraic Methods in the Mathematics of Program Construction, volume 2297 of Lecture Notes in Computer Science, pages 148--203. Springer-Verlag, 2002.
Design Patterns as Higher-Order Datatype-Generic Programs - Gibbons (2006) Self-citation (Gibbons) (Correct)
No context found.
J. Gibbons. Calculating functional programs. In R. Backhouse, R. Crole, and J. Gibbons, editors, Algebraic and Coalgebraic Methods in the Mathematics of Program Construction, volume 2297 of Lecture Notes in Computer Science, pages 148--203. Springer-Verlag, 2002.
TypeCase: A Design Pattern for Type-Indexed Functions - Bruno Oliveira And (2005) (1 citation) Self-citation (Gibbons) (Correct)
No context found.
J. Gibbons. Calculating functional programs. In Algebraic and Coalgebraic Methods in the Mathematics of Program Construction, pages 149--202, 2000.
Streaming Representation-Changers - Gibbons (2004) Self-citation (Gibbons) (Correct)
No context found.
Jeremy Gibbons. Calculating functional programs. In Roland Backhouse, Roy Crole, and Jeremy Gibbons, editors, Algebraic and Coalgebraic Methods in the Mathematics of Program Construction, volume 2297 of Lecture Notes in Computer Science, pages 148--203. Springer-Verlag, 2002.
Metamorphisms: Streaming Representation-Changers - Gibbons (2005) Self-citation (Gibbons) (Correct)
No context found.
J. Gibbons, Calculating functional programs, in: R. Backhouse, R. Crole, J. Gibbons (Eds.), Algebraic and Coalgebraic Methods in the Mathematics of Program Construction, Vol. 2297 of Lecture Notes in Computer Science, Springer-Verlag, 2002, pp. 148--203.
Proof Methods for Corecursive Programs - Gibbons, Hutton (2005) (1 citation) Self-citation (Gibbons) (Correct)
No context found.
Gibbons, J.: Calculating Functional Programs, in: Algebraic and Coalgebraic Methods in the Mathematics of Program Construction, vol. 2297 of Lecture Notes in Computer Science, Springer-Verlag, January 2002, 148--203.
Streaming Representation-Changers - Gibbons (2004) Self-citation (Gibbons) (Correct)
No context found.
Jeremy Gibbons. Calculating functional programs. In Roland Backhouse, Roy Crole, and Jeremy Gibbons, editors, Algebraic and Coalgebraic Methods in the Mathematics of Program Construction, volume 2297 of Lecture Notes in Computer Science, pages 148--203. Springer-Verlag, 2002.
When is a Function a Fold Or an Unfold? - Gibbons, Hutton, Altenkirch (2001) Self-citation (Gibbons) (Correct)
....programs that consume values of a least fixpoint type such as finite lists. Dually, the recursion operator unfold encapsulates a common pattern for defining programs that produce values of a greatest fixpoint type such as streams (infinite lists) Theory and applications of fold abound see [11,4] for recent surveys while in recent years it has become increasingly clear that the less well known concept of unfold is just as useful [5,6,10,13,15] Given the interest in fold and unfold, it is natural to ask when a program can be written using one of these operators. Surprisingly little is ....
J. Gibbons. Calculating functional programs. In Summer School and Workshop on Algebraic and Coalgebraic Methods in the Mathematics of Program Construction, Oxford, April 2000.
When is a Function a Fold Or an Unfold? - Gibbons, Hutton, Altenkirch (2001) Self-citation (Gibbons) (Correct)
....programs that consume values of a least fixpoint type such as finite lists. Dually, the recursion operator unfold encapsulates a common pattern for defining programs that produce values of a greatest fixpoint type such as infinite lists or streams. Theory and applications of fold abound see [6, 2] for recent surveys while in recent years it has become increasingly clear that the less well known concept of unfold is just as useful [3, 4, 5, 7, 9] Given the interest in fold and unfold, it is natural to ask when a program can be written using one of these operators. Surprisingly little ....
J. Gibbons. Calculating functional programs. In Summer School and Workshop on Algebraic and Coalgebraic Methods in the Mathematics of Program Construction, Oxford, April 2000.
Recursion Schemes for Dynamic Programming - Kabanov, Vene (Correct)
No context found.
Gibbons, J.: Calculating functional programs. In Backhouse, R.C., Crole, R.L., Gibbons, J., eds.: Revised Lectures from Int. Summer School and Wksh. on Algebraic and Coalgebraic Methods in the Mathematics of Program Construction. Vol. 2297 of Lect. Notes in Comput. Sci., Springer-Verlag, Berlin (2000) 149--202
Streaming Algorithms (Extended Abstract) - Gibbons (Correct)
No context found.
Jeremy Gibbons. Calculating functional programs. In Roland Backhouse, Roy Crole, and Jeremy Gibbons, editors, Algebraic and Coalgebraic Methods in the Mathematics of Program Construction, volume 2297 of Lecture Notes in Computer Science, pages 148--203. Springer-Verlag, 2002.
Recursion Patterns as Hylomorphisms - Cunha (2003) (Correct)
No context found.
Jeremy Gibbons. Calculating functional programs. In R. Backhouse, R. Crole, and J. Gibbons, editors, Algebraic and Coalgebraic Methods in the Mathematics of Program Construction, volume 2297 of LNCS, chapter 5, pages 148--203. Springer-Verlag, 2002.
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