Type fusion

Authors:
Ralf Hinze
Affiliations:
Computing Laboratory, University of Oxford, Oxford, UK
Venue:
AMAST'10 Proceedings of the 13th international conference on Algebraic methodology and software technology
Year:
2010

Citing 10
Cited 3

Algebra of programming

Algebra of programming
The art of computer programming, volume 3: (2nd ed.) sorting and searching

The art of computer programming, volume 3: (2nd ed.) sorting and searching
An Extensional Characterization of Lambda-Lifting and Lambda-Dropping

FLOPS '99 Proceedings of the 4th Fuji International Symposium on Functional and Logic Programming
Type Specialisation for the lambda-Calculus; or, A New Paradigm for Partial Evaluation Based on Type Inference

Selected Papers from the Internaltional Seminar on Partial Evaluation
Categorical Fixed Point Calculus

CTCS '95 Proceedings of the 6th International Conference on Category Theory and Computer Science
Perfect trees and bit-reversal permutations

Journal of Functional Programming
Generalizing generalized tries

Journal of Functional Programming
Parametric datatype-genericity

Proceedings of the 2009 ACM SIGPLAN workshop on Generic programming
Representations of first order function types as terminal coalgebras

TLCA'01 Proceedings of the 5th international conference on Typed lambda calculi and applications
Adjoint folds and unfolds: or: scything through the thicket of morphisms

MPC'10 Proceedings of the 10th international conference on Mathematics of program construction

Concrete stream calculus: An extended study

Journal of Functional Programming
Constructing applicative functors

MPC'12 Proceedings of the 11th international conference on Mathematics of Program Construction
Adjoint folds and unfolds-An extended study

Science of Computer Programming

Quantified Score

Hi-index	0.00

Visualization

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.