Abstract
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.
Author supplied keywords
Cite
CITATION STYLE
Hinze, R. (2011). Type fusion. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6486 LNCS, pp. 92–110). https://doi.org/10.1007/978-3-642-17796-5_6
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
