Article

Associated types with class

Authors:

Manuel M. T. Chakravarty,

Gabriele Keller,

Simon Peyton Jones,

Simon MarlowAuthors Info & Claims

POPL '05: Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages

Pages 1 - 13

https://doi.org/10.1145/1040305.1040306

Published: 12 January 2005 Publication History

Abstract

Haskell's type classes allow ad-hoc overloading, or type-indexing, of functions. A natural generalisation is to allow type-indexing of data types as well. It turns out that this idea directly supports a powerful form of abstraction called associated types, which are available in C++ using traits classes. Associated types are useful in many applications, especially for self-optimising libraries that adapt their data representations and algorithms in a type-directed manner.In this paper, we introduce and motivate associated types as a rather natural generalisation of Haskell's existing type classes. Formally, we present a type system that includes a type-directed translation into an explicitly typed target language akin to System F; the existence of this translation ensures that the addition of associated data types to an existing Haskell compiler only requires changes to the front end.

References

[1]

Artem Alimarine and Rinus Plasmeijer. A generic programming extension for Clean. In International Workshop on the Implementation of Functional Languages, number 2312 in Lecture Notes in Computer Science, pages 168--185. Springer-Verlag, 2001.]]

Digital Library

[2]

Manuel M. T. Chakravarty and Gabriele Keller. An approach to fast arrays in Haskell. In Johan Jeuring and Simon~Peyton Jones, editors, Lecture notes for The Summer School and Workshop on Advanced Functional Programming 2002, number 2638 in Lecture Notes in Computer Science, 2003.]]

[3]

Kung Chen, Paul Hudak, and Martin Odersky. Parametric type classes. In ACM Conference on Lisp and Functional Programming. ACM Press, 1992.]]

Digital Library

[4]

James Cheney and Ralf Hinze. First-class phantom types. CUCIS TR2003-1901, Cornell University, 2003.]]

[5]

Karl Crary and Stephanie Weirich. Flexible type analysis. In International Conference on Functional Programming, 1999.]]

Digital Library

[6]

Karl Crary, Stephanie Weirich, and Greg Morrisett. Intensional polymorphism in type-erasure semantics. In ACM SIGPLAN International Conference on Functional Programming, pages 301--312. ACM Press, 1998.]]

Digital Library

[7]

Derek Dreyer, Karl Crary, and Robert Harper. A type system for higher-order modules. In Proceedings of the 30th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 236--249, 2003.]]

Digital Library

[8]

Gregory J. Duck, Simon Peyton Jones, Peter J. Stuckey, and Martin Sulzmann. Sound and decidable type inference for functional dependencies. In ESOP;04, LNCS. Springer-Verlag, 2004.]]

[9]

Dominic Duggan. Dynamic typing for distributed programming in polymorphic languages. Transactions on Programming Languages and Systems, 21(1):11--45, 1999.]]

Digital Library

[10]

Karl-Filip Faxén. A static semantics for Haskell. Journal of Functional Programming, 12(4+5), 2002.]]

Digital Library

[11]

Ronald Garcia, Jaakko Jarvi, Andrew Lumsdaine, Jeremy Siek, and Jeremiah Willcock. A comparative study of language support for generic programming. In Proceedings of the 18th ACM SIGPLAN Conference on Object-Oriented Programing, Systems, Languages, and Applications, pages 115--134. ACM Press, 2003.]]

Digital Library

[12]

Cordelia Hall, Kevin Hammond, Simon Peyton Jones, and Philip Wadler. Type classes in Haskell. In European Symposium On Programming, number 788 in LNCS, pages 241--256. Springer-Verlag, 1994.]]

Digital Library

[13]

Robert Harper and John C. Mitchell. Parametricity and variants of Girard's J operator. Information Processing Letters, 70(1):1--5, 1999.]]

Digital Library

[14]

Robert Harper, John C. Mitchell, and Eugenio Moggi. Higher-order modules and the phase distinction. In Proceedings of the 17th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 341--354. ACM Press, 1989.]]

Digital Library

[15]

Robert Harper and Greg Morrisett. Compiling polymorphism using intensional type analysis. In 22nd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 130--141. ACM Press, 1995.]]

Digital Library

[16]

Ralf Hinze. Generalizing generalized tries. Journal of Functional Programming, 10(4):327--351, 2000.]]

Digital Library

[17]

Ralf Hinze and Johan Jeuring. Generic Haskell: Applications. In Roland Backhouse and Jeremy Gibbons, editors, Lecture notes for The Summer School and Workshop on Generic Programming 2002, number 2793 in Lecture Notes in Computer Science, 2003.]]

[18]

Ralf Hinze, Johan Jeuring, and Andres Löh. Type-indexed data types. In Eerke Boiten and Bernhard Möller, editors, Proceedings of the Sixth International Conference on Mathematics of Program Construction (MPC 2002), number 2386 in Lecture Notes in Computer Science, pages 148--174. Springer-Verlag, 2002.]]

Digital Library

[19]

Ralf Hinze and Simon Peyton Jones. Derivable type classes. In Graham Hutton, editor, Proceedings of the 2000 ACM SIGPLAN Haskell Workshop, volume 41.1 of Electronic Notes in Theoretical Computer Science. Elsevier Science, 2001.]]

[20]

Mark P. Jones. Simplifying and improving qualified types. In FPCA '95: Conference on Functional Programming Languages and Computer Architecture. ACM Press, 1995.]]

Digital Library

[21]

Mark P. Jones. A system of constructor classes: Overloading and implicit higher-order polymorphism. Journal of Functional Programming, 5(1), 1995.]]

[22]

Mark P. Jones. Type classes with functional dependencies. In Proceedings of the 9th European Symposium on Programming (ESOP 2000), number 1782 in Lecture Notes in Computer Science. Springer-Verlag, 2000.]]

Digital Library

[23]

Ralf Lämmel. The sketch of a polymorphic symphony. In 2nd International Workshop on Reduction Strategies in Rewriting and Programming (WRS 2002), volume 70 of ENTCS. Elsevier Science, 2002.]]

[24]

Ralf Lämmel and Simon Peyton Jones. Scrap your boilerplate: a practical approach to generic programming. In Proceedings of the ACM SIGPLAN Workshop on Types in Language Design and Implementation (TLDI 2003), pages 26--37, 2003.]]

Digital Library

[25]

Xavier Leroy. Manifest types, modules, and separate compilation. In 21st Symposium Principles of Programming Languages, pages 109--122. ACM Press, 1994.]]

Digital Library

[26]

Andres Löh, Dave Clarke, and Johan Jeuring. Dependency-style Generic Haskell. In Proceedings of the Eighth ACM SIGPLAN International Conference on Functional Programming, pages 141--152. ACM Press, 2003.]]

Digital Library

[27]

Nathan C. Myers. Traits: a new and useful template technique. C++ Report, June 1995.]]

[28]

Matthias Neubauer, Peter Thiemann, Martin Gasbichler, and Michael Sperber. A functional notation for functional dependencies. In 2001 ACM SIGPLAN Haskell Workshop, 2001.]]

[29]

Matthias Neubauer, Peter Thiemann, Martin Gasbichler, and Michael Sperber. Functional logic overloading. In Proceedings of the 29th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages. ACM Press, 2002.]]

Digital Library

[30]

Martin Odersky, Martin Sulzmann, and Martin Wehr. Type inference with constrained types. Theory and Practice of Object Systems, 5(1), 1999.]]

Digital Library

[31]

Chris Okasaki and Andy Gill. Fast mergeable integer maps. In Workshop on ML, pages 77--86, 1998.]]

[32]

Zhong Shao. Flexible representation analysis. In Proceedings ACM SIGPLAN International Conference on Functional Programming, pages 85--98, 1997.]]

Digital Library

[33]

Jeremy G. Siek, Lie-Quan Lee, and Andrew Lumsdaine. The Boost Graph Library User Guide and Reference Manual. Addison-Wesley, 2001.]]

[34]

Jeremy G. Siek and Andrew Lumsdaine. The matrix template library: Generic components for high-performance scientific computing. Computing in Science and Engineering, 1(6):70--78, 1999.]]

Digital Library

[35]

A. A. Stepanov and M. Lee. The standard template library. Technical Report X3J16/94-0095, WG21/N0482, ISO Programming Language C++ Project, 1994.]]

[36]

Peter J. Stuckey and Martin Sulzmann. A theory of overloading. ACM Transaction on Programming Languages and Systems, 2004. To appear.]]

Digital Library

[37]

Stephanie Weirich. Type-safe cast: Functional pearl. In Proceedings of the Fifth ACM SIGPLAN International Conference on Functional Programming (ICFP '00). ACM Press, 2000.]]

Digital Library

[38]

Stephanie Weirich. Higher-order intensional type analysis. In European Symposium on Programming (ESOP02), 2002.]]

Digital Library

[39]

Hongwei Xi, Chiyan Chen, and Gang Chen. Guarded recursive datatype constructors. In Proceedings of the 30th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 224--235. ACM Press, 2003.]]

Digital Library

Cited By

Racordon DLaemmel RPereira JMosses P(2024)Type Checking with Rewriting RulesProceedings of the 17th ACM SIGPLAN International Conference on Software Language Engineering10.1145/3687997.3695640(171-183)Online publication date: 17-Oct-2024
https://dl.acm.org/doi/10.1145/3687997.3695640
Manzino Cde Latorre G(2023)A Haskell-Embedded DSL for Secure Information-FlowFormal Methods: Foundations and Applications10.1007/978-3-031-49342-3_2(20-35)Online publication date: 2-Dec-2023
https://doi.org/10.1007/978-3-031-49342-3_2
HUANG XZHAO JOLIVEIRA B(2021)Taming the Merge OperatorJournal of Functional Programming10.1017/S095679682100018631Online publication date: 2-Nov-2021
https://doi.org/10.1017/S0956796821000186
Show More Cited By

Index Terms

Associated types with class
1. Software and its engineering
  1. Software notations and tools
    1. General programming languages
      1. Language features
2. Theory of computation
  1. Semantics and reasoning
    1. Program constructs
      1. Type structures

Recommendations

Associated type synonyms
ICFP '05: Proceedings of the tenth ACM SIGPLAN international conference on Functional programming

Haskell programmers often use a multi-parameter type class in which one or more type parameters are functionally dependent on the first. Although such functional dependencies have proved quite popular in practice, they express the programmer's intent ...
Associated type synonyms
Proceedings of the tenth ACM SIGPLAN international conference on Functional programming

Haskell programmers often use a multi-parameter type class in which one or more type parameters are functionally dependent on the first. Although such functional dependencies have proved quite popular in practice, they express the programmer's intent ...
Associated types with class
Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages

Haskell's type classes allow ad-hoc overloading, or type-indexing, of functions. A natural generalisation is to allow type-indexing of data types as well. It turns out that this idea directly supports a powerful form of abstraction called associated ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

POPL '05: Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages

January 2005

402 pages

ISBN:158113830X

DOI:10.1145/1040305

General Chair:
Jens Palsberg
University of California, Los Angeles, CA
,
Program Chair:
Martín Abadi
University of California, Santa Cruz, CA

ACM SIGPLAN Notices Volume 40, Issue 1
Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
January 2005
391 pages
ISSN:0362-1340
EISSN:1558-1160
DOI:10.1145/1047659
Issue’s Table of Contents

Copyright © 2005 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 12 January 2005

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Conference

POPL05

Sponsor:

POPL05: The 32nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages 2005

January 12 - 14, 2005

California, Long Beach, USA

Acceptance Rates

Overall Acceptance Rate 860 of 4,328 submissions, 20%

Upcoming Conference

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

144
Total Citations
View Citations
1,017
Total Downloads

Downloads (Last 12 months)25
Downloads (Last 6 weeks)2

Reflects downloads up to 05 Mar 2025

Other Metrics

View Author Metrics

Citations

Cited By

Racordon DLaemmel RPereira JMosses P(2024)Type Checking with Rewriting RulesProceedings of the 17th ACM SIGPLAN International Conference on Software Language Engineering10.1145/3687997.3695640(171-183)Online publication date: 17-Oct-2024
https://dl.acm.org/doi/10.1145/3687997.3695640
Manzino Cde Latorre G(2023)A Haskell-Embedded DSL for Secure Information-FlowFormal Methods: Foundations and Applications10.1007/978-3-031-49342-3_2(20-35)Online publication date: 2-Dec-2023
https://doi.org/10.1007/978-3-031-49342-3_2
HUANG XZHAO JOLIVEIRA B(2021)Taming the Merge OperatorJournal of Functional Programming10.1017/S095679682100018631Online publication date: 2-Nov-2021
https://doi.org/10.1017/S0956796821000186
Bird RGibbons JHinze RHöfner PJeuring JMeertens LMöller BMorgan CSchrijvers TSwierstra WWu N(2021)AlgorithmicsAdvancing Research in Information and Communication Technology10.1007/978-3-030-81701-5_3(59-98)Online publication date: 4-Aug-2021
https://doi.org/10.1007/978-3-030-81701-5_3
Kimura SImai K(2020)Fluent Session Programming in C#Electronic Proceedings in Theoretical Computer Science10.4204/EPTCS.314.6314(61-75)Online publication date: 3-Apr-2020
https://doi.org/10.4204/EPTCS.314.6
Jones MMorris JEisenberg R(2019)Partial type constructors: or, making ad hoc datatypes less ad hocProceedings of the ACM on Programming Languages10.1145/33711084:POPL(1-28)Online publication date: 20-Dec-2019
https://dl.acm.org/doi/10.1145/3371108
Chupin GNilsson HKomendantskaya E(2019)Functional Reactive Programming, restatedProceedings of the 21st International Symposium on Principles and Practice of Declarative Programming10.1145/3354166.3354172(1-14)Online publication date: 7-Oct-2019
https://dl.acm.org/doi/10.1145/3354166.3354172
Pauwels KKarachalias GDerhaeg MSchrijvers TEisenberg R(2019)Bidirectional type class instancesProceedings of the 12th ACM SIGPLAN International Symposium on Haskell10.1145/3331545.3342596(30-43)Online publication date: 8-Aug-2019
https://dl.acm.org/doi/10.1145/3331545.3342596
Kazerounian MGuria SVazou NFoster JVan Horn DMcKinley KFisher K(2019)Type-level computations for Ruby librariesProceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation10.1145/3314221.3314630(966-979)Online publication date: 8-Jun-2019
https://dl.acm.org/doi/10.1145/3314221.3314630
HAMANA M(2019)How to prove decidability of equational theories with second-order computation analyser SOLJournal of Functional Programming10.1017/S095679681900015729Online publication date: 24-Dec-2019
https://doi.org/10.1017/S0956796819000157
Show More Cited By

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Figures

Tables

Media

View Table of Conten