Chargement en cours...
Fixpoint Theory – Upside Down
Knaster-Tarski’s theorem, characterising the greatest fix- point of a monotone function over a complete lattice as the largest post-fixpoint, naturally leads to the so-called coinduction proof principle for showing that some element is below the greatest fixpoint (e.g., for providing bisimilarity wi...
Enregistré dans:
| Publié dans: | Foundations of Software Science and Computation Structures |
|---|---|
| Auteurs principaux: | , , , |
| Format: | Artigo |
| Langue: | Inglês |
| Publié: |
2021
|
| Sujets: | |
| Accès en ligne: | https://ncbi.nlm.nih.gov/pmc/articles/PMC7984133/ https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1007/978-3-030-71995-1_4 |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|