Expressing multi-way data-flow constraint systems as a commutative monoid makes many of their properties obvious

Jaakko Järvi, Magne Haveraaen, John Freeman, Mat Marcus. Expressing multi-way data-flow constraint systems as a commutative monoid makes many of their properties obvious. In Andres Löh, Ronald Garcia, editors, Proceedings of the 8th ACM SIGPLAN workshop on Generic programming, WGP@ICFP 2012, Copenhagen, Denmark, September 9-15, 2012. pages 25-32, ACM, 2012. [doi]

Abstract

Abstract is missing.