Complete Lattices and Up-to Techniques - Archive ouverte HAL Access content directly
Conference Papers Year : 2007

Complete Lattices and Up-to Techniques

(1, 2)
1
2

Abstract

We propose a theory of up-to techniques for proofs by coinduction, in the setting of complete lattices. This theory improves over existing results by providing a way to compose arbitrarily complex techniques with standard techniques, expressed using a very simple and modular semi-commutation property. Complete lattices are enriched with monoid operations, so that we can recover standard results about labelled transitions systems and their associated behavioural equivalences at an abstract, "point-free'' level. Our theory gives for free a powerful method for validating up-to techniques. We use it to revisit up to contexts techniques, which are known to be difficult in the weak case: we show that it is sufficient to check basic conditions about each operator of the language, and then rely on an iteration technique to deduce general results for all contexts.
Fichier principal
Vignette du fichier
LIP-RR2007-30.pdf (354.51 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

ensl-00155308 , version 1 (19-06-2007)
ensl-00155308 , version 2 (22-09-2007)

Identifiers

Cite

Damien Pous. Complete Lattices and Up-to Techniques. 5th Asian Symposium on Programming Languages and Systems, Joxan Jaffar, 2007, Singapore, Singapore. pp.351-366, ⟨10.1007/978-3-540-76637-7_24⟩. ⟨ensl-00155308v2⟩
103 View
389 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More