research-article

Automatic refunctionalization to a language with copattern matching: with applications to the expression problem

Authors:

Tillmann Rendel,

Julia Trieflinger,

Klaus OstermannAuthors Info & Claims

ICFP 2015: Proceedings of the 20th ACM SIGPLAN International Conference on Functional Programming

Pages 269 - 279

https://doi.org/10.1145/2784731.2784763

Published: 29 August 2015 Publication History

Abstract

Defunctionalization and refunctionalization establish a correspondence between first-class functions and pattern matching, but the correspondence is not symmetric: Not all uses of pattern matching can be automatically refunctionalized to uses of higher-order functions. To remedy this asymmetry, we generalize from first-class functions to arbitrary codata. This leads us to full defunctionalization and refunctionalization between a codata language based on copattern matching and a data language based on pattern matching. We observe how programs can be written as matrices so that they are modularly extensible in one dimension but not the other. In this representation, defunctionalization and refunctionalization correspond to matrix transposition which effectively changes the dimension of extensibility a program supports. This suggests applications to the expression problem.

References

[1]

A. Abel, B. Pientka, D. Thibodeau, and A. Setzer. Copatterns: Programming infinite structures by observations. In Proceedings of the Symposium on Principles of Programming Languages, pages 27–38. ACM, 2013.

Digital Library

[2]

M. S. Ager, D. Biernacki, O. Danvy, and J. Midtgaard. A functional correspondence between evaluators and abstract machines. In Proceedings of the Conference on Principles and Practice of Declarative Programming, pages 8–19. ACM, 2003.

Digital Library

[3]

U. B. Berger and H. Schwichtenberg. An inverse of the evaluation functional for typed λ–calculus. In Proceedings of the Symposium on Logic in Computer Science, pages 203–211. IEEE Computer Society, 1991.

[4]

J. Carette, O. Kiselyov, and C. Shan. Finally tagless, partially evaluated: Tagless staged interpreters for simpler typed languages. Journal of Functional Programming, 19(5):509–543, Sept. 2009.

Digital Library

[5]

W. R. Cook. Object-oriented programming versus abstract data types. In Proceedings of the REX Workshop / School on the Foundations of Object-Oriented Languages, pages 151–178. Springer-Verlag, 1990.

Digital Library

[6]

W. R. Cook. On understanding data abstraction, revisited. In Proceedings of the Conference on Object-Oriented Programming, Systems, Languages and Applications, pages 557–572. ACM, 2009.

Digital Library

[7]

O. Danvy and K. Millikin. Refunctionalization at work. Science of Computer Programming, 74(8):534–549, 2009.

Digital Library

[8]

O. Danvy and L. R. Nielsen. Defunctionalization at work. In Proceedings of the Conference on Principles and Practice of Declarative Programming, pages 162–174, 2001.

Digital Library

[9]

P. Hudak. Modular domain specific languages and tools. In Proceedings of the Conference on Software Reuse, pages 134–142. IEEE Computer Society, June 1998.

Digital Library

[10]

D. Janzen and K. de Volder. Programming with crosscutting effective views. In Proceedings of the European Conference on Object-Oriented Programming, pages 195–218. Springer LNCS 3086, 2004.

[11]

R. Lämmel and O. Rypacek. The Expression Lemma. In Proceedings of the Conference on Mathematics of Program Construction. Springer LNCS 5133, July 2008.

Digital Library

[12]

F. Pottier and N. Gauthier. Polymorphic typed defunctionalization and concretization. Higher-Order and Symbolic Computation, 19(1):125– 162, Mar. 2006.

Digital Library

[13]

J. C. Reynolds. Definitional interpreters for higher-order programming languages. In Proceedings of the ACM annual conference, pages 717– 740. ACM, 1972.

Digital Library

[14]

J. C. Reynolds. User-defined types and procedural data structures as complementary approaches to data abstraction. In New Directions in Algorithmic Languages 1975, pages 157–168. IFIP Working Group 2.1 on Algol, INRIA, 1975.

[15]

A. Setzer, A. Abel, B. Pientka, and D. Thibodeau. Unnesting of copatterns. In Proceedings of the Joint Conference on Rewriting Techniques and Applications and Typed Lambda Calculi and Applications, pages 31–45. Springer LNCS 8560, 2014.

[16]

P. Wadler. The expression problem. Note to Java Genericity mailing list, Nov. 1998.

Cited By

Binder DSkupin ISüberkrüb TOstermann K(2024)Deriving Dependently-Typed OOP from First PrinciplesProceedings of the ACM on Programming Languages10.1145/36498468:OOPSLA1(983-1009)Online publication date: 29-Apr-2024
https://dl.acm.org/doi/10.1145/3649846
Chiang DMcDonald CShan C(2023)Exact Recursive Probabilistic ProgrammingProceedings of the ACM on Programming Languages10.1145/35860507:OOPSLA1(665-695)Online publication date: 6-Apr-2023
https://dl.acm.org/doi/10.1145/3586050
Ostermann KBinder DSkupin ISüberkrüb TDownen P(2022)Introduction and elimination, left and rightProceedings of the ACM on Programming Languages10.1145/35476376:ICFP(438-465)Online publication date: 31-Aug-2022
https://dl.acm.org/doi/10.1145/3547637
Show More Cited By

Index Terms

Automatic refunctionalization to a language with copattern matching: with applications to the expression problem
1. Software and its engineering
  1. Software notations and tools
    1. Formal language definitions
    2. General programming languages
      1. Language features
2. Theory of computation
  1. Formal languages and automata theory

Recommendations

Decomposition diversity with symmetric data and codata

The expression problem describes a fundamental trade-off in program design: Should a program's primary decomposition be determined by the way its domain objects are constructed ("functional" decomposition), or by the way they are destructed ("object-...
Automatic refunctionalization to a language with copattern matching: with applications to the expression problem
ICFP '15

Defunctionalization and refunctionalization establish a correspondence between first-class functions and pattern matching, but the correspondence is not symmetric: Not all uses of pattern matching can be automatically refunctionalized to uses of higher-...
Refunctionalization at work

We present the left inverse of Reynolds' defunctionalization and we show its relevance to programming and to programming languages. We propose two methods to transform a program that is almost in defunctionalized form into one that is actually in ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

ICFP 2015: Proceedings of the 20th ACM SIGPLAN International Conference on Functional Programming

August 2015

436 pages

ISBN:9781450336697

DOI:10.1145/2784731

General Chair:
Kathleen Fisher
Tufts University, USA
,
Program Chair:
John Reppy
University of Chicago, USA

ACM SIGPLAN Notices Volume 50, Issue 9
ICFP '15
September 2015
436 pages
ISSN:0362-1340
EISSN:1558-1160
DOI:10.1145/2858949
Editor:
Andy Gill
University of Kansas, Lawrence, KS
Issue’s Table of Contents

Copyright © 2015 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 the author(s) 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

SIGPLAN: ACM Special Interest Group on Programming Languages

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 29 August 2015

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Conference

ICFP'15

Sponsor:

SIGPLAN

ICFP'15: 20th ACM SIGPLAN International Conference on Functional Programming

August 31 - September 2, 2015

BC, Vancouver, Canada

Acceptance Rates

Overall Acceptance Rate 333 of 1,064 submissions, 31%

Upcoming Conference

ICFP '25

Sponsor:
sigplan

ACM SIGPLAN International Conference on Functional Programming

October 12 - 18, 2025

Singapore , Singapore

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

6
Total Citations
View Citations
254
Total Downloads

Downloads (Last 12 months)12
Downloads (Last 6 weeks)3

Reflects downloads up to 13 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

Binder DSkupin ISüberkrüb TOstermann K(2024)Deriving Dependently-Typed OOP from First PrinciplesProceedings of the ACM on Programming Languages10.1145/36498468:OOPSLA1(983-1009)Online publication date: 29-Apr-2024
https://dl.acm.org/doi/10.1145/3649846
Chiang DMcDonald CShan C(2023)Exact Recursive Probabilistic ProgrammingProceedings of the ACM on Programming Languages10.1145/35860507:OOPSLA1(665-695)Online publication date: 6-Apr-2023
https://dl.acm.org/doi/10.1145/3586050
Ostermann KBinder DSkupin ISüberkrüb TDownen P(2022)Introduction and elimination, left and rightProceedings of the ACM on Programming Languages10.1145/35476376:ICFP(438-465)Online publication date: 31-Aug-2022
https://dl.acm.org/doi/10.1145/3547637
Binder DSkupin ILäwen DOstermann KAmin NIII H(2022)Structural refinement typesProceedings of the 7th ACM SIGPLAN International Workshop on Type-Driven Development10.1145/3546196.3550163(15-27)Online publication date: 6-Sep-2022
https://dl.acm.org/doi/10.1145/3546196.3550163
Binder DJabs JSkupin IOstermann K(2019)Decomposition diversity with symmetric data and codataProceedings of the ACM on Programming Languages10.1145/33710984:POPL(1-28)Online publication date: 20-Dec-2019
https://dl.acm.org/doi/10.1145/3371098
Ostermann KJabs J(2018)Dualizing Generalized Algebraic Data Types by Matrix TranspositionProgramming Languages and Systems10.1007/978-3-319-89884-1_3(60-85)Online publication date: 14-Apr-2018
https://doi.org/10.1007/978-3-319-89884-1_3

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.

Media

Figures

Other

Tables

View Table of Contents