Back to Results
First PageMeta Content
Higher-order functions / Category theory / Isomorphism theorems / Fold / Recursion / Morphisms / Anamorphism / Map / Function composition / Mathematics / Abstract algebra / Declarative programming


Electronic Notes in Theoretical Computer Science 44 No[removed]URL: http://www.elsevier.nl/locate/entcs/volume44.html 14 pages When is a function a fold or an unfold? Jeremy Gibbons a , Graham Hutton b , and Thorsten A
Add to Reading List

Document Date: 2001-05-08 03:49:24

Open Document

File Size: 215,57 KB

Share Result on Facebook

City

Nottingham / Oxford / /

Company

Elsevier Science B. V. / /

Country

United Kingdom / /

Event

Environmental Issue / /

Facility

Jubilee Campus / Wolfson Building / University of Nottingham / /

IndustryTerm

fusion law / data-parallel algorithm / recursion operator / banana split law / /

Organization

School of Computer Science / Oxford University Computing Laboratory / University of Nottingham / IT / /

Person

Jeremy Gibbons / Graham Hutton / Thorsten Altenkirch / /

Position

head / /

PublishedMedium

Electronic Notes in Theoretical Computer Science / /

Technology

data-parallel algorithm / /

URL

http /

SocialTag