Abstract

Coalgebras of polynomial functors constructed from sets of observable elements have been found useful in modelling various kinds of data types and state-transition systems. This paper presents a calculus of terms for operations on such coalgebras, based on a simple type theory, and develops its semantics. The terms admit a single state-valued parameter, but may also have state-valued variables. In a "rigid" term all state-variables are bound. Boolean

Citations