User loginNavigation |
Using coalgebraic structures for traversing ADTs lazilyI am looking for references to the above, especially for implementations in ML-like languages. Rationale, I needed to write a comparison function for the content of binary trees. Using a coalgebraic structure to decompose the two trees in steps was the only solution I could think of. I am looking for possible generalizations of what I used. It looks like CPS, but it would be interesting to see it explained better. By marco at 2009-01-10 01:38 | LtU Forum | previous forum topic | next forum topic | other blogs | 9681 reads
|
Browse archivesActive forum topics |
Recent comments
5 hours 13 min ago
2 weeks 1 hour ago
6 weeks 1 day ago
6 weeks 5 days ago
6 weeks 5 days ago
8 weeks 5 days ago
8 weeks 5 days ago
9 weeks 1 day ago
9 weeks 1 day ago
10 weeks 1 day ago