The Koka project tries to see if effect inference can be used on larger scale programming. The language is strict (as in ML), but seperates pure values from side effecting computations (as in Haskell). Through the effect types, there is also a strong connection to its denotational semantics, where the effect type of each function has a direct translation to the type signature of the denotational function.
- You can try out programming in Koka live at the Koka Tutorial.
- For more technical information, see the slides of a talk presented Lang.Next (April 2012).
- Read the draft language specification, or browse the library documentation.
- See the source code koka.codeplex.com
- Daan Leijen, Koka: Programming with Row Polymorphic Effect Types, in Mathematically Structured Functional Programming 2014, EPTCS, 18 March 2014