--- Sarah Thompson
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. http://cs.wellesley.edu/~fturbak/pubs/ppdp01.html http://cs.wellesley.edu/~fturbak/pubs/index.html 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. http://citeseer.nj.nec.com/kahrs92unlimp.html Chris Milton (busy processing MILSTRIPs in Perl) ===== Christopher Milton cmiltonperl@yahoo.com ���Ӥ䤫�鷺���ӹ����β� --Matsuo Bashou