Conference item
Proving the Unique Fixed-Point Principle Correct An Adventure with Category Theory
- Abstract:
-
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 recursion equations have unique solutions; if two elements of a coinductive type satisfy the same equation of this kind, then they are equal. In this paper we precisely characterize the conditions that gua...
Expand abstract
- Publication status:
- Published
Actions
Authors
Bibliographic Details
- Volume:
- 46
- Issue:
- 9
- Pages:
- 359-371
- Host title:
- ACM SIGPLAN NOTICES
- Publication date:
- 2011-09-01
- DOI:
- ISSN:
-
0362-1340
- Source identifiers:
-
328771
- ISBN:
- 9781450308656
Item Description
- Keywords:
- Pubs id:
-
pubs:328771
- UUID:
-
uuid:4f5ef44e-1c6c-4b2f-a77e-c2d8c019f13a
- Local pid:
- pubs:328771
- Deposit date:
- 2012-12-19
Terms of use
- Copyright date:
- 2011
If you are the owner of this record, you can report an update to it here: Report update to this record