Functional Programming with Apomorphisms (Corecursion) (1998) [8 citations — 1 self]
by
Varmo Vene
,
Tarmo Uustalu
In 9th Nordic Workshop on Programming Theory
Add To MetaCart
Popular Tags
No tags have been applied to this document.
BibTeX | Add To MetaCart
@INPROCEEDINGS{Vene98functionalprogramming,
author = {Varmo Vene and Tarmo Uustalu},
title = {Functional Programming with Apomorphisms (Corecursion)},
booktitle = {In 9th Nordic Workshop on Programming Theory},
year = {1998}
}
author = {Varmo Vene and Tarmo Uustalu},
title = {Functional Programming with Apomorphisms (Corecursion)},
booktitle = {In 9th Nordic Workshop on Programming Theory},
year = {1998}
}
Bookmarks
OpenURL
Abstract:
In the mainstream categorical approach to typed (total) functional programming, functions with inductive source types defined by primitive recursion are called paramorphisms; the utility of primitive recursion as a scheme for defining functions in programming is well-known. We draw attention to the dual notion of apomorphisms---functions with coinductive target types defined by primitive corecursion---, and show on examples that primitive corecursion is useful in programming.
Citations
| 195 | An introduction to the theory of lists – Bird - 1987 |
| 194 | A tutorial on (co)algebras and (co)induction – Jacobs, Rutten - 1997 |
| 100 | Data structures and program transformation – Malcolm - 1990 |
| 89 | and Order in Algorithmics – Law - 1992 |
| 51 | A Categorical Programming Language – Hagino - 1987 |
| 46 | Inductive and coinductive types with iteration and recursion – Geuvers - 1998 |
| 40 | A fixpoint theorem for complete categories – Lambek - 1968 |
| 15 | coinductive, and pointed types – Inductive - 1996 |
| 11 | A browsable format for proof presentation – Grundy - 1996 |
