Sciweavers

54 search results - page 3 / 11
» The continuum as a final coalgebra
Sort
View
CALCO
2005
Springer
109views Mathematics» more  CALCO 2005»
14 years 1 months ago
Final Semantics for Event-Pattern Reactive Programs
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...
César Sánchez, Henny B. Sipma, Matte...
APLAS
2007
ACM
13 years 11 months ago
Finally Tagless, Partially Evaluated
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...
Jacques Carette, Oleg Kiselyov, Chung-chieh Shan
ENTCS
2002
109views more  ENTCS 2002»
13 years 7 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
JLP
2006
99views more  JLP 2006»
13 years 7 months ago
An institution of modal logics for coalgebras
This paper presents a modular framework for the specification of certain inductivelydefined coalgebraic types. Modal logics for coalgebras of polynomial endofunctors on the catego...
Corina Cîrstea
ENTCS
2006
138views more  ENTCS 2006»
13 years 7 months ago
Some Properties and Some Problems on Set Functors
We study properties of functors on categories of sets (classes) together with set (class) functions. In particular, we investigate the notion of inclusion preserving functor, and ...
Daniela Cancila, Furio Honsell, Marina Lenisa