1019 search results - page 3 / 204 » Uniform Functors on Sets |
ENTCS
2008
13 years 5 months ago
2008
bstraction Functor for Named Sets Vincenzo Ciancia 1 Ugo Montanari 1 Department of Computer Science University of Pisa lem of dening fully abstract operational models of name pass...
LOGCOM
2010
13 years 3 months ago
2010
This paper has two purposes. The first is to present a final coalgebra construction for finitary endofunctors on Set that uses a certain subset L∗ of the limit L of the firs...
FOSSACS
2006
Springer
13 years 8 months ago
2006
Springer
We take the point of view that, if transition systems are coalgebras for a functor T, then an adequate logic for these transition systems should arise from the `Stone dual' L ...
LOGCOM
2010
13 years 3 months ago
2010
CALCO
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. For any set-endofunctor T : Set → Set there exists a largest subcartesian transformation µ to the filter functor F : Set → Set. Thus we can associate with every T-c...