Three functions showing how to implement projection for functional lists. First version uses naive recursion and the second one is tail-recursive using the accumulator parameter. The third version extends this with continuation passing.
68 people like thisPosted: 12 years ago by Tomas Petricek
Binary tree traversal with continuation passing style transformation and defuntionalization
0 people like thisPosted: 8 months ago by tathanhdinh
Basic implementation of the continuation monad with explanation.
9 people like thisPosted: 3 years ago by Brian Berns
An tail recursive implementation of insertion sort on list
0 people like thisPosted: 8 months ago by tathanhdinh