(Enter summary)
Abstract: Comonads are mathematical structures that account naturally for effects that derive from the context
in which a program is executed. This paper reports ongoing work on the interaction between recursion
and comonads. Two applications are shown that naturally lead to versions of a comonadic fold
operator on the product comonad. Both versions capture functions that require extra arguments for
their computation and are related with the notion of strong datatype.
1 Introduction
One of the main ... (Update)
Similar documents based on text: More All
0.9: Recursion Schemes from Comonads - Uustalu, Vene, Pardo (2001)
(Correct)
0.5: Comonadic Iteration (Abstract) - Uustalu, Vene, Pardo (2000)
(Correct)
0.4: Generic Accumulations - Pardo (2002)
(Correct)
Related documents from co-citation: More All
5: recursion and course-of-value (context) - Uustalu, Vene et al. - 1999
3: Algebraic Data Types and Program Transformation (context) - Malcolm - 1990
3: Formal Aspects of Computing (context) - Meertens - 1992
BibTeX entry: (Update)
A Pardo. Towards merging recursion and comonads. In J Jeuring, ed, Proceedings 2nd Workshop on Generic Programming, WGP'2000, Ponte de Lima, Portugal, 6 July 2000, Tech Report UU-CS2000 -19, Dept of Computer Science, Utrecht Univ, pp 50--68. June 2000. http://citeseer.ist.psu.edu/pardo00towards.html More
@incollection{ pardo00towards,
author = "Alberto Pardo",
title = "Towards Merging Recursion and Comonads",
booktitle = "Proceedings 2nd Workshop on Generic Programming, {WGP}'2000, Ponte de Lima, Portugal, 6 July 2000",
editor = "Johan Jeuring",
pages = "50--68",
year = "2000",
url = "citeseer.ist.psu.edu/pardo00towards.html" }
Citations (may not include all citations):
369
Information and Computation (context) - Moggi, Computation - 1991
244
Imperative Functional Programming
- Peyton-Jones, Wadler - 1993
232
Category Theory for Computing Science (context) - Barr, Wells - 1990
210
Functional Programming with Bananas (context) - Meijer, Fokkinga et al. - 1991
124
Monads for functional programming
- Wadler - 1995
108
Introduction to Functional Programming using Haskell (context) - Bird - 1998
104
Algebra of Programming (context) - Bird, de Moor - 1997
101
Lazy functional state threads
- Jones, Launchbury - 1994
84
Law and Order in Algorithmics (context) - Fokkinga - 1992
81
The Promotion and Accumulation Strategies in Transformationa.. (context) - Bird - 1984
67
Towards a Mathematical Operational Semantics
- Turi, Plotkin - 1997
67
Formal Aspects of Computing (context) - Meertens - 1992
52
Algebraic Approaches to Program Semantics (context) - Manes, Arbib - 1986
52
Generic Programming - An Introduction (context) - Backhouse, Jansson et al. - 1999
48
Merging Monads and Folds for Functional Programming
- Meijer, Jeuring - 1995
35
Monadic maps and folds for arbitrary datatypes
- Fokkinga - 1994
30
Functorial Operational Semantics and its Denotational Dual (context) - Turi - 1996
25
The Under-Appreciated Unfold
- Gibbons, Jones - 1998
23
Upwards and Downwards Accumulations on Trees (context) - Gibbons - 1993
18
Technical Report (context) - Cockett, Fukushima - 1992
14
Fold and Unfold for Program Semantics
- Hutton - 1998
14
Strong Categorical Datatypes
- Cockett, Spencer - 1991
13
Mathematical Structures in Computer Science (context) - Cockett, Distributive - 1993
7
Lifting Theorems for Kleisli Categories (context) - Mulry - 1993
7
Promotional Transformation of Monadic Programs
- Hu, Iwasaki - 1995
6
Generic Downwards Accumulations
- Gibbons - 2000
5
Technical Report METR (context) - Hu, Iwasaki et al. - 1996
5
Technical Report CMU-CS (context) - Brookes, Van Stone et al. - 1993
5
Technical Report CMU-CS (context) - Brookes, Geva et al. - 1991
4
Lecture Notes on Algebraic and Coalgebraic Methods for Calcu.. (context) - Gibbons - 2000
4
Data Types in Distributive Categories (context) - Walters - 1989
3
A Calculational Approach to Strong Datatypes
- Pardo - 1997
2
Fusion of Recursive Programs with Computational Effects
- Pardo - 2000
1
Available from http://www (context) - Kieburtz, Comonads et al.
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.uu.nl/~johanj/wgp2000/wgp2000cfp.html): More
Memo Functions, Polytypically! - Hinze (2000)
(Correct)
Language Independent Traversals for Program Transformation - Visser (2000)
(Correct)
A Framework for Polytypic Programming on Terms, With an.. - Jansson, Jeuring (2000)
(Correct)
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