Author:
SCULTHORPE NEIL,FRISBY NICOLAS,GILL ANDY
Abstract
AbstractWhen writing transformation systems, a significant amount of engineering effort goes into setting up the infrastructure needed to direct individual transformations to specific targets in the data being transformed. Strategic programming languages provide general-purpose infrastructure for this task, which the author of a transformation system can use for any algebraic data structure. The Kansas University Rewrite Engine (KURE) is a typed strategic programming language, implemented as a Haskell-embedded domain-specific language. KURE is designed to support typed transformations over typed data, and the main challenge is how to make such transformations compatible with generic traversal strategies that should operate over any type. Strategic programming in a typed setting has much in common with datatype-generic programming. Compared to other approaches to datatype-generic programming, the distinguishing feature of KURE's solution is that the user can configure the behaviour of traversals based on the location of each datum in the tree, beyond their behaviour being determined by the type of each datum. This article describes KURE's approach to assigning types to generic traversals, and the implementation of that approach. We also compare KURE, its design choices, and their consequences, with other approaches to strategic and datatype-generic programming.
Publisher
Cambridge University Press (CUP)
Reference61 articles.
1. O'Connor R. (2011) Functor is to Lens as Applicative is to Biplate: Introducing Multiplate. Workshop on generic programming. Available at http://arxiv.org/abs/1103.2841.
2. Practical type inference for arbitrary-rank types
3. Uniform boilerplate and list processing
4. Dolstra E. & Visser E. (2001) First-Class Rules and Generic Traversal. Tech. rept. UU-CS-2001-38. Utrecht University, Utrecht.
5. Applicative programming with effects
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献