Proceedings of the 2006 ACM SIGPLAN Workshop on Haskell 2006
DOI: 10.1145/1159842.1159848
|View full text |Cite
|
Sign up to set email alerts
|

Polymorphic variants in Haskell

Abstract: In languages that support polymorphic variants, a single variant value can be passed to many contexts that accept different sets of constructors. Polymorphic variants can be used in order to introduce extensible algebraic datatypes into functional programming languages and are potentially useful for application domains such as interpreters, graphical user interface (GUI) libraries and database interfaces, where the number of necessary constructors cannot be determined in advance. Very few functional languages,… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2006
2006
2015
2015

Publication Types

Select...
4
3

Relationship

0
7

Authors

Journals

citations
Cited by 7 publications
(2 citation statements)
references
References 21 publications
0
2
0
Order By: Relevance
“…Choice types are similar to variant types [10], which are used to uniformly manipulate heterogeneous collection of types. A significant difference between the two is that choices (at the expression level) contain all of the information needed for inferring their corresponding choice type.…”
Section: Related Workmentioning
confidence: 99%
“…Choice types are similar to variant types [10], which are used to uniformly manipulate heterogeneous collection of types. A significant difference between the two is that choices (at the expression level) contain all of the information needed for inferring their corresponding choice type.…”
Section: Related Workmentioning
confidence: 99%
“…Choice types are in some ways similar to variant types [Kagawa 2006]. Variant types support the uniform manipulation of a heterogeneous collection of types.…”
Section: Programming Languages and Type Systemsmentioning
confidence: 99%