Add to ORKGWe 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. © 2006 Elsevier B.V. All rights reserved
The aim of this paper is to prove in the context of simple type theory that logical relations are so...
AbstractRecent years have seen a growing interest towards algebraic structures that are able to expr...
We consider nested relations whose schemes are structured as trees, called scheme trees, and introdu...
We consider the representable equational theory of binary relations, in a language expressing compos...
AbstractWe consider the representable equational theory of binary relations, in a language expressin...
Recently there has been a growing interest towards algebraic structures that are able to express for...
Recent years have seen a growing interest towards algebraic structures that are able to express form...
Relation algebras are Boolean algebras with additional operations that generalize sets of binary rel...
Relations in partitioned normal form are an important subclass of nested relations. This paper is co...
It is shown that, even though there is a very well-behaved, natural normal form for lattice theory, ...
Functions of type 〈n 〉 are characteristic functions on n-ary relations. Keenan [5] established their...
Recent years have seen a growing interest towards algebraic structures that are able to express form...
<p>A normal form is proposed for abstract grammars in a broad sense (abstract syntaxes, algebraic si...
Abstract. We describe a theory for binary relations in the Zermelo-Fraenkel style. We choose for ZFC...
We use a deep embedding of the display calculus for relation algebras #RA in the logical framework I...
The aim of this paper is to prove in the context of simple type theory that logical relations are so...
AbstractRecent years have seen a growing interest towards algebraic structures that are able to expr...
We consider nested relations whose schemes are structured as trees, called scheme trees, and introdu...
We consider the representable equational theory of binary relations, in a language expressing compos...
AbstractWe consider the representable equational theory of binary relations, in a language expressin...
Recently there has been a growing interest towards algebraic structures that are able to express for...
Recent years have seen a growing interest towards algebraic structures that are able to express form...
Relation algebras are Boolean algebras with additional operations that generalize sets of binary rel...
Relations in partitioned normal form are an important subclass of nested relations. This paper is co...
It is shown that, even though there is a very well-behaved, natural normal form for lattice theory, ...
Functions of type 〈n 〉 are characteristic functions on n-ary relations. Keenan [5] established their...
Recent years have seen a growing interest towards algebraic structures that are able to express form...
<p>A normal form is proposed for abstract grammars in a broad sense (abstract syntaxes, algebraic si...
Abstract. We describe a theory for binary relations in the Zermelo-Fraenkel style. We choose for ZFC...
We use a deep embedding of the display calculus for relation algebras #RA in the logical framework I...
The aim of this paper is to prove in the context of simple type theory that logical relations are so...
AbstractRecent years have seen a growing interest towards algebraic structures that are able to expr...
We consider nested relations whose schemes are structured as trees, called scheme trees, and introdu...