Dynamic optimization for functional reactive programming using generalized algebraic data types Export

@inproceedings{citeulike:333533, abstract = {A limited form of dependent types, called Generalized Algebraic Data Types (GADTs), has recently been added to the list of Haskell extensions supported by the Glasgow Haskell Compiler. Despite not being full-fledged dependent types, GADTs still offer considerably enlarged scope for enforcing important code and data invariants statically. Moreover, GADTs offer the tantalizing possibility of writing more efficient programs since capturing invariants statically through the type system sometimes obviates entire layers of dynamic tests and associated data markup. This paper is a case study on the applications of GADTs in the context of Yampa, a domain-specific language for Functional Reactive Programming in the form of a self-optimizing, arrow-based Haskell combinator library. The paper has two aims. Firstly, to explore what kind of optimizations GADTs make possible in this context. Much of that should also be relevant for other domain-specific embedded language implementations, in particular arrow-based ones. Secondly, as the actual performance impact of the GADT-based optimizations is not obvious, to quantify this impact, both on tailored micro benchmarks, to establish the effectiveness of individual optimizations, and on two fairly large, realistic applications, to gauge the overall impact. The performance gains for the micro benchmarks are substantial. This implies that the Yampa API could be simplified as a number of "pre-composed" primitives that were there mainly for performance reasons are no longer needed. As to the applications, a worthwhile performance gain was obtained in one case whereas the performance was more or less unchanged in the other.}, address = {New York, NY, USA}, author = {Nilsson, Henrik}, booktitle = {ICFP '05: Proceedings of the tenth ACM SIGPLAN international conference on Functional programming}, citeulike-article-id = {333533}, citeulike-linkout-0 = {http://portal.acm.org/citation.cfm?id=1086365.1086374}, citeulike-linkout-1 = {http://dx.doi.org/10.1145/1086365.1086374}, doi = {10.1145/1086365.1086374}, isbn = {1595930647}, keywords = {adt, compilers, optimization}, pages = {54--65}, posted-at = {2007-12-18 12:52:40}, priority = {1}, publisher = {ACM Press}, title = {Dynamic optimization for functional reactive programming using generalized algebraic data types}, url = {http://dx.doi.org/10.1145/1086365.1086374}, year = {2005} }

TY - CONF ID - citeulike:333533 L3 - citeulike-article-id:333533 N2 - A limited form of dependent types, called Generalized Algebraic Data Types (GADTs), has recently been added to the list of Haskell extensions supported by the Glasgow Haskell Compiler. Despite not being full-fledged dependent types, GADTs still offer considerably enlarged scope for enforcing important code and data invariants statically. Moreover, GADTs offer the tantalizing possibility of writing more efficient programs since capturing invariants statically through the type system sometimes obviates entire layers of dynamic tests and associated data markup. This paper is a case study on the applications of GADTs in the context of Yampa, a domain-specific language for Functional Reactive Programming in the form of a self-optimizing, arrow-based Haskell combinator library. The paper has two aims. Firstly, to explore what kind of optimizations GADTs make possible in this context. Much of that should also be relevant for other domain-specific embedded language implementations, in particular arrow-based ones. Secondly, as the actual performance impact of the GADT-based optimizations is not obvious, to quantify this impact, both on tailored micro benchmarks, to establish the effectiveness of individual optimizations, and on two fairly large, realistic applications, to gauge the overall impact. The performance gains for the micro benchmarks are substantial. This implies that the Yampa API could be simplified as a number of "pre-composed" primitives that were there mainly for performance reasons are no longer needed. As to the applications, a worthwhile performance gain was obtained in one case whereas the performance was more or less unchanged in the other. SN - 1595930647 AD - New York, NY, USA EP - 65 TI - Dynamic optimization for functional reactive programming using generalized algebraic data types PB - ACM Press T2 - ICFP '05: Proceedings of the tenth ACM SIGPLAN international conference on Functional programming SP - 54 KW - adt KW - compilers KW - optimization AU - Nilsson, Henrik PY - 2005/// UR - http://dx.doi.org/10.1145/1086365.1086374 ER -