Z. Hu and H. Iwasaki. Promotional Transformation of Monadic Programs. In Fuji International Workshop on Functional and Logic Programming, pages 196--210. World Scientific, July 1995. Also available from http://www.ipl.t.u-tokyo.ac.jp/~hu/.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....programming [39,40,3] Following that approach, L. Duponcheel proposed the combined use of folds or catamorphisms with modular monadic semantics [9] allowing the independent specification of the abstract syntax, the computational monad and the domain value. Monadic catamorphisms were studied in [11,19] and applied to practical functional programming in [41] Inspired by that work, we applied monadic folds [30,31,32] to modular monadic semantics, allowing the separation between recursive evaluation and semantic specification in some special cases. The paper is structured as follows: in section ....

....Now, a new evaluator for expressions is automatically obtained by means of a catamorphism over the (T # F) algebra. eval Expr : T # F) # M Int eval Expr = eval (T#F) # T # # F ] 7 Labra et al. The theory of catamorphisms can be extended to monadic catamorphisms as described in [11,19,30,32]. Given a monad M, we define a monadic function f : # # M #. For some combinations of monads and functors F, we define the monadic extension of a functor F m declaring the function map m F : # # M #) # (F # # M (F #) In the same way, we can define monadic F algebras as # F : F # # ....

Z. Hu and H. Iwasaki. Promotional transformation of monadic programs. In Workshop on Functional and Logic Programming, Susono, Japan, 1995. World Scientific.

....programs. Functional programs can also be structured according to the effects they produce. This can be possibe by using monads [33] as structuring device. Monads are well known mathematical structures with wide application in programming [30, 20] and formal semantics [26, 31, 32] Previous works [12, 17, 25, 28] have studied how to combine both structuring mechanisms, giving rise to recursive operators that deal with effects modeled by monads. A result that can be concluded from those works is that encapsulating effects with monads leads to a smooth framework for reasoning about programs with effects. In ....

Z. Hu and H. Iwasaki. Promotional Transformation of Monadic Programs. In Fuji International Workshop on Functional and Logic Programming, pages 196--210. World Scientific, July 1995.

....by this fact, in the present paper we address the definition of recursive operators that permit to represent programs with monadic effects. The main goal is then the derivation of fusion laws for such operators, since they provide cases of deforestation for that kind of programs. Recent works [8, 12, 26] have investigated the interaction between monads and recursion for the specific case of programs that consume a data structure. The interaction in that case is captured by an operator called monadic fold a version of the standard fold operator [23, 4] which represents programs with effects ....

....acts on elements of the Kleisli category. We call such a construction a monadic extension of F . In the particular case that F is a regular functor, we see that a monadic extension b F can be defined by induction on the structure of F . Analogous definitions to the given here can be found in [8, 12, 36]) We present also the main properties that monadic extensions satisfy (see [32] for further details) The usefulness of monadic extensions will become clear in Section 5, when we address the definition of recursive operators that represent functions with effects. There, we will see that some ....

[Article contains additional citation context not shown here]

Z. Hu and H. Iwasaki. Promotional Transformation of Monadic Programs. In Fuji International Workshop on Functional and Logic Programming, pages 196--210. World Scientific, July 1995. Available from http://www.ipl.t.u-tokyo.ac.jp/~hu/.

....Generic Programming, Marstrand, Sweden, June 1998. This work was developed while at Department of Computer Science, Darmstadt University of Technology, Darmstadt, Germany. y Web page: http: www.fing.edu.uy pardo deforestation techniques for pure programs. In this sense, some recent works [4, 5, 13] have focused on the study of the combination between fold computations and monads, introducing a functional called monadic catamorphism. The starting point of our research has been the study of the dual case, i.e. the combination of corecursion with monads. We refer to the arising notion as ....

....formal manipulation. For this reason we will keep both notations for bind , using each one where it better suits. 3 Monadic Anamorphism One way of approaching to monadic anamorphism is by dualizing the recursion scheme that characterizes monadic catamorphism as defined by Fokkinga and others [4, 5]. However, we opted to directly introduce this concept by means of an intuitive explanation of its behavior. A first approximation to the notion of monadic anamorphism can be got by considering the usual corecursion scheme captured by the diagram: A f G GA g Gf G G 6 in G but ....

Z. Hu and H. Iwasaki. Promotional Transformation of Monadic Programs. In Fuji International Workshop on Functional and Logic Programming, pages 196--210. World Scientific, July 1995. Available from http://www.ipl.t.u-tokyo.ac.jp/~hu/.

....for program transformation, mainly when they involve recursion. In fact, there may be intermediate data structures generated by monadic recursive processes which are impossible to be systematically eliminated by existing deforestation techniques for pure programs. In this sense, recent works [5,7,19] have focused on the study of fold computations combined with monads, introducing a functional called monadic catamorphism. The purpose of this paper is to investigate the dual case, i.e. the combination of corecursion with monads. We will refer to the arising notion as monadic corecursion. It ....

....Monadic Corecursion In this section we elaborate the notion of monadic corecursion and introduce a recursive functional that behaves accordingly, called monadic anamorphism. One way of approaching to monadic anamorphism is by dualizing the recursion scheme that characterizes monadic catamorphism [5,7]. However, we have opted to give instead a direct introduction to this concept by means of an intuitive explanation of its behavior. A first approximation to the notion of monadic corecursion can be got by Pardo considering the usual corecursion scheme captured by the diagram: A f G GA g ....

[Article contains additional citation context not shown here]

Z. Hu and H. Iwasaki. Promotional Transformation of Monadic Programs. In Fuji International Workshop on Functional and Logic Programming, pages 196--210. World Scientific, July 1995. Also available from http://www.ipl.t.u-tokyo.ac.jp/~hu/.

No context found.

Z. Hu and H. Iwasaki. Promotional Transformation of Monadic Programs. In Fuji International Workshop on Functional and Logic Programming, pages 196--210. World Scientific, July 1995. Also available from http://www.ipl.t.u-tokyo.ac.jp/~hu/.

No context found.

Z. Hu and H. Iwasaki. Promotional transformation of monadic programs. In Workshop on Functional and Logic Programming, Susono, Japan, 1995. World Scientific.

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