Proceedings of the Seventh ACM SIGPLAN Workshop on Generic Programming 2011
DOI: 10.1145/2036918.2036924
|View full text |Cite
|
Sign up to set email alerts
|

Generic programming for indexed datatypes

Abstract: An indexed datatype is a type that uses a parameter as a type-level tag; a typical example is the type of vectors, which are indexed over a type-level natural number encoding their length. Since the introduction of generalised algebraic datatypes, indexed datatypes have become commonplace in Haskell. Values of indexed datatypes are often more involved than values of plain datatypes, and programmers would benefit from having generic programs on indexed datatypes. However, no generic programming library adequate… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
6
0

Year Published

2011
2011
2018
2018

Publication Types

Select...
5
1

Relationship

2
4

Authors

Journals

citations
Cited by 7 publications
(6 citation statements)
references
References 18 publications
0
6
0
Order By: Relevance
“…The open design of the library enables the user to define his own views. In addition to the low level view, we have included the sum-of-products view underlying the LIGD library [8] and Instant-Generics [7,27], the spine view underlying the SYB library [18] and the list-of-constructors view underlying RepLib [38].…”
Section: Viewsmentioning
confidence: 99%
“…The open design of the library enables the user to define his own views. In addition to the low level view, we have included the sum-of-products view underlying the LIGD library [8] and Instant-Generics [7,27], the spine view underlying the SYB library [18] and the list-of-constructors view underlying RepLib [38].…”
Section: Viewsmentioning
confidence: 99%
“…These same techniques convey the majority of the reusability of our hcompos function; our extensions just enable its heterogeneity. We believe that our extensions can also be applied to more expressive variants of instant-generics, including generic-deriving [12] and indexed data types (a subset of GADTs) [11].…”
Section: Background: Instant-genericsmentioning
confidence: 99%
“…In particular, nested recursion [1] and GADTs are crucial to encoding many interesting properties, such as well-scoped and/or well-typed term representations. While some uses of these features can be forced into the yoko representation types, current research, like that of Magalhães and Jeuring [11], is investigating more natural representations. One derivative of instant-generics that is better suited for these features is generic-deriving [12], which was recently integrated with GHC.…”
Section: Related Workmentioning
confidence: 99%
“…We plan to see if the extensions to instant-generics reported by Magalhães and Jeuring (2011) allow us to continue using generic programming for our model.…”
Section: Mode and Keymentioning
confidence: 99%