International audienceWe revisit coinductive proof principles from a lattice theoretic point of view. By associating to any monotone function a function which we call the companion, we give a new presentation of both Knaster-Tarski's seminal result, and of the more recent theory of enhancements of the coinductive proof method (up-to techniques). The resulting theory encompasses parametrised coinduction, as recently proposed by Hur et al., and second-order reasoning, i.e., the ability to reason coinductively about the enhancements themselves. It moreover resolves an historical peculiarity about up-to context techniques. Based on these results, we present an open-ended proof system allowing one to perform proofs on-the-fly and to neatly separ...
Coinduction is a method of growing importance in reasoning about functional languages, due to the in...
AbstractWe introduce the λ-coiteration schema for a distributive law λ of a functor T over a functor...
Coinduction is a method for specifying and reasoning about infinite data types and automata with inf...
International audienceWe revisit coinductive proof principles from a lattice theoretic point of view...
We propose a theory of up-to techniques for proofs by coinduction, in the setting of complete lattic...
24 p.International audienceWe propose a theory of up-to techniques for proofs by coinduction, in the...
Abstract. We propose a theory of up-to techniques for proofs by coin-duction, in the setting of comp...
Coinduction is a mathematical tool that is used pervasively in computer science: to program and reas...
International audienceBisimulation up-to enhances the coinductive proof method for bisimilarity, pro...
Coinduction is a proof rule. It is the dual of induction. It allows reasoning about non--well--foun...
Bisimulation up-to enhances the coinductive proof method for bisimilarity, providing efficient proof...
Induction is a well-established proof principle that is taught in most undergraduate programs in mat...
Coinduction is a method for specifying and reasoning about infinite data types and automata with inf...
Induction is a well-established proof principle that is taught in most undergraduate programs in mat...
We introduce two coinduction principles and two proof translations which, under certain conditions, ...
Coinduction is a method of growing importance in reasoning about functional languages, due to the in...
AbstractWe introduce the λ-coiteration schema for a distributive law λ of a functor T over a functor...
Coinduction is a method for specifying and reasoning about infinite data types and automata with inf...
International audienceWe revisit coinductive proof principles from a lattice theoretic point of view...
We propose a theory of up-to techniques for proofs by coinduction, in the setting of complete lattic...
24 p.International audienceWe propose a theory of up-to techniques for proofs by coinduction, in the...
Abstract. We propose a theory of up-to techniques for proofs by coin-duction, in the setting of comp...
Coinduction is a mathematical tool that is used pervasively in computer science: to program and reas...
International audienceBisimulation up-to enhances the coinductive proof method for bisimilarity, pro...
Coinduction is a proof rule. It is the dual of induction. It allows reasoning about non--well--foun...
Bisimulation up-to enhances the coinductive proof method for bisimilarity, providing efficient proof...
Induction is a well-established proof principle that is taught in most undergraduate programs in mat...
Coinduction is a method for specifying and reasoning about infinite data types and automata with inf...
Induction is a well-established proof principle that is taught in most undergraduate programs in mat...
We introduce two coinduction principles and two proof translations which, under certain conditions, ...
Coinduction is a method of growing importance in reasoning about functional languages, due to the in...
AbstractWe introduce the λ-coiteration schema for a distributive law λ of a functor T over a functor...
Coinduction is a method for specifying and reasoning about infinite data types and automata with inf...