Philip Wadler. Comprehending Monads. Proc. Lisp and Functional Programming, Nice, France, June 1990.  Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Specifying a Database System to Itself - Maier (1991) (1 citation) (Correct)
....strategies can then be expressed in terms of the abstracted operators and applied to the concrete versions of those. Note that having transforms on the abstract operations does not prevent having additional transforms on the specialized versions. We think the work on comprehensions of bulk types [18, 19] is an excellent start on such an organization. It seems to capture the essence of some common operations on bulk types at an abstract level, though we expect some extensions will be needed for types such as multidimensional arrays. Such an organization for bulk types could also accommodate ....
Wadler, PL. Comprehending monads. Proc. ACM Conf. on Lisp and Functional Programming:61-78, Nice, France, June 1990.
Functional-Logic Parsers In TOY - Roldán, Fraguas (1998) (Correct)
....have yield new perspectives to the parsing theory, but it seems also clear that parsing has supplied new features to declarative languages. Indeed, Prolog DCGs [SS86, PW80] are part of the language only for parsing purposes, while one of the first applications of the functional programming monads[Wad85, Wad90] were the parser combinators [Wad95] However the two most important declarative programming paradigms, namely functional and logic programming (in short FP and LP) have considered different approaches to the parsing problem. We will first survey the main characteristics of parsing in each ....
....combinators [Wad85, Hut92, Fok95] That is, parsers starting from a set of basic ones may be combined through carefully defined HO functions (the combinators) yielding new useful parsers. In the Haskell [HAS97] community, combinator parsing has derived recently into so called monadic parsing [Wad90, Wad95, HM97]. Parsing with FP benefits of the power of types, functional notation and HO functions for writing clear, well structured programs. As more concrete advantages we can mention: 1. Parser combinators provide an incremental point of view of the compiler construction. 2. HO combinators provide the ....
P. Wadler: Comprehending Monads, Proc. ACM Conf. on Lisp and Functional Programming, 1990.
Jonathan Aldrich - Requirements For The (Correct)
No context found.
Philip Wadler. Comprehending Monads. Proc. Lisp and Functional Programming, Nice, France, June 1990.
Using Types to Enforce Architectural Structure - Aldrich (2003) (6 citations) (Correct)
No context found.
Philip Wadler. Comprehending Monads. Proc. Lisp and Functional Programming, Nice, France, June 1990.
Using Types to Enforce Architectural Structure - Aldrich (2003) (6 citations) (Correct)
No context found.
Philip Wadler. Comprehending Monads. Proc. Lisp and Functional Programming, Nice, France, June 1990.
Algebraic Query Optimisation for Database Programming Languages - Poulovassilis, Small (1996) (3 citations) (Correct)
No context found.
Wadler, P. Comprehending Monads, Proc. ACM Conf. on Lisp and Functional Programming, Nice, June 1990, pp 61-78.
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