This article needs attention from an expert in Programming languages.(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". 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  for Haskell. The library approach allows the parsers to be first-class citizens of the language.
- pg 35 of "History of Haskell"
- Daan Leijen & Erik Meijer (2001). Parsec: Direct Style Monadic Parser Combinators for the Real World. Department of Computer Science, Universiteit Utrecht. UU-CS-2001-27.
- Daan Leijen & Erik Meijer (October 1999). Domain Specific Embedded Compilers (PDF). Austin, Texas. pp. 109–122.
- Hughes, John (1995). Jeuring, J.; Meijer, E., eds. The Design of a Pretty-printing Library. 925. Springer Verlag.
|This computer-library-related article is a stub. You can help Wikipedia by expanding it.|