Relational Methods in Computer Science


Relations are everywhere.

Element-free formalizations based on relations are often easier to handle and more concise then traditional formalizations based on elements and (partial) functions.

Proofs about relational formalizations tend to be calculational and are therefore easier to check than the usual prose-based predicate-logic-like proofs about traditional formalizations.

In short:

Relation algebra is a useful tool for concise and precise formal reasoning.

My interest in relation algebra originally mainly comes from the user perspective:

I am also interested in more general and foundational aspects:

Furthermore I am involved in the international RelMiCS community as:

Wolfram Kahl