article · 2006

Haskell Rules: Embedding Rule Systems in Haskell

Cited by 1Abstract and details only

Abstract

We present a domain-specic embedded language that allows the denition of rule systems in Haskell. As one particular example, we consider the modeling of type systems, which is an important part of programming language design. Type systems are most conveniently described using rule systems. Our approach is well integrated into Haskell’s type system and thus facilitates the convenient modeling of type systems and language semantics in general. We also demonstrate how our DSEL allows functional-logic programming in Haskell. Our system generalizes previous work by operating on user-dened data types, taking advantage of static typing, representing rules as functions, and allows a creative integration of logical variables into data structures which generalizes two previous approaches. We describe a straightforward method for translating rule systems into our DSEL.

Cite this paper

APA 7

Kollmansberger, S., & Erwig, M. (2006). Haskell Rules: Embedding Rule Systems in Haskell.

MLA 9

Kollmansberger, Steve, and Martin Erwig. “Haskell Rules: Embedding Rule Systems in Haskell.” 2006.

Chicago

Kollmansberger, Steve, and Martin Erwig. 2006. “Haskell Rules: Embedding Rule Systems in Haskell.”

Harvard

Kollmansberger, S. and Erwig, M. (2006) ‘Haskell Rules: Embedding Rule Systems in Haskell’.

BibTeX

@article{kollmansberger2006haskell,
  title = {{Haskell Rules: Embedding Rule Systems in Haskell}},
  author = {Kollmansberger, Steve and Erwig, Martin},
  year = {2006}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.