P. Hudak. Continuation-based mutable abstract datatypes, or how to have your state and munge it too. Technical Report Research Report YALEU/DCS/RR914, Yale University, 1992.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....state from those that may not. The lazy functional programming community has also been active in searching for new, clean ways of adding state to programming languages; just a few of these e orts are dialogue based I O in Haskell [13] monads [29, 43] continuation based mutable abstract datatypes [12], and lazy functional state threads [18] whose type theoretic encapsulation of state is remarkably similar to the work in semantics of [27] In each case, the design preserves some functional character of the language the equation ( is sound for proving operational equivalences, for example, ....

P. Hudak. Continuation-based mutable abstract datatypes, or how to have your state and munge it too. Technical Report Research Report YALEU/DCS/RR914, Yale University, 1992.

....exists allows updates to the structure to be performed destructively even though the axiomatized semantics of update is copy on write. This work is thus addressing the classic problem of how to implement updates efficiently in an applicative setting. In that sense, our work is akin to that of [23, 13, 26, 27]. Indeed, Schmidt introduced the term single threaded in [23] 27] contains a good survey of the most popular alternative in applicative languages, Haskell s monads . But ACL2 is unusual among purely applicative programming languages in that it is focused as much on using the language as a ....

P. Hudak, Continuation-based mutable abstract data types, or how to have your state and munge it too. Technical Report YaleU/DCS/RR914, Department of Computer Science, Yale University, July, 1992.

....from those that may not. The lazy functional programming community has also been active in searching for new, clean ways of adding state to programming languages; just a few of these efforts are dialogue based I O in Haskell [13] monads [29, 43] continuation based mutable abstract datatypes [12], and lazy functional state threads [18] whose type theoretic encapsulation of state is remarkably similar to the work in semantics of [27] In each case, the design preserves some functional character of the language the equation (fi) is sound for proving operational equivalences, for ....

P. Hudak. Continuation-based mutable abstract datatypes, or how to have your state and munge it too. Technical Report Research Report YALEU/DCS/RR914, Yale University, 1992.

....as part of the standard prelude. The discovery of such a simple solution comes as a surpise, considering the plethora of more elaborate solutions that have been proposed. A different way of expressing the same solution, based on continuation passing style, has subsequently been proposed by Hudak [8]. But Hudak s solution was inspired by the monad solution, and the monad solution still appears to have some small advantages [15] Why was this solution not discovered twenty years ago One possible reason is that the data types involve higher order functions in an essential way. The usual ....

P. Hudak, Continuation-based mutable abstract data types, or how to have your state and munge it too. Technical report YALEU/DCS/RR-914, Department of Computer Science, Yale University, July 1992.

....following sense: monads can implement continuations, but not the converse. ffl It is based (only) on the Hindley Milner type system. Some other proposals require linear types or existential types; ours does not. We have implemented all that we describe in the context of a compiler for Haskell (Hudak et al. 1992]) with the exception of the extension to arrays and reference types. The entire I O system provided by our compiler is written in Haskell, using the non standard extensions we describe below. The language s standard Dialogue interface for I O is supported by providing a function to convert a ....

....ccall as a construct allows these variations to be accomodated without difficulty. 3 Comparison with other I O styles In this section we briefly compare our approach with two other popular ones, dialogues and continuations. 3. 1 Dialogues The I O system specified for the Haskell language (Hudak et al. 1992]) is based on dialogues, also called lazy streams (Dwelly [1989] O Donnell [1985] Thompson [1989] In Haskell, the value of the program has type Dialogue, a synonym for a function between a list of I O responses to a list of I O requests: type Dialogue = Response] Request] main : ....

[Article contains additional citation context not shown here]

P Hudak [July 1992], "Continuation-based mutable abstract datatypes, or how to have your state and munge it too," YALEU/DCS/RR-914, Department of Computer Science, Yale University.

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