Computer Science – Programming Languages
Scientific paper
2002-12-19
Computer Science
Programming Languages
A preliminary version of this paper was presented at IFL 2002, and included in the informal preproceedings of the workshop
Scientific paper
In previous work, we introduced the notion of functional strategies: first-class generic functions that can traverse terms of any type while mixing uniform and type-specific behaviour. Functional strategies transpose the notion of term rewriting strategies (with coverage of traversal) to the functional programming paradigm. Meanwhile, a number of Haskell-based models and combinator suites were proposed to support generic programming with functional strategies. In the present paper, we provide a compact and matured reconstruction of functional strategies. We capture strategic polymorphism by just two primitive combinators. This is done without commitment to a specific functional language. We analyse the design space for implementational models of functional strategies. For completeness, we also provide an operational reference model for implementing functional strategies (in Haskell). We demonstrate the generality of our approach by reconstructing representative fragments of the Strafunski library for functional strategies.
Laemmel Ralf
Visser Joost
No associations
LandOfFree
Strategic polymorphism requires just two combinators! does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Strategic polymorphism requires just two combinators!, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Strategic polymorphism requires just two combinators! will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-330146