| Citations: | 1 - 0 self |
@MISC{Hinze_typefusion,
author = {Ralf Hinze},
title = {Type Fusion},
year = {}
}
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. 1.
Developed at and hosted by The College of Information Sciences and Technology
© 2007-2010 The Pennsylvania State University
