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, at the cost of a loss of reasoning power: w...

Expand abstract

Actions


Access Document


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

Authors


Clare Martin More by this author
More by this author
Institution:
University of Oxford
Department:
Mathematical, Physical and Life Sciences Division - Department of Computer Science
Ian Bayley More by this author
Journal:
Formal Aspects of Computing
Volume:
16
Issue:
1
Pages:
19-35
Publication date:
2004
DOI:
URN:
uuid:e67c8494-5c28-43a4-8534-2dc2e1b361b6
Local pid:
cs:2373

Terms of use


Metrics



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

TO TOP