Patrik Jansson and Johan Jeuring. Calculating polytypic data conversion programs. Science of Computer Programmming, 2000. To appear. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Polytypic Values Possess Polykinded Types - Hinze (2001) (38 citations) (Correct)
....2 ) map H (#h . # map F 1 h) id . Using polytypic definitions similar to the one in Section 2 we can also implement embedding projection maps [14] of type MapE # X 1 X 2 = X 1 X 2 , X 2 X 1 ) monadic maps [7,25] of type MapM # X 1 X 2 = X 1 M X 2 for some monad M , and arrow maps [18] of type MapA # X 1 X 2 = X 1 # X 2 for some arrow type (#) Closely related to mapping functions are zipping functions. A binary zipping function takes two structures of the same shape and combines them into a single structure. For instance, the list zip takes a function of type A 1 A 3 , ....
Patrik Jansson and Johan Jeuring. Calculating polytypic data conversion programs. Science of Computer Programmming, 2000. To appear.
Polytypically Pretty Printing and Parsing in a Custom Format - Roorda (Correct)
....format that describes in which way values of data types are converted from and to text. An example of such a format is XML. The functions we de ne in this paper are based on the parse and pretty print functions de ned by Patrik Jansson in the article Calculating Polytypic Data Conversion Programs [1]. We assume that the reader has read this paper, and is familiar with the concepts introduced in it, e.g. polytypic programming, programming in PolyP and the abstract Arrow class. In the next section we will give an introduction to XML. In the third section we will describe Patrik Jansson s parse ....
Patrik Jansson and Johan Jeuring (to appear), Calculating Polytypic Data Conversion Programs, http://www.cs.chalmers.se/~patrikj/.
Polytypic Values Possess Polykinded Types - Hinze (2000) (38 citations) (Correct)
.... maphf 1 i m) id : Using de nitions similar to the one in Section 2 we can also implement embeddingprojection maps of type MapE h i t 1 t 2 = t 1 t 2 ; t 2 t 1 ) monadic maps (Fokkinga, 1994; Meijer Jeuring, 1995) of type MapM h i t 1 t 2 = t 1 M t 2 for some monad M , and arrow maps (Jansson Jeuring, 1999) of type MapAh i t 1 t 2 = t 1 ; t 2 for some arrow type ( Closely related to mapping functions are zipping functions. A binary zipping function takes two structures of the same shape and combines them into a single structure. For instance, the list zip takes a function of type a 1 a 2 a 3 ....
Jansson, Patrik, & Jeuring, Johan. (1999). Calculating polytypic data conversion programs. In submission.
Polytypic Values Possess Polykinded Types - Hinze (2000) (38 citations) (Correct)
.... 1 f 2 ) maphhi ( m: maphf 1 i m) id : Using de nitions similar to the one in Section 2 we can also implement embedding projection maps [9] of type MapE h i t 1 t 2 = t 1 t 2 ; t 2 t 1 ) monadic maps [5, 20] of type MapM h i t 1 t 2 = t 1 M t 2 for some monad M , and arrow maps [13] of type MapAh i t 1 t 2 = t 1 ; t 2 for some arrow type ( Closely related to mapping functions are zipping functions. A binary zipping function takes two structures of the same shape and combines them into a single structure. For instance, the list zip takes a function of type a 1 a 2 a 3 ....
Patrik Jansson and Johan Jeuring. Calculating polytypic data conversion programs, 1999. In submission.
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