d Abstract) Gordon Plotkin1, LFCS, School of Informatics, University of Edinburgh, UK. The application of ideas from universal algebra to computer science has long been a major the...
We give an axiomatic treatment of fixed-point operators in categories. A notion of iteration operator is defined, embodying the equational properties of iteration theories. We p...
We study several algebras of graphs and hypergraphs and the corresponding notions of equational sets and recognizable sets. We generalize and unify several existing results which ...
Abstract-- This paper describes a technique combining higher order functions, algebraic datatypes, and monads to incrementally implement syntax driven logics. Extensions can be com...
Ignatius Sri Wishnu Brata Prasetya, A. Azurat, Tan...
This work expounds the notion that (structured) categories are syntax free presentations of type theories, and shows some of the ideas involved in deriving categorical semantics f...