Generic programming in 3D

Hinze, Ralf; Löh, Andres

doi:10.1016/j.scico.2007.10.006

Cited by 18 publications

(19 citation statements)

References 32 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Typically the object language is a programming or document-markup language, but the ideas generalise to any tree-structured data. The term generic programming has multiple meanings (Gibbons, 2003), but in this article we always mean datatype-generic programming (also known as polytypic programming) (Hinze & Löh, 2007;Rodriguez Yakushev et al, 2008;Hinze & Löh, 2009). This notion of generic programming involves defining functions that operate over typed data, but that operate based on the shape of the data rather than its type.…”

Section: Strategic and Generic Programmingmentioning

confidence: 99%

The Kansas University rewrite engine

Sculthorpe¹,

Frisby²,

Gill³

2014

J. Funct. Prog.

View full text Add to dashboard Cite

When 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.

show abstract

Section: Strategic and Generic Programmingmentioning

confidence: 99%

The Kansas University rewrite engine

Sculthorpe¹,

Frisby²,

Gill³

2014

J. Funct. Prog.

View full text Add to dashboard Cite

show abstract

“…The idea of generic programming in dependent type theory via universes has seen much attention since it was originally proposed [17,21,14,6]. This tutorial covers only one part of what is possible in a dependently typed language.…”

Section: Related Workmentioning

confidence: 99%

Generic Programming with Dependent Types

Weirich

Casinghino

2012

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. Some programs are doubly generic. For example, map is datatype-generic in that many different data structures support a mapping operation. A generic programming language like Generic Haskell can use a single definition to generate map for each type. However, map is also arity-generic because it belongs to a family of related operations that differ in the number of arguments. For lists, this family includes familiar functions from the Haskell standard library (such as repeat, map, and zipWith).This tutorial explores these forms of genericity individually and together. These two axes are not orthogonal: datatype-generic versions of repeat, map and zipWith have different arities of kind-indexed types. We explore these forms of genericity in the context of the Agda programming language, using the expressiveness of dependent types to capture both forms of genericity in a common framework. Therefore, this tutorial serves as an introduction to dependently typed languages as well as generic programming.The target audience of this work is someone who is familiar with functional programming languages, such as Haskell or ML, but would like to learn about dependently typed languages. We do not assume prior experience with Agda, type-or arity-generic programming.

show abstract

“…Different approaches to generic programming differ in the language that is used to represent types [14]. PolyP [16], for instance, is based on a grammar for bifunctors and regular functors.…”

Section: The Simply-typed Lambda Calculusmentioning

confidence: 99%

“…There is a considerable body of work on datatype-generic programming (DGP), see [14,24] for recent overviews. PolyP [16], one of the first languages with support for DGP, grew out of the work on the Algebra of Programming [19,21].…”

Section: Related Workmentioning

confidence: 99%

Towards a categorical foundation for generic programming

Hinze

Wu²

2011

Proceedings of the Seventh ACM SIGPLAN Workshop on Generic Programming

Self Cite

View full text Add to dashboard Cite

Generic Haskell is an extension of Haskell that supports datatypegeneric programming. The central idea of Generic Haskell is to interpret a type by a function, the so-called instance of a generic function at that type. Since types in Haskell include parametric types such as 'list of', Generic Haskell represents types by terms of the simply-typed lambda calculus. This paper puts the idea of interpreting types as functions on a firm theoretical footing, exploiting the fact that the simply-typed lambda calculus can be interpreted in a cartesian closed category. We identify a suitable target category, a subcategory of Cat, and argue that slice, coslice and comma categories are a good fit for interpreting generic functions at base types.

show abstract

Generic programming in 3D

Cited by 18 publications

References 32 publications

The Kansas University rewrite engine

The Kansas University rewrite engine

Generic Programming with Dependent Types

Towards a categorical foundation for generic programming

Contact Info

Product

Resources

About