Article

Free access

Parametric type classes

Authors:

Martin OderskyAuthors Info & Claims

LFP '92: Proceedings of the 1992 ACM conference on LISP and functional programming

Pages 170 - 181

https://doi.org/10.1145/141471.141536

Published: 01 January 1992 Publication History

Abstract

We propose a generalization to Haskell's type classes where a class can have type parameters besides the placeholder variable. We show that this generalization is essential to represent container classes with overloaded data constructor and selector operations. We also show that the resulting type system has principal types and present unification and type reconstruction algorithms.

References

[1]

P. Canning, W. Cook, W. Hill, W. Olthoff, and J. Mitchell. F-bounded polymorphism for objectoriented programming. In Proc. A CM Conf. Functional Programming Languages and Computer Architecture, pages 273-280, 1989.

Digital Library

[2]

Kung Chen, Martin Odersky, and Paul Hudak. Type inference for parametric type classes. Technical Report YALEU/DCS/RR-900, Dept. of Computer Science, Yale University, New Haven, Conn., May 1992.

[3]

Craig Chambers and David Ungax. Iterative type analysis and extended message splitting: Optimizing dynamically-typed object-oriented programs. In Proc. SIGPLAN '90 Conf. on Programming Language Design and Implementation, White Plains, New York, June 1990.

Digital Library

[4]

L. Damas and R. Milner. Principal type schemes for functional programs. In Proc. 9th A CM Syrup. on Principles of Programm2ng Languages, pages 207- 212, Jan. 1982.

Digital Library

[5]

Paul Hudak, Simon Peyton Jones, and Philip L. Wadler. Report on the programming language Haskell: a non-strict, purely functional language, version 1.1. Technical Report YALEU/DCS/RR-777, Dept. of Computer Science, Yale University, New Haven, Conn., August 1991.

[6]

Mark P. Jones. Type inference for qualified types. Technical Report PRG-TR-10-91, Oxford University Computing Laboratory, Oxford~ UK~ 1991.

[7]

Mark P. Jones. Coherence for qualified types. Private communication, March 1992.

[8]

Mark P. Jones. A theory of qualified types. In B. Krieg-Br{ickner, editor, Proco European Sysposium on Programming, pages 287-306~ Springer Verlag, Feburary 1992. LNCS 582.

[9]

R.D. Jenks and B.M. Trager. A language for computational algebra. In Proc. A CM Symposium on Symbolic and Algebraic Manipulation, pages 22-29, 1981.

Digital Library

[10]

S. Kaes. Parametric overloading in polymorphic programming languages. In H. Ganzinger, editor, Proc. and European Symosium on Programming, Lecture Notes in Computer Science, Vol. 300, pages 131-144, Nancy, France, March 1988. Springer~Verlag.

Digital Library

[11]

Mark D. Lilibridge. A generalization of type classes. distributed to HaskeU mailing llst, June 1991.

[12]

J. Meseguer~ J. Goguen, and G. Smolka. Ordersorted unification. J. Symbolic Computation, 8:383- 413, 1989.

Digital Library

[13]

T. Nipkow and G. Snelting. Type classes and overloading resolution via order-sorted unification. In J. Hughes, editor, Proc. Con}. on Functional Programming and Computer Architecture, pages 15-28. Springer-Verlag, 1991. LNCS 523.

Digital Library

[14]

J. Robinson. A machine-oriented logic based on the resolution principle, d. Assoc. Comput. Mach., 12(1):23-41, 1965.

Digital Library

[15]

Francois Rouaix. Safe run-time overloading. In Seventeenth Annual A GM Syrup. on Principles of Programming Languages, pages 355-366, San Franscico, CA, January 1990.

Digital Library

[16]

Dennis M. Volpano and Geoffery S. Smith. On the complexity of ML typabillty and overloading. In J. Hughes, editor, Proceedings of Functional Programming and Computer Architecture, pages 15-28. Springer-Verlag, 1991. LNCS 523.

Digital Library

[17]

P. Wadler. Comprehending monads. In Proc. A CM Conf. on LISP and Functional Programming, pages 61-78, June 1990.

Digital Library

[18]

P. Wadler. Continuing monads, August 1991. Tutorial Notes at FPCA'91.

[19]

Phil Wadler and Stephen Blott. How to make adhoc polymorphism less ad hoc. In Sixteenth Annual A CM Syrup. on Principles of Programming Languages, pages 60-76. ACM, 1989.

Digital Library

Cited By

Lutze MMadsen M(2024)Associated Effects: Flexible Abstractions for Effectful ProgrammingProceedings of the ACM on Programming Languages10.1145/36563938:PLDI(394-416)Online publication date: 20-Jun-2024
https://dl.acm.org/doi/10.1145/3656393
Lima Graf JKrstić SSchneider J(2023)Metric First-Order Temporal Logic with Complex Data TypesRuntime Verification10.1007/978-3-031-44267-4_7(126-147)Online publication date: 1-Oct-2023
https://doi.org/10.1007/978-3-031-44267-4_7
Lammich PLochbihler A(2019)Automatic Refinement to Efficient Data StructuresJournal of Automated Reasoning10.1007/s10817-018-9461-963:1(53-94)Online publication date: 1-Jun-2019
https://dl.acm.org/doi/10.1007/s10817-018-9461-9
Show More Cited By

Index Terms

Parametric type classes
1. Software and its engineering
  1. Software notations and tools
    1. General programming languages
      1. Language features
      2. Language types
        Functional languages
2. Theory of computation
  1. Semantics and reasoning
    1. Program constructs
      1. Functional constructs
      2. Type structures

Recommendations

A parametric extension of Haskell's type classes
Static type inference for parametric classes
OOPSLA '89: Conference proceedings on Object-oriented programming systems, languages and applications

Central features of object-oriented programming are method inheritance and data abstraction attained through hierarchical organization of classes. Recent studies show that method inheritance can be nicely supported by ML style type inference when ...
Static type inference for parametric classes
Special issue: Proceedings of the 1989 ACM OOPSLA conference on object-oriented programming

Central features of object-oriented programming are method inheritance and data abstraction attained through hierarchical organization of classes. Recent studies show that method inheritance can be nicely supported by ML style type inference when ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM Conferences

LFP '92: Proceedings of the 1992 ACM conference on LISP and functional programming

January 1992

365 pages

ISBN:0897914813

DOI:10.1145/141471

Chairman:
Jon L. White
Lucid, Inc.

ACM SIGPLAN Lisp Pointers Volume V, Issue 1
Jan. 1992
357 pages
ISSN:1045-3563
DOI:10.1145/141478
Editor:
Jon L. White
Lucid, Inc.
Issue’s Table of Contents

Copyright © 1992 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: 01 January 1992

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

LFP92

Sponsor:

LFP92: ACM Conference on Lisp and Functional Programming

June 22 - 24, 1992

California, San Francisco, USA

Acceptance Rates

Overall Acceptance Rate 30 of 109 submissions, 28%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

47
Total Citations
View Citations
676
Total Downloads

Downloads (Last 12 months)92
Downloads (Last 6 weeks)30

Reflects downloads up to 22 Sep 2024

Other Metrics

View Author Metrics

Citations

Cited By

Lutze MMadsen M(2024)Associated Effects: Flexible Abstractions for Effectful ProgrammingProceedings of the ACM on Programming Languages10.1145/36563938:PLDI(394-416)Online publication date: 20-Jun-2024
https://dl.acm.org/doi/10.1145/3656393
Lima Graf JKrstić SSchneider J(2023)Metric First-Order Temporal Logic with Complex Data TypesRuntime Verification10.1007/978-3-031-44267-4_7(126-147)Online publication date: 1-Oct-2023
https://doi.org/10.1007/978-3-031-44267-4_7
Lammich PLochbihler A(2019)Automatic Refinement to Efficient Data StructuresJournal of Automated Reasoning10.1007/s10817-018-9461-963:1(53-94)Online publication date: 1-Jun-2019
https://dl.acm.org/doi/10.1007/s10817-018-9461-9
Lochbihler A(2013)Light-Weight containers for isabelleProceedings of the 4th international conference on Interactive Theorem Proving10.1007/978-3-642-39634-2_11(116-132)Online publication date: 22-Jul-2013
https://dl.acm.org/doi/10.1007/978-3-642-39634-2_11
Jones MDiatchki I(2008)Language and program design for functional dependenciesACM SIGPLAN Notices10.1145/1543134.141129844:2(87-98)Online publication date: 25-Sep-2008
https://dl.acm.org/doi/10.1145/1543134.1411298
Jones MDiatchki IGill A(2008)Language and program design for functional dependenciesProceedings of the first ACM SIGPLAN symposium on Haskell10.1145/1411286.1411298(87-98)Online publication date: 25-Sep-2008
https://dl.acm.org/doi/10.1145/1411286.1411298
Läufer K(2008)Type classes with existential typesJournal of Functional Programming10.1017/S09567968000018176:03(485-518)Online publication date: 7-Nov-2008
https://doi.org/10.1017/S0956796800001817
Jones M(2008)A system of constructor classes: overloading and implicit higher-order polymorphismJournal of Functional Programming10.1017/S09567968000012105:01(1-35)Online publication date: 7-Nov-2008
https://doi.org/10.1017/S0956796800001210
Hudak PHughes JPeyton Jones SWadler PRyder BHailpern B(2007)A history of HaskellProceedings of the third ACM SIGPLAN conference on History of programming languages10.1145/1238844.1238856(12-1-12-55)Online publication date: 9-Jun-2007
https://dl.acm.org/doi/10.1145/1238844.1238856
Sulzmann MDuck GPeyton-Jones SStuckey P(2007)Understanding functional dependencies via constraint handling rulesJournal of Functional Programming10.1017/S095679680600613717:1(83-129)Online publication date: 1-Jan-2007
https://dl.acm.org/doi/10.1017/S0956796806006137
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Get Access

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

Media

Figures

Other

Tables

View Table of Contents