Components as coalgebras : the refinement dimension
This paper characterizes refinement of state-based software components modeled as pointed coalgebras for some Set endofunctors. The proposed characterization is parametric on a specification of the underlying behaviour model introduced as astrong monad. This provides a basis to reason about (and tra...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | article |
| Language: | eng |
| Published: |
2006
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/1822/33818 |
| Country: | Portugal |
| Oai: | oai:repositorium.sdum.uminho.pt:1822/33818 |
| Summary: | This paper characterizes refinement of state-based software components modeled as pointed coalgebras for some Set endofunctors. The proposed characterization is parametric on a specification of the underlying behaviour model introduced as astrong monad. This provides a basis to reason about (and transform) state-based software designs. In particular it is shown how refinement can be applied to the development of the inequational subset of a calculus of generic software components. |
|---|