See this document in CiteSeerX!

Cycle Therapy: A Prescription for Fold and Unfold on Regular Trees (2001)  (Make Corrections)  (1 citation)
Franklyn Turbak, J. B. Wells



  Home/Search   Context   Related

 
View or download:
mit.edu/~lyn/pubs/ppdp01.ps
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  mit.edu/~lyn/pubs/index (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: Cyclic data structures can be tricky to create and manipulate in declarative programming languages. In a declarative setting, a natural way to view cyclic structures is as denoting regular trees, those trees which may be infinite but have only a finite number of distinct subtrees. This paper shows how to implement the unfold (anamorphism) operator in both eager and lazy languages so as to create cyclic structures when the result is a regular tree as opposed to merely infinite lazy structures.... (Update)

Context of citations to this paper:   More

.... Turbak and Wells introduce the cycamore data type, which is aimed at simplifying the use of cyclic structures in declarative languages [86]. The basic idea is to associate each node in a cycamore with a global unique identifier, similar to our doubly linked list example of...

Cited by:   More
Value Recursion in Monadic Computations - Erkok (2002)   (Correct)

Active bibliography (related documents):   More   All
2.2:   Cycle Therapy: - Prescription For Fold (2001)   (Correct)
0.2:   Active Libraries and Universal Languages - Veldhuizen (2004)   (Correct)
0.2:   Program Representation Size in an Intermediate.. - Dimock.. (2001)   (Correct)

Similar documents based on text:   More   All
0.7:   An Interpretation of Cyclic Structure Into Type Theory - Izumi   (Correct)
0.2:   Robotic Design Studio: Exploring the Big Ideas of Engineering.. - Turbak, Berg   (Correct)
0.2:   Relating Typability and Expressiveness in Finite-Rank.. - Kfoury, Mairson (1999)   (Correct)

BibTeX entry:   (Update)

Turbak, F., and Wells, J. B. Cycle therapy: A prescription for fold and unfold on regular trees. In Proc. 3rd Int'l Conf. Principles & Practice Declarative Programming, PPDP'01 (Sept. 2001). (137) http://citeseer.ist.psu.edu/turbak01cycle.html   More

@misc{ turbak01cycle,
  author = "F. Turbak and J. Wells",
  title = "Cycle therapy: A prescription for fold and unfold on regular trees",
  text = "Turbak, F., and Wells, J. B. Cycle therapy: A prescription for fold and
    unfold on regular trees. In Proc. 3rd Int'l Conf. Principles & Practice
    Declarative Programming, PPDP'01 (Sept. 2001). (137)",
  year = "2001",
  url = "citeseer.ist.psu.edu/turbak01cycle.html" }
Citations (may not include all citations):
430   Structure and Interpretation of Computer Programs (context) - Abelson, Sussman et al. - 1996
362   ML for the Working Programmer (context) - Paulson - 1996
210   Functional programming with bananas (context) - Meijer, Fokkinga et al. - 1991
181   Principles of Program Analysis (context) - Nielson, Nielson et al. - 1999
104   Algebra of Programming (context) - Bird, de Moor - 1997
101   Lazy functional state threads - Launchbury, Jones - 1994
66   Views: A way for pattern matching to cohabit with data abstr.. - Wadler - 1987
59   Lazy memo-functions (context) - Hughes - 1985
51   Allyn and Bacon (context) - Schmidt - 1986
25   The under-appreciated unfold - Gibbons, Jones
23   Revisiting catamorphisms over datatypes with embedded functi.. - Fegaras, Sheard - 1996
20   A transformational system for developing recursive programs (context) - Burstall, Darlington - 1977
18   A tutorial on the universality and expressiveness of fold - Hutton - 1999
14   Fold and unfold for program semantics - Hutton
12   Recursive monadic bindings - Erkok, Launchbury
11   and pointed types (context) - Howard, coinductive
5   Improving the representation of infinite trees to deal with .. - Mauborgne - 2000
2   Data structures and program transformation (context) - Malcom - 1990
2   Working Paper 804 CBB (context) - Gibbons - 2001
2   Abstract of talk given at IFIP Working Group (context) - Wile - 2001

Documents on the same site (http://swissnet.ai.mit.edu/~lyn/pubs/index.html):   More
A Calculus with Polymorphic and Polyvariant Flow Types - Wells, Dimock, Muller, Turbak   (Correct)
Robotic Design Studio: Exploring the Big Ideas of Engineering.. - Turbak, Berg (2005)   (Correct)
First-Class Synchronization Barriers - Turbak (1996)   (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