Sciweavers

AMAST
2010
Springer
12 years 11 months ago
Type Fusion
Fusion is an indispensable tool in the arsenal of techniques for program derivation. Less well-known, but equally valuable is type fusion, which states conditions for fusing an app...
Ralf Hinze
ENTCS
2002
109views more  ENTCS 2002»
13 years 4 months ago
Induction, Coinduction, and Adjoints
We investigate the reasons for which the existence of certain right adjoints implies the existence of some final coalgebras, and vice-versa. In particular we prove and discuss the...
J. Robin B. Cockett, Luigi Santocanale
ENTCS
2002
136views more  ENTCS 2002»
13 years 4 months ago
Final Coalgebras And a Solution Theorem for Arbitrary Endofunctors
Every endofunctor F of Set has an initial algebra and a final coalgebra, but they are classes in general. Consequently, the endofunctor F of the category of classes that F induces...
Jirí Adámek, Stefan Milius, Jiri Vel...
ITA
2007
13 years 4 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...
SAS
1993
Springer
104views Formal Methods» more  SAS 1993»
13 years 8 months ago
Strictness Properties of Lazy Algebraic Datatypes
A new construction of a finite set of strictness properties for any lazy algebraic datatype is presented. The construction is based on the categorical view of the solutions to the...
P. N. Benton