Article

Open data types and open functions

Authors:

Ralf HinzeAuthors Info & Claims

PPDP '06: Proceedings of the 8th ACM SIGPLAN international conference on Principles and practice of declarative programming

Pages 133 - 144

https://doi.org/10.1145/1140335.1140352

Published: 10 July 2006 Publication History

Abstract

The problem of supporting the modular extensibility of both data and functions in one programming language at the same time is known as the expression problem. Functional languages traditionally make it easy to add new functions, but extending data (adding new data constructors) requires modifying existing code. We present a semantically and syntactically lightweight variant of open data types and open functions as a solution to the expression problem in the Haskell language. Constructors of open data types and equations of open functions may appear scattered throughout a program with several modules. The intended semantics is as follows: the program should behave as if the data types and functions were closed, defined in one place. The order of function equations is determined by best-fit pattern matching, where a specific pattern takes precedence over an unspecific one. We show that our solution is applicable to the expression problem, generic programming, and exceptions. We sketch two implementations: a direct implementation of the semantics, and a scheme based on mutually recursive modules that permits separate compilation

References

[1]

Wadler, P.: The expression problem. Mail to the java-genericity mailing list (1998).]]

[2]

Chambers, C.: Object-oriented multi-methods in Cecil. In: ECOOP '92: Proceedings of the European Conference on Object-Oriented Programming, Springer-Verlag (1992) 33--56.]]

Digital Library

[3]

Millstein, T., Bleckner, C., Chambers, C.: Modular typechecking for hierarchically extensible datatypes and functions. In: ICFP '02: Proceedings of the seventh ACM SIGPLAN international conference on Functional programming, ACM Press (2002) 110--122.]]

Digital Library

[4]

Flatt, M., Krishnamurthi, S., Felleisen, M.: Classes and mixins. In: POPL '98: Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, ACM Press (1998) 171--183.]]

Digital Library

[5]

Hinze, R.: Generics for the masses. In Fisher, K., ed.: Proceedings of the 2004 International Conference on Functional Programming, Snowbird, Utah, September 19--22, 2004. (2004) 236--243.]]

Digital Library

[6]

Löh, A., Jeuring, J., Clarke, D., Hinze, R., Rodriguez, A., de Wit, J.: The Generic Haskell user's guide, version 1.42 (Coral). Technical Report UU-CS-2005-004, Institute of Information and Computing Sciences, Utrecht University (2005).]]

[7]

Cheney, J., Hinze, R.: A lightweight implementation of generics and dynamics. In: Proceedings of the 2002 ACM SIGPLAN workshop on Haskell, ACM Press (2002) 90--104.]]

Digital Library

[8]

Oliveira, B.C., Gibbons, J.: TypeCase: A design pattern for type-indexed functions. In: Proceedings of the 2005 ACM SIGPLAN workshop on Haskell, ACM Press (2005) 98--109.]]

Digital Library

[9]

Hinze, R., Löh, A., Oliveira, B.C.: "Scrap Your Boilerplate" reloaded. In Hagiya, M., Wadler, P., eds.: Proceedings of FLOPS 2006. Lecture Notes in Computer Science, Springer (2006) Available from http://www.iai.uni-bonn.de/~loeh/SYB0.html.]]

Digital Library

[10]

Daume, H.: Haskell all-in-one. Tool homepage (2003) http://www.isi.edu/~hdaume/HAllInOne/.]]

[11]

Meacham, J.: Jhc. Compiler homepage (2006) http://repetae.net/john/computer/jhc/jhc.html.]]

[12]

Zenger, M., Odersky, M.: Independently extensible solutions to the expression problem. In: Foundations of Object-Oriented Languages (FOOL 2005). (2005).]]

[13]

Zenger, M., Odersky, M.: Extensible algebraic datatypes with defaults. In: Proceedings of the International Conference on Functional Programming (ICFP 2001). (2001).]]

Digital Library

[14]

Torgersen, M.: The expression problem revisited -- four new solutions using generics. In Odersky, M., ed.: Proceedings of ECOOP 2004, Springer (2004) 123--146.]]

[15]

Leroy, X., Doligez, D., Garrigue, J., Rémy, D., Vouillon, J.: The Objective Caml system release 3.09 -- Documentation and user's manual. Institut National de Recherche en Informatique et en Automatique. (2004) Available from http://caml.inria.fr/pub/docs/manual-ocaml/.]]

[16]

Gaster, B.R., Jones, M.P.: A polymorphic type system for extensible records and variants. Technical Report NOTTCS-TR-96-3, Department of Computer Science, University of Nottingham (1996).]]

[17]

Leijen, D.: Extensible records with scoped labels. In: Proceedings of the 2005 Symposium on Trends in Functional Programming (TFP'05). (2005) 297--312.]]

[18]

Garrigue, J.: Code reuse through polymorphic variants. In: Workshop on Foundations of Software Engineering. (2000).]]

[19]

Nordlander, J.: A survey of O'Haskell. Web article (2001) Available from http://www.cs.chalmers.se/~nordland/ohaskell/survey.html.]]

[20]

Kiselyov, O., Lämmel, R.: Haskell's overlooked object system. Draft. Available from http://homepages.cwi.nl/~ralf/OOHaskell/ (2005).]]

[21]

Sheard, T.: Putting Curry-Howard to work. In: Proceedings of the 2005 ACM SIGPLAN workshop on Haskell, ACM Press (2005) 74--85.]]

Digital Library

[22]

Mitchell, N., Runciman, C.: Unfailing Haskell: a static checker for pattern matching. In: Proceedings of the 2005 Symposium on Trends in Functional Programming (TFP'05). (2005) 313--328.]]

[23]

Dijkstra, A., Swierstra, S.D.: Explicit implicit parameters. Technical Report UU-CS-2004-059, Institute of Information and Computing Sciences, Utrecht University (2004).]]

[24]

McBride, C., McKinna, J.: The view from the left. Journal of Functional Programming 14(1) (2004) 69--111.]]

Digital Library

[25]

Hanus, M.: Curry -- An Integrated Functional Logic Language (Version 0.8). (2003) Available from http://www.informatik.uni-kiel.de/~mh/curry/report.html.]]

[26]

Field, A.J., Harrison, P.G.: Functional Programming. Addison-Wesley (1988).]]

[27]

Tullsen, M.: First class patterns. In Pontelli, E., Costa, V.S., eds.: Practical Aspects of Declarative Languages, Second International Workshop. Number 1753 in Lecture Notes in Computer Science, Springer (2000) 1--15.]]

Digital Library

[28]

Stewart, D., Chakravarty, M.M.T.: Dynamic applications from the ground up. In: Haskell '05: Proceedings of the 2005 ACM SIGPLAN workshop on Haskell, ACM Press (2005) 27--38.]]

Digital Library

Cited By

Kravchuk-Kirilyuk AFeng GIskander JZhang YAmin N(2024)Persimmon: Nested Family Polymorphism with Extensible Variant TypesProceedings of the ACM on Programming Languages10.1145/36498368:OOPSLA1(698-724)Online publication date: 29-Apr-2024
https://dl.acm.org/doi/10.1145/3649836
Crichton WKrishnamurthi S(2024)A Core Calculus for Documents: Or, Lambda: The Ultimate DocumentProceedings of the ACM on Programming Languages10.1145/36328658:POPL(667-694)Online publication date: 5-Jan-2024
https://dl.acm.org/doi/10.1145/3632865
Lubbers M(2023)Deep Embedding with ClassTrends in Functional Programming10.1007/978-3-031-21314-4_3(39-58)Online publication date: 1-Jan-2023
https://doi.org/10.1007/978-3-031-21314-4_3
Show More Cited By

Index Terms

Open data types and open functions
1. Software and its engineering
  1. Software notations and tools
    1. General programming languages
      1. Language features

Recommendations

Abstracting extensible data types: or, rows by any other name

We present a novel typed language for extensible data types, generalizing and abstracting existing systems of row types and row polymorphism. Extensible data types are a powerful addition to traditional functional programming languages, capturing ideas ...
Good advice for type-directed programming aspect-oriented programming and extensible generic functions
WGP '06: Proceedings of the 2006 ACM SIGPLAN workshop on Generic programming

Type-directed programming is an important idiom for software design. In type-directed programming the behavior of programs is guided by the type structure of data. It makes it possible to implement many sorts of operations, such as serialization,...
Dynamic optimization for functional reactive programming using generalized algebraic data types
Proceedings of the tenth ACM SIGPLAN international conference on Functional programming

A limited form of dependent types, called Generalized Algebraic Data Types (GADTs), has recently been added to the list of Haskell extensions supported by the Glasgow Haskell Compiler. Despite not being full-fledged dependent types, GADTs still offer ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

PPDP '06: Proceedings of the 8th ACM SIGPLAN international conference on Principles and practice of declarative programming

July 2006

280 pages

ISBN:1595933883

DOI:10.1145/1140335

General Chair:
Annalisa Bossi
Università Ca' Foscari di Venezia, Italy
,
Program Chair:
Michael Maher
National ICT Australia & University of New South Wales, Australia

Copyright © 2006 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: 10 July 2006

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Conference

PPDP06

Sponsor:

PPDP06: Principles and Practice of Declarative Programming

July 10 - 12, 2006

Venice, Italy

Acceptance Rates

Overall Acceptance Rate 230 of 486 submissions, 47%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

42
Total Citations
View Citations
721
Total Downloads

Downloads (Last 12 months)13
Downloads (Last 6 weeks)1

Reflects downloads up to 05 Mar 2025

Other Metrics

View Author Metrics

Citations

Cited By

Kravchuk-Kirilyuk AFeng GIskander JZhang YAmin N(2024)Persimmon: Nested Family Polymorphism with Extensible Variant TypesProceedings of the ACM on Programming Languages10.1145/36498368:OOPSLA1(698-724)Online publication date: 29-Apr-2024
https://dl.acm.org/doi/10.1145/3649836
Crichton WKrishnamurthi S(2024)A Core Calculus for Documents: Or, Lambda: The Ultimate DocumentProceedings of the ACM on Programming Languages10.1145/36328658:POPL(667-694)Online publication date: 5-Jan-2024
https://dl.acm.org/doi/10.1145/3632865
Lubbers M(2023)Deep Embedding with ClassTrends in Functional Programming10.1007/978-3-031-21314-4_3(39-58)Online publication date: 1-Jan-2023
https://doi.org/10.1007/978-3-031-21314-4_3
Lubbers MKoopman PPlasmeijer R(2022)First-Class Data Types in Shallow Embedded Domain-Specific Languages using MetaprogrammingProceedings of the 34th Symposium on Implementation and Application of Functional Languages10.1145/3587216.3587219(1-12)Online publication date: 31-Aug-2022
https://dl.acm.org/doi/10.1145/3587216.3587219
Zhang WOliveira B(2020)Pattern matching in an open worldACM SIGPLAN Notices10.1145/3393934.327812453:9(134-146)Online publication date: 7-Apr-2020
https://dl.acm.org/doi/10.1145/3393934.3278124
Zhang WOliveira B(2020)Castor: Programming with extensible generative visitorsScience of Computer Programming10.1016/j.scico.2020.102449(102449)Online publication date: Mar-2020
https://doi.org/10.1016/j.scico.2020.102449
Paluck GMonagan M(2019)New bivariate Hensel lifting algorithm for n factorsACM Communications in Computer Algebra10.1145/3377006.337702153:3(142-145)Online publication date: 17-Dec-2019
https://dl.acm.org/doi/10.1145/3377006.3377021
Chi BTerui A(2019)The GPGCD algorithm with the Bézout matrixACM Communications in Computer Algebra10.1145/3377006.337701053:3(99-102)Online publication date: 17-Dec-2019
https://dl.acm.org/doi/10.1145/3377006.3377010
Zhang WOliveira BVan Wyk ERompf T(2018)Pattern matching in an open worldProceedings of the 17th ACM SIGPLAN International Conference on Generative Programming: Concepts and Experiences10.1145/3278122.3278124(134-146)Online publication date: 5-Nov-2018
https://dl.acm.org/doi/10.1145/3278122.3278124
Broman DSiek JHenglein FKo H(2017)Gradually typed symbolic expressionsProceedings of the ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation10.1145/3162068(15-29)Online publication date: 25-Dec-2017
https://dl.acm.org/doi/10.1145/3162068
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