Version 171 (modified by benl, 8 years ago) (diff)


The Disciplined Disciple Compiler (DDC)

Disciple is a dialect of Haskell that uses strict evaluation as the default and supports destructive update of arbitrary data structures. Disciple includes region, effect and closure typing, and this extra information provides a handle on the operational behaviour of code that isn't available in other languages. Programs can be written in either a pure/functional or effectful/imperative style, and one of our goals is to provide both styles coherently in the same language. The two styles can be mixed safely, for example: when using laziness the type system guarantees that computations with visible side effects are not suspended. Many Haskell programs are also Disciple programs, or will run with minor changes. Our target applications are the ones that you always find yourself writing C programs for, because existing functional languages are too slow, use too much memory, or don't let you update the data that you need to.

DDC is still in the "research prototype" stage, meaning that it will compile programs if you are nice to it, but expect compiler panics and missing features. You'll get panics due to ungraceful handling of errors in the source code, but valid programs should compile ok. Here are some working examples, along with their Disciple source code:

Ray Tracer N-Body Styrene
No image "raytracer-thumb.png" attached to WikiStart No image "nbody-thumb.png" attached to WikiStart No image "styrene-thumb.png" attached to WikiStart
(code) (code) (code)

State of Play

This section records what the DDC developers are actively working on. If you're hacking on something DDC related then by all means add yourself here. Records are dropped off if they're older than about a month.

Ben Lippmeier (benl23) -- updated 28th December 2011

  • I've started working on an interpreter for a cleaned up version of the core language.
  • In the new core language, witnesses have moved down a level next to values (instead of being types), which will make both the implementation and proofs easier.
  • I'm also getting rid of more-than constraints on effect and closure variables, which simplifies the core language at the cost of making type inference a bit harder.
  • The basic things like application, letregion and integer primops already work in the interpreter, and case expression should be done in about a week.
  • The interpreter comes with a parser and pretty printer for the core language, so we can write programs directly in core without needing to go though the source language.

Erik de Castro Lopo (erikde/m3ga) -- updated 11th Jan 2011

  • Plan to examine all the currently open bugs to see if any can be easily fixed and closed.
  • Improvements to DDC's library.
  • Working on bugs #160 and #225.



Fully supported: OSX/x86, Linux/x86, Linux/x86_64, Linux/PPC, FreeBSD/x86
Partially supported: Cygwin/x86?


How you can help

  • Download the compiler, write programs, and file bug reports!
  • Write more tests. Cute graphical demos are especially fun.
  • Fix bugs! The ones on the newbie list should be easy to get started on, otherwise we're pushing for the 0.1.3 release
  • 'port across GHC base libraries like Data.Either and Data.Map.

How to get help

Further Reading