E. Meijer and G. Hutton. Bananas in space: Exteding fold and unfold to exponential types. In Proc. ConferenceonFunctional Programming Languages and Computer Architecture, pages 324--333, La Jolla, California, June 1995.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....t 1m1 j C 2 fft 21 : t 2m2 j 111 j C n fft n1 : t nmn where ff is a type variable denoting the element type, C i s are data constructors, and all t ij s are T ff. 2 In this paper, we do not allowmutually recursivetypes or function types, which can be lifted to some extent as studied in [MH95] To simplify our presentation, we assume that each branch C i ff t i1 : t im i contains an element of type ff and zero or more recursive components t i1 : t im i . If a branch does not need to have an element, we may consider the element has a don t care value (which will be Towards ....

E. Meijer and G. Hutton. Bananas in space: Exteding fold and unfold to exponential types. In Proc. ConferenceonFunctional Programming Languages and Computer Architecture, pages 324--333, La Jolla, California, June 1995.

....without leaving the framework of a purely functional language. Programs using monads, which will be called monadic programs hereafter, can be structured once again over data type for facilitating program transformation [5, 9, 15] It is known that each data type comes equipped with a catamorphism[13, 14] (i.e. a generalized fold[18] which satisfies several laws that are very useful for program transformation. Fokkinga[5] derived a sufficient condition under which there is also a kind of so called monadic catamorphism which satisfy similar laws and can thus be used for transformation of monadic ....

....the transformation of monadic catamorphisms. An example of an instance of our theory for calculating G machine is given in Section 6. Some discussions are given in Section 7. 2 Preliminaries for Program Calculation In this section, we briefly review the previous work in the program calculation[1, 3, 4, 6, 7, 12, 13, 14] and explain some basic facts which provide theoretic basis of our method. In this paper, our default category C has as objects sets, has as morphisms continuous functions, and has as composition of general functional composition ffi. 2.1 Functors Endofunctors on category C (functors from C to ....

E. Meijer and G. Hutton. Bananas in space: Exteding fold and unfold to exponential types. In FPCA '95, June 1995.

....An example of the derivation of an efficient algorithm for longest path problem are given in Section 6, and some related works and conclusions are described in Section 7. 2 Preliminaries for Program Calculation In this section, we briefly review the previous work in the program calculation[1, 4, 7, 15, 16, 18, 19] and explain some basic facts which provide theoretic basis of our method. In this paper, our default category C has as objects types, has as morphisms continuous functions, and has as composition general functional composition ffi. We shall denote the application of a function f to its argument ....

E. Meijer and G. Hutton. Bananas in space: Exteding fold and unfold to exponential types. In Proc. Conference on Functional Programming Languages and Computer Architecture, pages 324--333, La Jolla, California, June 1995. Calculating Accumulations 19

....use clever control to avoid infinite unfolding. This process introduces substantial cost and complexity, which is actually prevented from being implemented in a real compiler of functional languages. To remedy this situation, we turn to another transformation technique known as program calculation [MFP91, SF93, MH95], which is based on the theory of Constructive Algorithmics [Fok92] Different from the previous fold unfold transformation whose emphasis is on the generality of transformation process, program calculation deals with programs in some specific recursive forms, such as catamorphism, anamorphism ....

E. Meijer and G. Hutton. Bananas in space: Exteding fold and unfold to exponential types. In Proc. Conference on Functional Programming Languages and Computer Architecture, pages 324--333, La Jolla, California, June 1995.

No context found.

E. Meijer and G. Hutton. Bananas in space: Exteding fold and unfold to exponential types. In Proc. Conference on Functional Programming Languages and Computer Architecture, pages 324--333, La Jolla, California, June 1995.

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