Loading...
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...
Saved in:
| Published in: | Foundations of Software Science and Computation Structures |
|---|---|
| Main Authors: | , , , |
| Format: | Artigo |
| Language: | Inglês |
| Published: |
2021
|
| Subjects: | |
| Online Access: | 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: |
Add Tag
No Tags, Be the first to tag this record!
|