Now integrated in mainstream languages, Algebraic Data Types (ADTs) have established themselves as a nice way to reason about data structures and their manipulation using \emph{pattern matching}. However, their use in low-level programming remains limited despite efforts, notably from the Rust community. Recently, Ribbit propose to let programmers express the precise memory layout of a given Algebraic Data Type, while still enjoying high-level programming constructs. Their compilation procedure covers efficient pattern matching, but leaves out constructors and struggles with arbitrarily mangled memory layouts.

We extend Ribbit with a new capability: generating arbitrary morphisms between memory representations of ADTs, and use this capability to compile complex code. We extend Ribbit to emit CFG-style programs with explicit memory allocation and full support for recursive types.