Journal article icon

Journal article

Disciplined, efficient, generalised folds for nested datatypes

Abstract:

Nested (or non-uniform, or non-regular) datatypes have recursive definitions in which the type parameter changes. Their folds are restricted in power due to type constraints. Bird and Paterson introduced generalised folds for extra power, but at the cost of a loss of efficiency: folds may take more than linear time to evaluate. Hinze introduced efficient generalised folds to counter this inefficiency, but did so in a pragmatic way: he did not provide categorical or equivalent underpinnings, s...

Expand abstract
Publication status:
Published

Actions


Access Document


Publisher copy:
10.1007/s00165-003-0013-6

Authors


More by this author
Institution:
University of Oxford
Department:
Oxford, MPLS, Computer Science
Role:
Author
Journal:
FORMAL ASPECTS OF COMPUTING
Volume:
16
Issue:
1
Pages:
19-35
Publication date:
2004-04-05
DOI:
EISSN:
1433-299X
ISSN:
0934-5043
URN:
uuid:e4d24e52-abb4-4764-b120-4f57ba6749ed
Source identifiers:
163484
Local pid:
pubs:163484

Terms of use


Metrics


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