Formulation Abstractions with Higher Order Functions

A function is called higher order function if it takes functions as arguments and return a function. Say, you have a family of algorithm and each of them differs from one another in some steps, but there is common basic patter. In object oriented world, you will use typically the Strategy–Pattern to tackle this kind of problem.
Please check
http://www.paul-abraham.com/FSharpCode2SICP.doc

Continuation Monad

Continuation Monad plays an import role in F# . It powers Workflows. I wrote a sample code in F# and checked monadic Axioms. Please check to get entire series
( http://www.paul-abraham.com/MonadsInFSharp.doc)

Linear Recursion and Linear Iteration (Tail Recursion).

Friends, I am back from Israel and I have attended there a mathematical conference. Now ,I am enjoying reading the wonderful book “Structure and Interpretation of computer Programs”. I have written F# code for Linear Recursion and Linear Iteration (Tail Recursion). Please check http://www.paul-abraham.com/FSharpCode2SICP.doc to get the whole series