A. Pardo. Towards merging recursion and comonads. In Proceedings of the 2nd Workshop on Generic Programming, WGP'00, pages 50--68, Ponte de Lima, Portugal, 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) Self-citation (Pardo) (Correct)
....induction (see e.g. 18, 30] In this paper, we present a definition of accumulations that works uniformly for any inductive type. The kind of accumulations we have in mind are those that pass information down to the recursive calls. This paper follows up on an initial proposal presented in [28]. A drawback of the version of accumulation given in [28] is that it is too specific in the form it defines the modification 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 ....
....a definition of accumulations that works uniformly for any inductive type. The kind of accumulations we have in mind are those that pass information down to the recursive calls. This paper follows up on an initial proposal presented in [28] A drawback of the version of accumulation given in [28] is that it is too specific in the form it defines the modification 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 ....
[Article contains additional citation context not shown here]
A. Pardo. Towards Merging Recursion and Comonads. In Workshop on Generic Programming, Ponte de Lima, Portugal, July 2000. Technical Report UU-CS-2000-19, Utrecht University.
Comonadic Iteration (Abstract) - Uustalu, Vene, Pardo (2000) Self-citation (Pardo) (Correct)
....recursion schemes is that of the state in context comonad. In the paper, we illustrate the theory by a Haskell implementation of the combinators and usage examples discussed. Comonadic iteration in the sense of this paper is not the only possible combination of iteration and comonads. Pardo [4] discusses a di#erent merger. He proposes a combinator that takes morphisms # : N F C#C to morphisms cfold N,# F (#) N F #C. This requires F and N to be related by a natural transformation # : N F #F N . In the case of the product comonad, the combinator gives him to forms of iteration ....
A Pardo. Towards merging recursion and comonads. In J Jeuring, ed, Proceedings 2nd Workshop on Generic Programming, WGP'
Recursion Schemes from Comonads - Uustalu, Vene, Pardo (2001) (3 citations) Self-citation (Pardo) (Correct)
....not new. Fokkinga [1994] and Meijer and Jeuring [1995] studied a combination of monads with catamorphisms, termed monadic catamorphisms. Given a monad M with a distributive law of F over M , their scheme takes a monadic step function : FA MA and produces a monadic induced function f : F MA. Pardo [2000], dualizing a combination of monads with anamorphisms developed by him in [2001] investigated a combination of comonads with catamorphisms using a comonad N with a distributive RECURSION SCHEMES FROM COMONADS 23 law of N over F . His scheme takes comonadic step functions : NFA A to comonadic ....
....to be simpler than formulations in the conventional style, there is hope that the constructions of the present paper, especially those related to distributivity, may admit a smoother restatement in the Mendler style. And nally, since the recursion scheme considered here and the comonadic folds of Pardo [2000] use distributive laws in opposite directions and also correspond to complementary dimensions along which iteration may be strengthened, it ought to be worthwhile to carry out a detailed comparison of the two approaches and see if these can be combined. 24 T. UUSTALU, V. VENE, A. PARDO ....
Pardo, A. 2000. Towards Merging Recursion and Comonads. In Proceedings 2nd Workshop on Generic Programming, WGP'00 (Ponte de Lima, July 2000), Jeuring, J., Editor, Tech. Report UU-CS-2000-19, Dept. of Computer Science, Utrecht Univ., 50-68.
Comonadic Iteration (Abstract) - Uustalu, Vene, Pardo (2000) Self-citation (Pardo) (Correct)
....recursion schemes is that of the state in context comonad. In the paper, we illustrate the theory by a Haskell implementation of the combinators and usage examples discussed. Comonadic iteration in the sense of this paper is not the only possible combination of iteration and comonads. Pardo [4] discusses a different merger. He proposes a combinator that takes morphisms OE : N F C C to morphisms cfold N; F (OE) N F C. This requires F and N to be related by a natural transformation : N F F N . In the case of the product comonad, the combinator gives him to forms of iteration with ....
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.
A Modal Calculus for Effect Handling - Nanevski (2003) (1 citation) (Correct)
No context found.
A. Pardo. Towards merging recursion and comonads. In Proceedings of the 2nd Workshop on Generic Programming, WGP'00, pages 50--68, Ponte de Lima, Portugal, 2000.
Recursion Patterns as Hylomorphisms - Cunha (2003) (Correct)
No context found.
Alberto Pardo. Towards merging recursion and comonads. In Johan Jeuring, editor, Proceedings of the 2nd Workshop on Generic Programming, pages 50-- 68, Ponte de Lima, Portugal, 2000. Department of Computer Science, Utrecht University. Technical Report UU-CS-2000-19.
On Generalised Coinduction and Probabilistic Specification.. - Bartels (2004) (3 citations) (Correct)
No context found.
Alberto Pardo. Towards merging recursion and comonads. In Johan Jeuring, editor, Proc. WGP'2000, Tech. Report UU-CS-2000-19, pages 50--68. Utrecht Univ., June 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