Semigroupoid Interfaces for Relation-Algebraic Programming in Haskell Export

@incollection{citeulike:1578376, abstract = {We present a Haskell interface for manipulating finite binary relations as data in a point-free relation-algebraic programming style that integrates naturally with the current Haskell collection types. This approach enables seamless integration of relation-algebraic formulations to provide elegant solutions of problems that, with different data organisation, are awkward to tackle. Perhaps surprisingly, the mathematical foundations for dealing with finite relations in such a context are not well-established, so we provide an appropriate generalisation of relational categories to semigroupoids to serve as specification for our interface. After having established an appropriate interface for relation-algebraic programming, we also need an efficient implementation; we find this in BDD-based kernel library KURE of recent versions of the Kiel RelView system. We show how this combination enables high-level declarative and efficient relational programming in Haskell.}, author = {Kahl, Wolfram}, citeulike-article-id = {1578376}, citeulike-linkout-0 = {http://dx.doi.org/10.1007/11828563_16}, doi = {10.1007/11828563_16}, journal = {Relations and Kleene Algebra in Computer Science}, keywords = {category-theory, haskell, relation-algebras}, pages = {235--250}, posted-at = {2007-08-21 06:25:28}, priority = {0}, title = {Semigroupoid Interfaces for Relation-Algebraic Programming in Haskell}, url = {http://dx.doi.org/10.1007/11828563_16}, year = {2006} }

TY - CHAP ID - citeulike:1578376 L3 - citeulike-article-id:1578376 N2 - We present a Haskell interface for manipulating finite binary relations as data in a point-free relation-algebraic programming style that integrates naturally with the current Haskell collection types. This approach enables seamless integration of relation-algebraic formulations to provide elegant solutions of problems that, with different data organisation, are awkward to tackle. Perhaps surprisingly, the mathematical foundations for dealing with finite relations in such a context are not well-established, so we provide an appropriate generalisation of relational categories to semigroupoids to serve as specification for our interface. After having established an appropriate interface for relation-algebraic programming, we also need an efficient implementation; we find this in BDD-based kernel library KURE of recent versions of the Kiel RelView system. We show how this combination enables high-level declarative and efficient relational programming in Haskell. JF - Relations and Kleene Algebra in Computer Science EP - 250 TI - Semigroupoid Interfaces for Relation-Algebraic Programming in Haskell SP - 235 KW - category-theory KW - haskell KW - relation-algebras AU - Kahl, Wolfram PY - 2006/// UR - http://dx.doi.org/10.1007/11828563_16 ER -