(Enter summary)
Abstract: In this paper we show how some of the recursion patterns typically used
in algebraic programming can be defined using hylomorphisms. Most of these
definitions were previously known. However, unlike previous approaches that
use fixpoint induction, we show how to derive the standard laws of each recursion
pattern by using just the basic laws of hylomorphisms. We also define the
accumulation recursion pattern introduced by Pardo using a hylomorphism,
and use this definition to derive the... (Update)
Active bibliography (related documents): More All
0.5: Streaming Representation-Changers - Gibbons (2004)
(Correct)
0.5: Metamorphisms: Streaming Representation-Changers - Gibbons (2005)
(Correct)
0.5: The Calculation of a Polytypic Parser - Huisman (1996)
(Correct)
Similar documents based on text: More All
0.6: A Game-theoretic Approach to the Socialization of.. - Alcino Cunha Jose (1998)
(Correct)
0.6: A Multi-Agent Based Approach For Load Distribution In.. - Alcino Cunha Orlando (1997)
(Correct)
0.5: Resource Allocation on Agent Meta-Societies - Cunha, Belo
(Correct)
BibTeX entry: (Update)
@misc{ cunha-recursion,
author = "Manuel Alcino Cunha",
title = "Recursion Patterns as Hylomorphisms",
url = "citeseer.ist.psu.edu/cunha03recursion.html" }
Citations (may not include all citations):
104
Science of Computer Programming (context) - Malcolm, program - 1990
92
Purely Functional Language (context) - Jones, Hughes et al. - 1999
84
Basic category Theory for Computer Scientists (context) - Pierce - 1991
55
Bananas in space: Extending fold and unfold to exponential t..
- Meijer, Hutton - 1995
52
Functional programming with bananas (context) - Meijer, Fokkinga et al. - 1991
51
A calculational fusion system HYLO
- Onoue, Hu et al. - 1997
46
Deriving structural hylomorphisms from recursive definitions
- Hu, Iwasaki et al. - 1996
25
The under-appreciated unfold
- Gibbons, Jones - 1998
19
recursion and course-of-value (context) - Uustalu, Vene et al. - 1999
15
Functional programming with apomorphisms (context) - Vene, Uustalu - 1998
12
Program calculation properties of continuous algebras
- Fokkinga, Meijer - 1991
12
Calculating functional programs
- Gibbons - 2002
8
Recursion schemes from comonads
- Uustalu, Vene et al. - 2001
7
Sorting morphisms
- Augusteijn - 1999
7
Scrap your boilerplate: a practical design pattern for gener.. (context) - Lammel, Jones - 2003
7
Towards merging recursion and comonads
- Pardo - 2000
5
Generic accumulations
- Pardo - 2002
3
Semantics of the domain of flow diagrams (context) - Reynolds - 1977
2
Department of Computer Science (context) - Meertens, Report et al. - 1990
2
Program construction and generation based on recursive types (context) - Vos - 1995
1
Deriving animations from recursive definitions (context) - Cunha, Barros et al. - 2002
1
Automatic visualization of recursion trees: a case study on .. (context) - Cunha - 2003
Documents on the same site (http://www.di.uminho.pt/pg/sddi2003/papers.html): More
A Peer-to-Peer Inverted Index Implementation for Word-Based.. - Lopes (2003)
(Correct)
Evaluating Certification Protocols in the Partial Database State.. - Sousa (2003)
(Correct)
Components, Connectors and Architectural Patterns - Barbosa (2003)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC