Difference between revisions of "Lattice"
Jump to navigation
Jump to search
| (4 intermediate revisions by 2 users not shown) | |||
| Line 1: | Line 1: | ||
According to wikipedia, [[wikipedia:Lattice|Lattice]] is a data type that is represented as directed arrows that doesn't create loopy structures. This is also known as [[POSet]] for [[Partially-ordered set]]. According to Dana Scott<ref>{{:Paper/Outline of a Mathematical Theory of Computation}}</ref>, it is considered to be the | According to wikipedia, [[wikipedia:Lattice|Lattice]] is a data type that is represented as directed arrows that doesn't create loopy structures. This is also known as a special kind of [[POSet]] for [[Partially-ordered set]]. According to Dana Scott<ref>{{:Paper/Outline of a Mathematical Theory of Computation}}</ref>, it is considered to be the [[universal]] building block of all of computation. It is also used as the main instrument to reason able [[correctness]] or [[safety]]/[[liveness]] properties of complex systems. | ||
<noinclude> | |||
{{PagePostfix | |||
|category_csd=POSet,Monoid | |||
}} | |||
</noinclude> | |||
Latest revision as of 04:50, 6 July 2023
According to wikipedia, Lattice is a data type that is represented as directed arrows that doesn't create loopy structures. This is also known as a special kind of POSet for Partially-ordered set. According to Dana Scott[1], it is considered to be the universal building block of all of computation. It is also used as the main instrument to reason able correctness or safety/liveness properties of complex systems.
References
- ↑ Scott, Dana (January 1, 1970). "Outline of a Mathematical Theory of Computation". local page: Oxford University Computing Laboratory Programming Research Group.
Related Pages