Back to Search

Conference item

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. ©2001 Published by Elsevier Science B. V.

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? 44(1), 149–163.

MLA Style

Gibbons, J., et al. When Is a Function a Fold or an Unfold? no. 1, 2001, pp. 149–63.

Chicago Style

Gibbons, J, G Hutton, and T Altenkirch. 2001. “When Is a Function a Fold or an Unfold?” In , 44:149–63.
Tweet
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

Bibliographic Details

Host title:: Electronic Notes in Theoretical Computer Science
Volume:: 44
Issue:: 1
Pages:: 149-163
Publication date:: 2001-05-01
DOI:: 10.1016/S1571-0661(04)80906-X
ISSN:: 1571-0661

Item Description

Pubs id:: pubs:163516
UUID:: uuid:8d82b8f6-61a2-45f0-bb93-35dafba1eef2
Local pid:: pubs:163516
Source identifiers:: 163516
Deposit date:: 2012-12-19

Terms of use

Copyright date:: 2001

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

Metrics

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