Sample code which demonstrate tree searching using : Tail recursion with continuation
15 people like thisPosted: 10 years ago by Ankur Dhama
An implementation of call-with-current-continuation for Async.
2 people like thisPosted: 9 years ago by Ryan Riley
A continuation function takes the result when it is computed. Here is an implementation of sorting on List via insertion.
4 people like thisPosted: 8 years ago by Joel Huang
Applicative style argument accumulator functions inspired by the FParsec.Pipes library. It works by weaving a single continuation argument like a chain, kind of like the pipe function of FParsec but with a arbitrary number of arguments.
3 people like thisPosted: 4 years ago by Marko GrdiniÄ‡
This is an implementation of the Continuation monad using a type, taking an exception handler, and allowing for Call/CC. This specific implementation is mostly Matt Podwysocki's. I have a similar implementation using a purely functional, exception-handler-less version in FSharp.Monad. Until now, I haven't been able to resolve the callCC operator.
4 people like thisPosted: 9 years ago by Ryan Riley
Lists are pointers to the head of list. It can be defined by a discriminated union type. Using continuation can do a tail-recursion version of appending two lists.
3 people like thisPosted: 8 years ago by Joel Huang
Normally, when we implement Fibonacci sequence, we use recursive function, but it will encounter the overflow exception with the big data. Below is the Fibonacci snippet with continuation, and in this way, it won't encounter the overflow exception.
5 people like thisPosted: 8 years ago by Jeallyn Duan
Basic implementation of the continuation monad with explanation.
9 people like thisPosted: 1 year ago by Brian Berns