Relations and graphs: discrete mathematics for computer scientists
Relations and graphs: discrete mathematics for computer scientists
Combinatory logic programming: computing in relation calculi
ILPS '94 Proceedings of the 1994 International Symposium on Logic programming
Science of Computer Programming - Special issue on mathematics of program construction
Theoretical Computer Science
Algebra of programming
Relational methods in computer science
Relational methods in computer science
Logical reasoning with diagrams
Logical reasoning with diagrams
Relational matching for graphical calculi of relations
Information Sciences: an International Journal - Relational methods in computer science
An axiomatic basis for computer programming
Communications of the ACM
Relational Theory of Computing
Relational Theory of Computing
Elements of a Relational Theory of Datatypes
Proceedings of the IFIP TC2/WG 2.1 State-of-the-Art Report on Formal Program Development
Science of Computer Programming
| Hi-index | 5.23 |
We consider the representable equational theory of binary relations, in a language expressing composition, converse, and lattice operations. By working directly with a presentation of relation expressions as graphs we are able to define a notion of reduction which is confluent and strongly normalizing and induces a notion of computable normal form for terms. This notion of reduction thus leads to a computational interpretation of the representable theory.