P. Wadler, "Monads and Composable Continuations", Lisp and Symbolic Computation, vol. 7, no. 1, pp. 39--56, January 1994. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
A Formal Semantics for the C Programming Language - Nikolaos Papaspyrou Doctoral (1998) (1 citation) (Correct)
....and compares very favourably to other approaches for the same purpose, as is further discussed in Chapter 16. Another significant contribution of this thesis is the application of monad notation for the speci MONADS AND fication of the semantics of a real programming language. Monads [Mogg89, Wadl92, Wadl94] and monad transformers [Lian95b, Lian96] have been proposed as a method of improving the modularity Following the terminology used in compilers and other language implementations, analysis primarily focuses on the extraction of static program properties and error detection. The dynamic ....
P. Wadler, "Monads and Composable Continuations", Lisp and Symbolic Computation, vol. 7, no. 1, pp. 39--56, January 1994.
Language Prototyping using Modular Monadic Semantics - Gayo, Lovelle, Díez (1999) (Correct)
....prototyping system that will allow the users to design their language obtaining executable prototypes automatically. With regard to future research, J. Hughes [10] presented arrows, a generalisation of monads, which could be used to obtain more efficient implementations of some specific features [30]. We have rewritten a subset of our system using first class polymorphism [16] to model monad transformers avoiding some unresolved overloading problems and we are trying to combine it with extensible records [7] to obtain extensibility. Folds and monadic folds are polytipic functions [14] PolyP ....
P. Wadler, Monads and Composable Continuations, in Lisp and Symbolic Computation 7, 39-55 (1994).
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