Journal article

When is a Function a Fold or an Unfold?

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.

Actions

Email

Email this record

Send the bibliographic details of this record to your email address.

Your Email
Please enter the email address that the record information will be sent to.

-
Your message (optional)
Please add any additional information to be included within the email.
Cite

Cite this record

APA Style

Gibbons, J., Hutton, G., & Altenkirch, T. (2001). When is a Function a Fold or an Unfold? Electronic Notes in Theoretical Computer Science, 44(1).

MLA Style

Gibbons, J., et al. “When Is a Function a Fold or an Unfold?” Electronic Notes in Theoretical Computer Science, vol. 44, no. 1, 2001.

Chicago Style

Gibbons, J, G Hutton, and T Altenkirch. 2001. “When Is a Function a Fold or an Unfold?” Electronic Notes in Theoretical Computer Science 44 (1).
Share
Print

Access Document

Publisher copy:: 10.1016/S1571-0661(04)80906-X

Authors

+ Gibbons, J More by this author

Institution:: University of Oxford
Division:: MPLS
Department:: Computer Science
Role:: Author

+ Hutton, G More by this author

Role:: Author

+ Altenkirch, T More by this author

Role:: Author

Journal:: Electronic Notes in Theoretical Computer Science More from this journal
Volume:: 44
Issue:: 1
Publication date:: 2001-04-01
DOI:: 10.1016/S1571-0661(04)80906-X

UUID:: uuid:03d4ce6f-30b5-46b5-b95e-5ff6ed874345
Local pid:: cs:2368
Deposit date:: 2015-03-12

Terms of use

Copyright date:: 2001

Licence:: Terms and Conditions of Use for Oxford University Research Archive

Views and Downloads

About views and downloads

If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP