Exploring (Finite) Relation Algebras Using Tools Written in Haskell

Wolfram Kahl, Gunther Schmidt

Technical Report Nr. 2000-02, 158 pages
Fakultät für Informatik
Universität der Bundeswehr München
October 2000
(.bib, .ps.gz, _2up_A4.ps.gz, _2up_letter.ps.gz, .pdf.gz, .pdf.zip)


During the last few years, relational methods have been gaining more and more acceptance and impact in computer science. Besides applications of concrete relations, also non-standard models of the relation algebraic axioms are important in fields as far apart as artificial intelligence and distributed computing. Also weaker structures have been considered, such as Dedekind categories in connection with fuzzy reasoning, and different kinds of allegories.

In this report we present a library of Haskell modules that allows to explore relation algebras and several weaker structures by providing different means to construct and test such algebras.

The kernel of our library is strictly conformant to the Haskell 98 standard, and can therefore be expected to be usable on future Haskell systems, too. For ease of use, we additionally provide a more elegant interface using non-standard extensions.

See also the RATH page on the RelMiCS site.

Wolfram Kahl — 11 October 2000