Sciweavers

1019 search results - page 5 / 204
» Uniform Functors on Sets
Sort
View
ITA
2007
13 years 7 months ago
Recursive coalgebras of finitary functors
Abstract For finitary set functors preserving inverse images several concepts of coalgebras A are proved to be equivalent: (i) A has a homomorphism into the initial algebra, (ii) ...
Jirí Adámek, Dominik Lücke, Ste...
ICALP
2010
Springer
14 years 9 days ago
Automata for Coalgebras: An Approach Using Predicate Liftings
Universal Coalgebra provides the notion of a coalgebra as the natural mathematical generalization of state-based evolving systems such as (infinite) words, trees, and transition s...
Gaëlle Fontaine, Raul Andres Leal, Yde Venema
TCS
2010
13 years 2 months ago
Combinatorics of labelling in higher-dimensional automata
The main idea for interpreting concurrent processes as labelled precubical sets is that a given set of n actions running concurrently must be assembled to a labelled ncube, in exac...
Philippe Gaucher
LICS
2005
IEEE
14 years 1 months ago
Name Generation and Linearity
A path-based domain theory for higher-order processes is extended to allow name generation. The original domain theory is built around the monoidal-closed category Lin consisting ...
Glynn Winskel
STACS
2001
Springer
13 years 12 months ago
Semantical Principles in the Modal Logic of Coalgebras
Coalgebras for a functor on the category of sets subsume many formulations of the notion of transition system, including labelled transition systems, Kripke models, Kripke frames a...
Dirk Pattinson