63 search results - page 12 / 13 » Algebras and Coalgebras |
FOSSACS
2005
Springer
14 years 1 months ago
2005
Springer
We present a general framework for logics of transition systems based on Stone duality. Transition systems are modelled as coalgebras for a functor T on a category X. The propositi...
ENTCS
2008
13 years 7 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...
FOSSACS
2003
Springer
14 years 22 days ago
2003
Springer
We introduce the notion of containers as a mathematical formalisation of the idea that many important datatypes consist of templates where data is stored. We show that containers h...
APLAS
2007
ACM
13 years 11 months ago
2007
ACM
We have built the first family of tagless interpretations for a higher-order typed object language in a typed metalanguage (Haskell or ML) that require no dependent types, general...
CALCO
2005
Springer
14 years 1 months ago
2005
Springer
This paper provides a general account of the notion of recursive program schemes, studying both uninterpreted and interpreted solutions. It can be regarded as the category-theoret...