Mazeppa

Mazeppa subsumes deforestation and partial evaluation, enabling algorithm synthesis like transforming a naive string matcher into KMP, as shown in the examples.

It translates to native machine code via GNU C11, providing a practical path from functional programs to executable code, demonstrated in the C translation section with Boehm GC integration.

The --inspect flag generates visualizable process graphs and JSON files, allowing detailed inspection of supercompilation decisions for debugging and analysis.

@extract annotations let developers control unfolding and prevent exponential code blowup, offering a balance between automation and predictability, as explained in the SAT solver example.

Eager functions with lazy constructors enable effortless deforestation while preserving semantics, as seen in the sum-squares example where intermediate lists are eliminated.