ter: SEN 3 Abstract: We study several techniques for interactive equational reasoning with the bisimulation equivalence. Our work is based on a modular library, formalised in Coq, that axiomatises weakly final coalgebras and bisimulation. As a theory we derive some coalgebraic schemes and an associated coinduction principle. This will help in interactive proofs by coinduction, modular derivation of congruence and co-fixed point equations and enables an extensional treatment of bisimulation. Finally we present a version of the lambda-coinduction proof principle in our framework
Coinduction is a method for specifying and reasoning about infinite data types and automata with inf...
In this work we present a modular theory of the coalgebras and bisimulation in the intensional type ...
In this work we present a modular theory of the coalgebras and bisimulation in the intensional type ...
International audienceBisimulation up-to enhances the coinductive proof method for bisimilarity, pro...
Coinductive reasoning about infinitary structures such as streams is widely applicable. However, pra...
International audienceWe present a systematic study of bisimulation-up-to techniques for coalgebras....
Final coalgebras of a functor F are suited for an abstract description of infinite datatypes and dyn...
Bisimulation up-to enhances the coinductive proof method for bisimilarity, providing efficient proof...
We present a systematic study of bisimulation-up-to techniques for coalgebras. This enhances the bis...
International audienceBisimulation up-to enhances the coinductive proof method for bisimilarity, pro...
AbstractWe introduce the λ-coiteration schema for a distributive law λ of a functor T over a functor...
Bisimulation up-to enhances the coinductive proof method for bisimilarity, providing efficient proof...
Coinduction is a method of growing importance in reasoning about functional languages, due to the in...
Bisimulation up-to enhances the coinductive proof method for bisimilarity, providing efficient proof...
Coinduction is a method of growing importance in reasoning about functional languages, due to the in...
Coinduction is a method for specifying and reasoning about infinite data types and automata with inf...
In this work we present a modular theory of the coalgebras and bisimulation in the intensional type ...
In this work we present a modular theory of the coalgebras and bisimulation in the intensional type ...
International audienceBisimulation up-to enhances the coinductive proof method for bisimilarity, pro...
Coinductive reasoning about infinitary structures such as streams is widely applicable. However, pra...
International audienceWe present a systematic study of bisimulation-up-to techniques for coalgebras....
Final coalgebras of a functor F are suited for an abstract description of infinite datatypes and dyn...
Bisimulation up-to enhances the coinductive proof method for bisimilarity, providing efficient proof...
We present a systematic study of bisimulation-up-to techniques for coalgebras. This enhances the bis...
International audienceBisimulation up-to enhances the coinductive proof method for bisimilarity, pro...
AbstractWe introduce the λ-coiteration schema for a distributive law λ of a functor T over a functor...
Bisimulation up-to enhances the coinductive proof method for bisimilarity, providing efficient proof...
Coinduction is a method of growing importance in reasoning about functional languages, due to the in...
Bisimulation up-to enhances the coinductive proof method for bisimilarity, providing efficient proof...
Coinduction is a method of growing importance in reasoning about functional languages, due to the in...
Coinduction is a method for specifying and reasoning about infinite data types and automata with inf...
In this work we present a modular theory of the coalgebras and bisimulation in the intensional type ...
In this work we present a modular theory of the coalgebras and bisimulation in the intensional type ...