Parallel functional language to program reactive systems and parallel algorithms using distributed memory. Extends Haskell, but overrules lazy evaluation whenever needed to support parallelism; gives enough control to implement parallel algorithms eff...
Haskell-type language, implements ideas described in a 'A Theory of Overloading'. Compiles Chameleon to (plain) Haskell; can mix Haskell and Chameleon overloading. Descriptions, documents, downloads.
Small interpreter for language based on Haskell report 1.2; experimental, more so for type classes. Haskell adopted some ideas of Gofer, but Gofer type class system is more flexible. Runs on DOS, Linux, Macintosh, Unix. Hugs predecessor.
Dialect with instance of data fields (a generalization of arrays), useful for rapid prototyping of parallel algorithms, and parallel high-level system specification.