Output details
11 - Computer Science and Informatics
University of Oxford
Article title
Adjoint folds and unfolds-An extended study
Type
D - Journal article
Title of journal
Science of Computer Programming
Article number
-
Volume number
78
Issue number
11
First page of article
2018
ISSN of journal
0167-6423
Year of publication
2012
Number of additional authors
0
Additional information
<08>
This paper is an extension and revision of two conference papers (MPC 2010 and AMAST 2010), and was solicited as one of the best papers from MPC 2010. It studies two general recursion schemes based on the categorical notion of an adjunction, greatly unifying and extending existing other work. We demonstrate that most programs that arise in practice are subsumed by one of the schemes and thus are directly amenable to formal manipulation. We develop their calculational properties, providing several fusion laws, which codify central optimisation principles. This paper formed the basis for a recent EPSRC research grant (EP/J010995/1).
Interdisciplinary
-
Cross-referral requested
-
Research group
None
Citation count
2
Proposed double-weighted
No
Double-weighted statement
-
Reserve for a double-weighted output
No
Non-English
No
English abstract
-
