Combinator library

From Wikipedia, the free encyclopedia
Jump to navigation Jump to search

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.

See also[edit]

References[edit]

External links[edit]

  • Daan Leijen & Erik Meijer (2001). Parsec: Direct Style Monadic Parser Combinators for the Real World. Department of Computer Science, Universiteit Utrecht. hdl:1874/2535. UU-CS-2001-27.
  • Daan Leijen & Erik Meijer (October 1999). "Domain Specific Embedded Compilers". 2nd USENIX Conference on Domain Specific Languages (DSL'99) (PDF). Austin, Texas. pp. 109–122.
  • Hughes, John (1995). "The Design of a Pretty-printing Library". In Jeuring, J.; Meijer, E. (eds.). Advanced Functional Programming. Vol. 925. Springer Verlag. Archived from the original on 2008-04-06. Retrieved 2006-12-15.