Add to ORKGWe discuss Osius’s [22] concept of a recursive coalgebra of a functor from the perspective of programming semantics and give some new sufficient conditions for the recursiveness of a functor-coalgebra that are based on comonads, comonad-coalgebras and distributive laws
We propose to use modal logic as a logic for coalgebras and discuss it in view of the work done on c...
AbstractIn the semantics of programming, finite data types such as finite lists, have traditionally ...
textabstractIn the semantics of programming, finite data types such as finite lists, have traditiona...
We discuss Osius's [22] concept of a recursive coalgebra of a functor from the perspective of p...
AbstractWe discuss Osius's [G. Osius, Categorical set theory: A characterisation of the category of ...
AbstractThe concept of recursive coalgebra of a functor was introduced in the 1970s by Osius in his ...
Theoretical models of recursion schemes have been well studied under the names well-founded coalgebr...
Abstract. Final coalgebras for a functor serve as semantic domains for state based systems of variou...
This paper proposes a notion of computable coalgebras based on numbered sets and recursive functions...
AbstractFor coalgebras over fields, there is a well-known construction which gives the cofree coalge...
Every variable-free logic program induces a P P -coalgebra on the set of atomic formulae in the prog...
For finitary set functors preserving inverse images, recursive coalgebras A of Paul Taylor are prov...
Terminal coalgebras for a functor serve as semantic domains for state-basedsystems of various types....
Recursive specifications are a powerful tool mainly used in mathematics and computer science. In the...
Final coalgebras of a functor F are suited for an abstract description of infinite datatypes and dyn...
We propose to use modal logic as a logic for coalgebras and discuss it in view of the work done on c...
AbstractIn the semantics of programming, finite data types such as finite lists, have traditionally ...
textabstractIn the semantics of programming, finite data types such as finite lists, have traditiona...
We discuss Osius's [22] concept of a recursive coalgebra of a functor from the perspective of p...
AbstractWe discuss Osius's [G. Osius, Categorical set theory: A characterisation of the category of ...
AbstractThe concept of recursive coalgebra of a functor was introduced in the 1970s by Osius in his ...
Theoretical models of recursion schemes have been well studied under the names well-founded coalgebr...
Abstract. Final coalgebras for a functor serve as semantic domains for state based systems of variou...
This paper proposes a notion of computable coalgebras based on numbered sets and recursive functions...
AbstractFor coalgebras over fields, there is a well-known construction which gives the cofree coalge...
Every variable-free logic program induces a P P -coalgebra on the set of atomic formulae in the prog...
For finitary set functors preserving inverse images, recursive coalgebras A of Paul Taylor are prov...
Terminal coalgebras for a functor serve as semantic domains for state-basedsystems of various types....
Recursive specifications are a powerful tool mainly used in mathematics and computer science. In the...
Final coalgebras of a functor F are suited for an abstract description of infinite datatypes and dyn...
We propose to use modal logic as a logic for coalgebras and discuss it in view of the work done on c...
AbstractIn the semantics of programming, finite data types such as finite lists, have traditionally ...
textabstractIn the semantics of programming, finite data types such as finite lists, have traditiona...