Recursion patterns and time-analysis

• Type: Article in International Scientific Journal
• Date: 2005

Authors

Barbosa, A (Author) Other; Cunha, A (Author) Other; Pinto, JS (Author) Other

Journal

Title: SIGPLAN Notices (ACM Special Interest Group on Programming Languages)

Vol. 40

Pages: 45-54

ISSN: 0362-1340

Publisher: Special Interest Group on Computer Graphics, Association for Computing Machinery

Indexing

ISI Web of Knowledge - 1 Citation

Scopus - 1 Citation

Other information

Authenticus ID: P-000-3DM

DOI: 10.1145/1071221.1071226

Abstract (EN): This paper explores sonic ideas concerning the time-analysis of functional programs defined by instantiating typical recursion patterns such as folds, unfolds. and hylomorphisms. The concepts in this paper are illustrated through a rich set of examples in the Haskell programming language. We concentrate on unfolds and folds (also known as anamorphisms and catamorphisms respectively) of recursively defined types, as well as the more general hylomorphism pattern. For the latter, we use as case-studies two famous sorting algorithms, mergesort and quicksort. Even though time analysis is not compositional, we argue that splitting functions to expose the explicit construction of the recursion tree and its later consumption helps with this analysis.

Language: English

Type (Professor's evaluation): Scientific

No. of pages: 10