The composition of these functors will give a method of transforming a high-level type-system description into a machine code analyzer.
It has the flavour of machine code, with combinators playing the role of program addresses and parameterization the role of register transfer.
Consequently, the final machine code will also be more efficient.
More generally, we could imagine generating some form of abstract machine code as programs are parsed.
It also leaves several options open for compilation to target machine code.
The verifier is able to prove memory safety of x86 machine code programs compiled from code that uses algebraic datatypes.
The display representation would then be one or more bitmaps augmented by custom-generated machine code.
The abstract machine code is optimized in compile-time by referring to the result of dataflow analysis with abstract interpretation.
