Tarmo Uustalu, Varmo Vene, Alberto Pardo  Home/Search
Context
Related
| ii.uib.no/~nwpt00/Proceed...Veneabs.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: ii.uib.no/~nwpt00/Proceed...index (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: this paper, we discuss generic recursion combinators, i.e., combinator codings of recursive function definition schemes working uniformly on any inductive source type of functions. Such combinators are polymorphic in a type constructor inducing an inductive type. Generic recursion schemes are numerous. The most fundamental and easy to code by a combinator are (simple) iteration and primitive-recursion. Some other schemes that are more general in terms of direct expression power, e.g., the... (Update)
Similar documents (at the sentence level): More
63.8%: Comonadic Iteration (Abstract) - Uustalu, Vene, Pardo (2000) (Correct)
10.6%: A Parallel Functional Language Compiler for Message-Passing.. - Junaidu (1998) (Correct)
10.6%: A Compositional Approach to Performance Modelling - Hillston (1996) (Correct)
Active bibliography (related documents): More All
0.5: Recursion Schemes from Comonads - Uustalu, Vene, Pardo (2001) (Correct)
0.1: Recursion Patterns as Hylomorphisms - Cunha (2003) (Correct)
0.1: On Generalised Coinduction and Probabilistic Specification.. - Bartels (2004) (Correct)
Similar documents based on text: More All
1.4: Mendler-Style Inductive Types, Categorically - Uustalu, Vene (1999) (Correct)
1.2: Coding Recursion a la Mendler (Extended Abstract) - Uustalu, Vene (2000) (Correct)
1.0: Primitive (Co)Recursion and Course-of-Value (Co)Iteration.. - Uustalu, Vene (1999) (Correct)
BibTeX entry: (Update)
@misc{ uustalu-comonadic,
author = "Tarmo Uustalu and Varmo Vene and Alberto Pardo",
title = "Comonadic Iteration (Abstract)",
url = "citeseer.ist.psu.edu/uustalu00comonadic.html" }
Citations (may not include all citations):67 Formal Aspects of Computing (context) - Meertens - 1992
63 Algebraic data types and program transformation (context) - Malcolm - 1990
19 recursion and course-of-value (context) - Uustalu, Vene et al. - 1999
7 Towards merging recursion and comonads - Pardo
3 From set-theoretic coinduction to algebraic coinduction: Som.. (context) - Lenisa
Documents on the same site (http://www.ii.uib.no/~nwpt00/Proceedings/index.html): More
Model Checking LTL Properties of High-Level Petri Nets with.. - Latvala (2001) (Correct)
A Real-Time Process Algebra with Open Intervals and Maximal.. - Fecher (Correct)
On Combining Reasoning Control with Distribution and Openness in .. - Isabelle (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