- Fusion is an indispensable tool in the arsenal of techniques for program derivation. Less well-known, but equally valuable is type fusion, which states conditions for fusing an application of a functor with an initial algebra to form another initial algebra. We provide a novel proof of type fusion based on adjoint folds and discuss several applications: type firstification, type specialisation and tabulation. © 2011 Springer-Verlag Berlin Heidelberg.
- Publication status:
- Publisher copy:
- Copyright date:
If you are the owner of this record, you can report an update to it here: Report update to this record