AbstractCoalgebras for endofunctors C → C can be used to model classes of object oriented languages. However, binary methods do not fit directly into this approach. This paper proposes an extension of the coalgebraic framework, namely the use of extended polynomial functors Cop π C → C. This extension allows the incorporation of binary methods into coalgebraic class specifications. The paper also discusses how to define bisimulation for coalgebras of extended polynomial functors and proves some standard results
AbstractIn the semantics of programming, finite data types such as finite lists, have traditionally ...
The abstract mathematical structures known as coalgebras are of increasing interest in computer scie...
The abstract mathematical structures known as coalgebras are of increas-ing interest in computer sci...
Abstract A generalised notion of coalgebra that is capable of modelling binary methods as theyoccur ...
In previous work [14] I introduced a generalised notion of coalgebra that is capable of modelling bi...
AbstractIn previous work [14] I introduced a generalised notion of coalgebra that is capable of mode...
AbstractIn previous work [14] I introduced a generalised notion of coalgebra that is capable of mode...
We extend the Reichel-Jacobs coalgebraic account of specification and refinement of objects and clas...
We extend the Reichel-Jacobs coalgebraic account of specification and refinement of objects and clas...
AbstractThe study of algebras and coalgebras involve parametric description of a family of endofunct...
AbstractA syntax and semantics of types, terms and formulas for coalgebras of polynomial functors is...
This thesis is about coalgebraic methods in software specification and verification. It extends know...
This thesis is about coalgebraic methods in software specification and verification. It extends know...
This thesis is about coalgebraic methods in software specification and verification. It extends know...
This thesis is about coalgebraic methods in software specification and verification. It extends know...
AbstractIn the semantics of programming, finite data types such as finite lists, have traditionally ...
The abstract mathematical structures known as coalgebras are of increasing interest in computer scie...
The abstract mathematical structures known as coalgebras are of increas-ing interest in computer sci...
Abstract A generalised notion of coalgebra that is capable of modelling binary methods as theyoccur ...
In previous work [14] I introduced a generalised notion of coalgebra that is capable of modelling bi...
AbstractIn previous work [14] I introduced a generalised notion of coalgebra that is capable of mode...
AbstractIn previous work [14] I introduced a generalised notion of coalgebra that is capable of mode...
We extend the Reichel-Jacobs coalgebraic account of specification and refinement of objects and clas...
We extend the Reichel-Jacobs coalgebraic account of specification and refinement of objects and clas...
AbstractThe study of algebras and coalgebras involve parametric description of a family of endofunct...
AbstractA syntax and semantics of types, terms and formulas for coalgebras of polynomial functors is...
This thesis is about coalgebraic methods in software specification and verification. It extends know...
This thesis is about coalgebraic methods in software specification and verification. It extends know...
This thesis is about coalgebraic methods in software specification and verification. It extends know...
This thesis is about coalgebraic methods in software specification and verification. It extends know...
AbstractIn the semantics of programming, finite data types such as finite lists, have traditionally ...
The abstract mathematical structures known as coalgebras are of increasing interest in computer scie...
The abstract mathematical structures known as coalgebras are of increas-ing interest in computer sci...