A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Extensible programming with first-class cases
2006
Proceedings of the eleventh ACM SIGPLAN international conference on Functional programming - ICFP '06
We present language mechanisms for polymorphic, extensible records and their exact dual, polymorphic sums with extensible first-class cases. These features make it possible to easily extend existing code with new cases. In fact, such extensions do not require any changes to code that adheres to a particular programming style. Using that style, individual extensions can be written independently and later be composed to form larger components. These language mechanisms provide a solution to the
doi:10.1145/1159803.1159836
dblp:conf/icfp/BlumeAC06
fatcat:mm43vfniz5eovgew2ghil5q4ka