7 search results - page 1 / 2 » Final Coalgebras from Corecursive Algebras |
SBMF
2009
Springer
13 years 11 months ago
2009
Springer
Motivated by issues in designing practical total functional programming languages, we are interested in structured recursive equations that uniquely describe a function not because...
CALCO
2005
Springer
13 years 10 months ago
2005
Springer
Event-pattern reactive programs are front-end programs for distributed reactive components that preprocess an incoming stream of event stimuli. Their purpose is to recognize tempor...
ENTCS
2002
13 years 4 months ago
2002
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...
FOSSACS
2010
Springer
13 years 11 months ago
2010
Springer
Final coalgebras for a functor serve as semantic domains for state based systems of various types. For example, formal languages, streams, nonwell-founded sets and behaviors of CCS...
APLAS
2007
ACM
13 years 8 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...