Information About

F-coalgebra
  CATEGORIES ABOUT F-COALGEBRA
   
category theory
   
coalgebras
   
APPAREL
BABY
BEAUTY
BOOKS
CAR TOYS
CELL PHONES
DVD'S
ELECTRONICS
GOURMET FOOD
GROCERIES
HEALTH & PERSONAL
HOME & GARDEN
JEWELRY
MUSIC
MUSIC INSTRUMENTS
OFFICE PRODUCTS
SOFTWARE
SPORTING GOODS
TOOLS & HARDWARE
TOYS
VIDEO GAMES
SHOPPING HOME
MORE SHOPPING...



:F : \mathbf{C}\longrightarrow \mathbf{C}

is an object A of \mathbf{C} together with a \mathbf{C}- Morphism

:\alpha : A \longrightarrow FA.

In this sense F-coalgebras are dual to F-algebra s.

Homomorphism s of F-coalgebras are morphisms

:f:A\longrightarrow B

in \mathbf{C} such that

: Ff\circ \alpha = \beta \circ f.

Thus F-coalgebras for a given functor ''F'' constitute a category.


EXAMPLES


Consider the functor F: \mathbf{Set} \longrightarrow \mathbf{Set} that sends X to X imes A+1, F-coalgebras \alpha : X \longrightarrow X imes A+1 = FX are then ( Finite or Infinite ) Stream s over the Alphabet A, where the elements of X are the states and \alpha is the transition to the next state and 1 means "end of file".


APPLICATIONS

In Computer Science , coalgebra has emerged as a convenient and suitably general way of specifying the reactive behaviour of
systems. While Algebraic Specification deals with functional behaviour, typically using inductive datatypes generated by constructors, coalgebraic specification is concerned with reactive behaviour modelled by coinductive process types that are
observable by selectors, much in the spirit of Automata Theory . An important role is played here by Final coalgebras, which are complete sets of possibly infinite behaviours, such as streams. The natural logic to express properties of such systems is coalgebraic Modal Logic .


REFERENCES

  • B. Jacobs and J. Rutten, A Tutorial on (Co)Algebras and (Co)Induction. EATCS Bulletin 62, 1997, p.222-259 .

  • Jan J. M. M. Rutten: Universal coalgebra: a theory of systems. Theor. Comput. Sci. 249(1): 3-80 (2000).

  • Jesse Hughes, Bart Jacobs: Simulations in coalgebra. Theor. Comput. Sci. 327(1-2): 71-108 (2004).

  • Bart Jacobs, Erik Poll: Coalgebras and monads in the semantics of Java. Theor. Comput. Sci. 291(3): 329-349 (2003).

  • Alexander Kurz: Specifying coalgebras with modal logic. Theor. Comput. Sci. 260(1-2): 119-138 (2001).



LINKS


See also: Coalgebra