Jeremy Gibbons
When is a function a fold or an unfold?
Gibbons, Jeremy; Hutton, Graham; Altenkirch, Thorsten
Authors
Professor GRAHAM HUTTON GRAHAM.HUTTON@NOTTINGHAM.AC.UK
Professor of Computer Science
THORSTEN ALTENKIRCH THORSTEN.ALTENKIRCH@NOTTINGHAM.AC.UK
Professor of Computer Science
Abstract
We give a necessary and sufficient condition for when a set-theoretic function can be written using the recursion operator fold, and a dual condition for the recursion operator unfold. The conditions are simple, practically useful, and generic in the underlying datatype.
Citation
Gibbons, J., Hutton, G., & Altenkirch, T. (2001). When is a function a fold or an unfold?.
Conference Name | Workshop on Coalgebraic Methods in Computer Science (4th) |
---|---|
End Date | Apr 7, 2001 |
Publication Date | May 1, 2001 |
Deposit Date | Feb 26, 2015 |
Publicly Available Date | Feb 26, 2015 |
Peer Reviewed | Peer Reviewed |
Volume | 44.1 |
Series Title | Electronic Notes in Theoretical Computer Science |
Public URL | https://nottingham-repository.worktribe.com/output/1023065 |
Publisher URL | http://www.sciencedirect.com/science/article/pii/S157106610480906X |
Additional Information | Published in Electronic Notes in Theoretical Computer Science, 44(1), May 2001, 146-160, doi: 10.1016/S1571-0661(04)80906-X |
Files
when.pdf
(221 Kb)
PDF
Copyright Statement
Copyright information regarding this work can be found at the following address: http://creativecommons.org/licenses/by/4.0
You might also like
Calculating correct compilers
(2015)
Journal Article
Cutting out continuations
(2016)
Presentation / Conference Contribution
Towards a theory of reach
(2016)
Journal Article
Failing faster: overlapping patterns for property-based testing
(2017)
Presentation / Conference Contribution
Contractive Functions on Infinite Data Structures
(2016)
Presentation / Conference Contribution
Downloadable Citations
About Repository@Nottingham
Administrator e-mail: discovery-access-systems@nottingham.ac.uk
This application uses the following open-source libraries:
SheetJS Community Edition
Apache License Version 2.0 (http://www.apache.org/licenses/)
PDF.js
Apache License Version 2.0 (http://www.apache.org/licenses/)
Font Awesome
SIL OFL 1.1 (http://scripts.sil.org/OFL)
MIT License (http://opensource.org/licenses/mit-license.html)
CC BY 3.0 ( http://creativecommons.org/licenses/by/3.0/)
Powered by Worktribe © 2024
Advanced Search