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 | 10063 reads
|
Browse archives
Active forum topics |
Recent comments
6 weeks 15 hours ago
6 weeks 19 hours ago
6 weeks 19 hours ago
28 weeks 2 days ago
32 weeks 3 days ago
34 weeks 1 day ago
34 weeks 1 day ago
36 weeks 5 days ago
41 weeks 3 days ago
41 weeks 3 days ago