Title: Memoizing a monadic mixin DSL
Authors: Wuille, Pieter
Schrijvers, Tom
Samulowitz, Horst
Tack, Guido
Stuckey, Peter
Issue Date: 2011
Publisher: Springer
Host Document: Functional and Constraint Logic Programming vol:6816 pages:68-85
Series Title: Lecture Notes in Computer Science
Conference: Functional and Constraint Logic Programming (WFLP) edition:20 location:Odense, Denmark date:July 19, 2011
Abstract: Modular extensibility is a highly desirable property of a domain-specific language (DSL): the ability to add new features without affecting the implementation of existing features. Functional mixins (also known as open recursion) are highly suitable for this purpose. We study the use of mixins in Haskell for a modular DSL for search heuristics used in systematic solvers for combinatorial problems, that generate optimized C++ code from a high-level specification. We show how to apply memoization techniques to tackle performance issues and code explosion due to the highly recursive nature of the mixins. As such heuristics are conventionally implemented as highly entangled imperative algorithms, our Haskell mixins are monadic. Memoization of monadic components causes further complications for us to deal with.
ISBN: 978-3-642-22530-7
ISSN: 0302-9743
Publication status: published
KU Leuven publication type: IC
Appears in Collections:Informatics Section

Files in This Item:
File Description Status SizeFormat
wuille_2011_0_memoizing.pdfArticle Published 322KbAdobe PDFView/Open


All items in Lirias are protected by copyright, with all rights reserved.

© Web of science