Representing cyclic data structures efficiently in Haskell

Christopher Milton
Mon, 7 Jul 2003 16:15:38 -0700 (PDT)

--- Sarah Thompson <> wrote:
> What is the best way to represent cyclic data structures in Haskell?

You _might_ find some useful ideas in

Franklyn Turbak and J. B. Wells.  Cycle Therapy: A Prescription for Fold and
Unfold on Regular Trees.  Third International Conference on Principles and
Practice of Declarative Programming. ACM, 2001.

Stefan Kahrs. Unlimp: Uniqueness as a leitmotiv for implementation. In M.
Bruynooghe and M. Wirsing, editors, Proc. Programming Language Implementation
and Logic Programming, Lecture Notes in Computer Science 631, 115--129, 1992.

Chris Milton
(busy processing MILSTRIPs in Perl)

Christopher Milton
--Matsuo Bashou