Sciweavers

650 search results - page 5 / 130
» On Coalgebras over Algebras
Sort
View
JLP
2006
138views more  JLP 2006»
13 years 7 months ago
Algebraic-coalgebraic specification in CoCasl
We introduce CoCasl as a light-weight but expressive coalgebraic extension of the algebraic specification language Casl. CoCasl allows the nested combination of algebraic datatype...
Till Mossakowski, Lutz Schröder, Markus Rogge...
FOSSACS
2010
Springer
14 years 2 months ago
Coalgebraic Correspondence Theory
Abstract. We lay the foundations of a first-order correspondence theory for coalgebraic logics that makes the transition structure explicit in the first-order modelling. In parti...
Lutz Schröder, Dirk Pattinson
ACMMPC
2000
Springer
236views Mathematics» more  ACMMPC 2000»
13 years 12 months ago
Calculating Functional Programs
Abstract. Functional programs are merely equations; they may be manipulated by straightforward equational reasoning. In particular, one can use this style of reasoning to calculate...
Jeremy Gibbons
CALCO
2011
Springer
205views Mathematics» more  CALCO 2011»
12 years 7 months ago
Bases as Coalgebras
Abstract. The free algebra adjunction, between the category of algebras of a monad and the underlying category, induces a comonad on the category of algebras. The coalgebras of thi...
Bart Jacobs
ENTCS
2008
91views more  ENTCS 2008»
13 years 7 months ago
A Name Abstraction Functor for Named Sets
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...
Vincenzo Ciancia, Ugo Montanari