Abstract
The efficient representation and manipulation of data is one of the fundamental tasks in the construction of large software systems. Parametric polymorphism has been one of the most successful approaches to date but, as of yet, has not been applicable to programming with quotient datatypes such as unordered pairs, cyclic lists, bags etc. This paper provides the basis for writing polymorphic programs over quotient datatypes by extending our recently developed theory of containers. © Springer-Verlag 2004.
Cite
CITATION STYLE
Abbott, M., Altenkirch, T., Ghani, N., & McBride, C. (2004). Constructing polymorphic programs with quotient types. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3125, 2–15. https://doi.org/10.1007/978-3-540-27764-4_2
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
