CALCO
2009
Springer
14 years 5 months ago
2009
Springer
CALCO
2009
Springer
14 years 7 months ago
2009
Springer
Abstract. We use coalgebraic methods to describe finitely generated free Heyting algebras. Heyting algebras are axiomatized by rank 0-1 axioms. In the process of constructing free...
CALCO
2009
Springer
14 years 7 months ago
2009
Springer
The exactness properties of coproducts in extensive categories and pushouts along monos in adhesive categories have found various applications in theoretical computer science, e.g....
CALCO
2009
Springer
14 years 7 months ago
2009
Springer
Abstract. In this paper we describe a language and method for deriving ontologies and ordering databases. The ontological structures arrived at are distributive lattices with attri...
CALCO
2009
Springer
14 years 7 months ago
2009
Springer
CALCO
2009
Springer
14 years 7 months ago
2009
Springer
CALCO
2009
Springer
14 years 7 months ago
2009
Springer
Abstract. Coalgebra automata, introduced by the second author, generalize the well-known automata that operate on infinite words/streams, trees, graphs or transition systems. This...
CALCO
2009
Springer
14 years 7 months ago
2009
Springer
Abstract. Parameterised monads have the same relationship to adjunctions with parameters as monads do to adjunctions. In this paper, we investigate algebras for parameterised monad...
CALCO
2009
Springer
14 years 7 months ago
2009
Springer
Abstract. Completely iterative algebras (cias) are those algebras in which recursive equations have unique solutions. In this paper we study complete iterativity for algebras with ...
CALCO
2009
Springer
14 years 7 months ago
2009
Springer
The operational semantics of interactive systems is usually described by labeled transition systems. Abstract semantics (that is defined in terms of bisimilarity) is characterized...