Syntax and Variable Binding d Abstract) Marcelo Fiore COGS Univ. of Sussex Gordon Plotkin LFCS Univ. of Edinburgh Daniele Turi LFCS Univ. of Edinburgh op a theory of abstract synt...
Abstract. We show that the structures of binding algebras and Σmonoids by Fiore, Plotkin and Turi are sound and complete models of Klop’s Combinatory Reduction Systems (CRSs). T...
Abstract. Current self-healing systems are built from “convergent” actions that only make repairs when necessary. Using an algebraic model of system administration, we challeng...
species and combinatorial Hopf algebras on the one hand, and quantum groups and the classification theory of abstract Hopf algebras on the other. This is part of joint work with Sw...
Abstract. aRa is an automatic theorem prover for various kinds of relation algebras. It is based on Gordeev’s Reduction Predicate Calculi for n-variable logic (RPCn) which allow ...