We show that coinductive predicates expressing behavioural properties of infinite objects can be themselves expressed as final coalgebras in a category of relations. The well-known case of bisimulation will simply be a special case of such final predicates. We will show how some useful pointwise and mixed properties of streams can be modelled in this way
Coinductive predicates express persisting “safety ” specifications of transition systems. Previous o...
Trace semantics has been defined for various kinds of state-based systems, notably with different fo...
textabstractIn the semantics of programming, finite data types such as finite lists, have traditiona...
We show that coinductive predicates expressing behavioural properties of infinite objects can be the...
Final coalgebras of a functor F are suited for an abstract description of infinite datatypes and dyn...
The classical Hennessy-Milner theorem says that two states of an image-finitetransition system are b...
The existence of a final coalgebra is equivalent to the existence of a formal logic with a set (smal...
Coinductive predicates express persisting “safety ” specifications of transition systems. Previous o...
AbstractWe introduce the λ-coiteration schema for a distributive law λ of a functor T over a functor...
The classical Hennessy-Milner theorem says that two states of an image-finite transition system are ...
AbstractCoinductive predicates express persisting “safety” specifications of transition systems. Pre...
Bisimulation up-to enhances the coinductive proof method for bisimilarity, providing efficient proof...
International audienceIn the context of abstract coinduction in complete lattices, the notion of com...
International audienceIn the context of abstract coinduction in complete lattices, the notion of com...
textabstractStreams, (automata and) languages, and formal power series are viewed coalgebraically. I...
Coinductive predicates express persisting “safety ” specifications of transition systems. Previous o...
Trace semantics has been defined for various kinds of state-based systems, notably with different fo...
textabstractIn the semantics of programming, finite data types such as finite lists, have traditiona...
We show that coinductive predicates expressing behavioural properties of infinite objects can be the...
Final coalgebras of a functor F are suited for an abstract description of infinite datatypes and dyn...
The classical Hennessy-Milner theorem says that two states of an image-finitetransition system are b...
The existence of a final coalgebra is equivalent to the existence of a formal logic with a set (smal...
Coinductive predicates express persisting “safety ” specifications of transition systems. Previous o...
AbstractWe introduce the λ-coiteration schema for a distributive law λ of a functor T over a functor...
The classical Hennessy-Milner theorem says that two states of an image-finite transition system are ...
AbstractCoinductive predicates express persisting “safety” specifications of transition systems. Pre...
Bisimulation up-to enhances the coinductive proof method for bisimilarity, providing efficient proof...
International audienceIn the context of abstract coinduction in complete lattices, the notion of com...
International audienceIn the context of abstract coinduction in complete lattices, the notion of com...
textabstractStreams, (automata and) languages, and formal power series are viewed coalgebraically. I...
Coinductive predicates express persisting “safety ” specifications of transition systems. Previous o...
Trace semantics has been defined for various kinds of state-based systems, notably with different fo...
textabstractIn the semantics of programming, finite data types such as finite lists, have traditiona...