Combinator library
From Wikipedia, the free encyclopedia
 |
This article needs attention from an expert on the subject. See the talk page for details. WikiProject Programming languages may be able to help recruit an expert. (November 2008) |
A combinator library is a software library which implements combinators for a functional programming language; "the key idea is this: a combinator library offers functions (the combinators) that combine functions together to make bigger functions".[1] These kinds of libraries are particularly useful for allowing domain-specific programming languages to be easily embedded into a general purpose language by defining a few primitive functions for the given domain and turning over the task of expanding higher-level constructs to the general language. An example would be the monadic Parsec parser [1] for Haskell. The library approach allows the parsers to be first-class citizens of the language.
[edit] See also
[edit] References
- ^ pg 35 of "History of Haskell"
[edit] External links
- Daan Leijen and Erik Meijer (2001). Parsec: Direct Style Monadic Parser Combinators for the Real World. UU-CS-2001-27. http://www.cs.uu.nl/~daan/download/papers/parsec-paper.pdf.
- Daan Leijen and Erik Meijer (October 1999,). Domain Specific Embedded Compilers. Austin, Texas. pp. 109–122. http://www.cs.uu.nl/~daan/download/papers/dsec.ps.
- Hughes, John (1995). Jeuring, J. and Meijer, E.. ed. The Design of a Pretty-printing Library. 925. Springer Verlag. http://citeseer.ist.psu.edu/hughes95design.html.
| This computer library article is a stub. You can help Wikipedia by expanding it. |
