Chameleon is an experimental language similar to Haskell. One of the
novel features of Chameleon is that the type system is programmable
via Constraint Handling Rules (CHRs). For example, Haskell-style
overloading can be programmed by some appropriate set of CHRs.
The latest version comes with
- a type debugger which allows to identify problematic expressions
and explains why certain types occur,
- a compilation scheme. Chameleon programs are translated into
plain Haskell (= Hindley/Milner subset plus polymorphic recursion)
For more details check out
for the latest release including a number of examples.
for papers describing Chameleon,
Note that we are constantly improving the current implementation.
Comments are appreciated.