Journal article
Type Fusion
- 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.
- Publication status:
- Published
Actions
Access Document
- Publisher copy:
- 10.1007/978-3-642-17796-5_6
Authors
- Journal:
- ALGEBRAIC METHODOLOGY AND SOFTWARE TECHNOLOGY More from this journal
- Volume:
- 6486
- Pages:
- 92-110
- Publication date:
- 2011-01-01
- DOI:
- EISSN:
-
1611-3349
- ISSN:
-
0302-9743
- Language:
-
English
- Keywords:
- Pubs id:
-
pubs:328723
- UUID:
-
uuid:0de79c0b-516e-4177-af27-886247187a1f
- Local pid:
-
pubs:328723
- Source identifiers:
-
328723
- Deposit date:
-
2012-12-19
- ARK identifier:
Terms of use
- Copyright date:
- 2011
If you are the owner of this record, you can report an update to it here: Report update to this record