Lambda the Ultimate

This is a bit premature, the conference papers aren't available on the Clean iTasks website yet, but

• Tasks are statically typed.
• Tasks are fully dynamic: what a task is doing may depend on the work produced.
• One can define user defined tasks.
• Tasks can be defined recursively.
• Thanks to polymorphism and overloading user defined re-useable tasks can be defined.
• Tasks are fully compositional: any combination of tasks made with the combinators can be re-used again as a task.
• Tasks can be higher order: not only values can flow from one task to another, but it can be tasks!

ppt presentation
demos