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
Access Document
- Publisher copy:
- 10.1145/2034574.2034821
Why is the content I wish to access not available via ORA?
Bibliographic data (the information relating to research outputs) and full-text items (e.g. articles, theses, reports, etc.) arrive in ORA from several different sources. Unfortunately we are not able to make available the full-text for every research output.
Please contact the ORA team (
) if you have queries regarding unavailable content OR if you are aware of a full-text copy we can make available.
) if you have queries regarding unavailable content OR if you are aware of a full-text copy we can make available.
Content may be unavailable for the following four reasons
-
Version unsuitable
-
We have not obtained a suitable full-text for a given research output. See this page for more information.
-
Recently completed
-
Sometimes content is held in ORA but is unavailable for a fixed period of time to comply with the policies and wishes of rights holders.
-
Permissions
-
All content made available in ORA should comply with relevant rights, such as copyright. See this page for more information.
-
Clearance
-
Some thesis volumes scanned as part of the digitisation scheme funded by Dr Leonard Polonsky are currently unavailable due to sensitive material or uncleared third-party copyright content. We are attempting to contact authors whose theses are affected.
Alternative access to the full-text
You may be able to access the full-text directly from the publisher's website using the 'Publisher Copy' link in the 'Links & Downloads' box from a research output's ORA record page. This method may require an institutional or individual subscription to the journal/resource.
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