Proving the Unique Fixed-Point Principle Correct An Adventure with Category Theory
Say you want to prove something about an infinite data-structure, such as a stream or an infinite tree, but you would rather not subject yourself to coinduction. The unique fixed-point principle is an easyto- use, calculational alternative. The proof technique rests on the fact that certain recursio...
Asıl Yazarlar: | Hinze, R, James, D |
---|---|
Materyal Türü: | Conference item |
Baskı/Yayın Bilgisi: |
2011
|
Benzer Materyaller
-
Proving the unique fixed−point principle correct: an adventure with category theory
Yazar:: Hinze, R, ve diğerleri
Baskı/Yayın Bilgisi: (2011) -
Proving The Unique Fixed−Point Principle Correct
Yazar:: Hinze, R, ve diğerleri
Baskı/Yayın Bilgisi: (2011) -
Exploiting unique fixed points
Yazar:: Hinze, R
Baskı/Yayın Bilgisi: (2008) -
Functional pearl: Streams and unique fixed points
Yazar:: Hinze, R
Baskı/Yayın Bilgisi: (2008) -
Functional pearl: streams and unique fixed points
Yazar:: Hinze, R
Baskı/Yayın Bilgisi: (2008)