Article

Free access

Views: a way for pattern matching to cohabit with data abstraction

Author:

P. WadlerAuthors Info & Claims

POPL '87: Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages

Pages 307 - 313

https://doi.org/10.1145/41625.41653

Published: 01 October 1987 Publication History

Abstract

Pattern matching and data abstraction are important concepts in designing programs, but they do not fit well together. Pattern matching depends on making public a free data type representation, while data abstraction depends on hiding the representation. This paper proposes the views mechanism as a means of reconciling this conflict. A view allows any type to be viewed as a free data type, thus combining the clarity of pattern matching with the efficiency of data abstraction.

References

[1]

L. Augustsson. A compiler for lazy ML. In Proceedings of the 198~ A CM 5~ntpodum on Lisp and Functional Programminf, pages 218-227, Austin, 1984.

Digital Library

[2]

L. Auguetesoa. Compiling ptttern matching. {n Proceedincs of the Conference on Functiono.l Progmntming L~nfuafes,~nd Computer Archite~iere, Springer-Ver|ag, September 1985.

Digital Library

[3]

R.M. BuretaIl and J. Dsrlington. A transformation system for developing recurelve programs. Journal of the A CM, 24( 1):44-67, January 1977.

Digital Library

[4]

R.S. Bird. An introduction to the theory of lists. In Marktoberdory Workshop on Logics of ProgrammingI August 1985.

[5]

R. Buretall, D. MacQueen, and D. Sanella. Hope: An ezpe~/mental applicatiee lancua~c. Technical Report Report CSR-62-80, Edinburgh University, Computer Science Dept., 1980.

[6]

R.M. Bur~taU. Proving properties of programs by structural induction. The Comp~tter Journal, 12(1), February 1969.

[7]

K. FutMagi, J. A. Goguen, J.-P. Jouannaud, and J. Megeguer. Principles of OBJ2. In A CM Symposium on PrincipleJ of Progmmntinf L~nfltafeg, pages 52-66, January 1985.

Digital Library

[8]

J. Fsirbairn and S. (2. Wray. Code gener&tion techniques for functional languages. In Proceedings of,he I986 A CM Symposium on Lisp and Ptmctional Programming, pages 94- 104, Boston, 1986.

Digital Library

[9]

P. Hudsk and D. Krans. A ~omblnator-baeed compiler for a functional language. In A CM $~/mpo~iam on Principles of Programnting Langttages, pages 121-132, January 1984.

[10]

T. Johnsson. Lambda lifting: transforming programs to recursive equations. In Proceedinfs 1985 Conference on Functional Programmin~ L~ncuage~ and Computer Architecture, Nancy, Prance, 1985.

Digital Library

[11]

L. Meertene. Algorithmlcs: Towards programming as a mathematical activity. In J. W. de Bskker, et. al., editors, Mathematics and Competer Science, North-Holland, 1984.

[12]

S.L. Peyton-Jonee. Implementing Functional Languafes udng Graph Redttction. Prentice-Hall, 1987.

[13]

M.R. Sleep and S. HolmetrBm. A short note concerning lazy reduction rules of append. Sofltvare Practice and Ezpcr/ence, 12(11):1082--4, November 1982.

[14]

S. Thompson. Laws in miranda. In ACM Symposium on Lisp and Functional Programming, pages 1-12, August 1986.

Digital Library

[15]

D.A. Turner. Recuraion equatio~ as a programming language. In J. Darlington, P. Henderson, and D. Turner, editors, Fur, ction~l Procmmming and lt~ Applications, Cambridge University Press, 1981.

[16]

D.A. Turner. Miranda: A non-strict functional language with polymorphic types. In Proceeding8 of t~e Conference on Ftmctional Profmmmin~ I.~nguage~ and Computer Ar- ~ltitectttre, Springer-Verlag, September 1985.

Digital Library

[17]

P.L. Wadler. Compiling pattera matching; Lkt comprehenalone. In {Peyg?}.

Cited By

Cheng LParreaux L(2024)The Ultimate Conditional SyntaxProceedings of the ACM on Programming Languages10.1145/36897468:OOPSLA2(988-1017)Online publication date: 8-Oct-2024
https://dl.acm.org/doi/10.1145/3689746
Zhang YHong S(2024) ReInstancer: An automatic refactoring approach for Instanceof pattern matching Journal of Software: Evolution and Process10.1002/smr.2661Online publication date: 12-Mar-2024
https://doi.org/10.1002/smr.2661
Dameris JRoman RKreminski MEger MCardona-Rivera R(2023)PraxishProceedings of the Nineteenth AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment10.1609/aiide.v19i1.27537(407-415)Online publication date: 8-Oct-2023
https://dl.acm.org/doi/10.1609/aiide.v19i1.27537
Show More Cited By

Index Terms

Views: a way for pattern matching to cohabit with data abstraction

Recommendations

Order-preserving pattern matching with scaling
Abstract
Given a text T and a pattern P, the order-preserving pattern matching (OPPM for short) problem is to find all substrings of T which have the same relative orders as P. Recently, approximate OPPM that allows errors have been studied ...
Highlights
- We propose a novel criteria for approximate order-preserving pattern matching.
- ...
Exact online two-dimensional pattern matching using multiple pattern matching algorithms

Baker and Bird and Baeza-Yates and Regnier are two of the most efficient and widely used algorithms for exact online two-dimensional pattern matching. Both use the automaton of the Aho-Corasick multiple pattern matching algorithm to locate all the ...
Pattern Matching with Flexible Wildcards and Recurring Characters
GRC '10: Proceedings of the 2010 IEEE International Conference on Granular Computing

Pattern matching is an important task, which is widely used in many fields, such as information retrieval and bioinformatics. Recently, a much more flexible pattern matching problem with wildcards has been proposed. Chen et al. introduced local ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

POPL '87: Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages

October 1987

326 pages

ISBN:0897912152

DOI:10.1145/41625

Copyright © 1987 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

SIGPLAN: ACM Special Interest Group on Programming Languages

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 October 1987

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

POPL87

Sponsor:

SIGPLAN

POPL87: Fourteenth Annual ACM SIGACT-SIGPLAN Symposium on Prnciples of Programming Languages

January 21 - 23, 1987

Munich, West Germany

Acceptance Rates

POPL '87 Paper Acceptance Rate 29 of 108 submissions, 27%;

Overall Acceptance Rate 824 of 4,130 submissions, 20%

Upcoming Conference

POPL '25

Sponsor:
sigplan

The 52nd Annual ACM SIGPLAN Symposium on Principles of Programming Languages

January 19 - 25, 2025

Denver , CO , USA

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

174
Total Citations
View Citations
1,045
Total Downloads

Downloads (Last 12 months)102
Downloads (Last 6 weeks)20

Reflects downloads up to 12 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Cheng LParreaux L(2024)The Ultimate Conditional SyntaxProceedings of the ACM on Programming Languages10.1145/36897468:OOPSLA2(988-1017)Online publication date: 8-Oct-2024
https://dl.acm.org/doi/10.1145/3689746
Zhang YHong S(2024) ReInstancer: An automatic refactoring approach for Instanceof pattern matching Journal of Software: Evolution and Process10.1002/smr.2661Online publication date: 12-Mar-2024
https://doi.org/10.1002/smr.2661
Dameris JRoman RKreminski MEger MCardona-Rivera R(2023)PraxishProceedings of the Nineteenth AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment10.1609/aiide.v19i1.27537(407-415)Online publication date: 8-Oct-2023
https://dl.acm.org/doi/10.1609/aiide.v19i1.27537
Flatt MAllred TAngle NDe Gabrielle SFindler RFirth JGopinathan KGreenman BKasivajhula SKnauth AMcCarthy JPhillips SPorncharoenwase SSøgaard JTobin-Hochstadt S(2023)Rhombus: A New Spin on Macros without All the ParenthesesProceedings of the ACM on Programming Languages10.1145/36228187:OOPSLA2(574-603)Online publication date: 16-Oct-2023
https://dl.acm.org/doi/10.1145/3622818
Allais G(2023)Builtin Types Viewed as Inductive FamiliesProgramming Languages and Systems10.1007/978-3-031-30044-8_5(113-139)Online publication date: 22-Apr-2023
https://dl.acm.org/doi/10.1007/978-3-031-30044-8_5
Prott KTeegen FChristiansen J(2023)Embedding Functional Logic Programming in Haskell via a Compiler PluginPractical Aspects of Declarative Languages10.1007/978-3-031-24841-2_3(37-55)Online publication date: 8-Jan-2023
https://doi.org/10.1007/978-3-031-24841-2_3
Egi SKawata AKori MOgawa H(2022)Embedding Non-linear Pattern Matching with Backtracking for Non-free Data Types into HaskellNew Generation Computing10.1007/s00354-022-00177-z40:2(481-506)Online publication date: 1-Jul-2022
https://dl.acm.org/doi/10.1007/s00354-022-00177-z
Hinze RSwierstra W(2022)Calculating DatastructuresMathematics of Program Construction10.1007/978-3-031-16912-0_3(62-101)Online publication date: 22-Sep-2022
https://doi.org/10.1007/978-3-031-16912-0_3
Teegen FPrott KBunkenburg NHage J(2021)Haskell⁻¹: automatic function inversion in HaskellProceedings of the 14th ACM SIGPLAN International Symposium on Haskell10.1145/3471874.3472982(41-55)Online publication date: 18-Aug-2021
https://dl.acm.org/doi/10.1145/3471874.3472982
ALLAIS GATKEY RCHAPMAN JMCBRIDE CMCKINNA J(2021)A type- and scope-safe universe of syntaxes with binding: their semantics and proofsJournal of Functional Programming10.1017/S095679682000007631Online publication date: 19-Oct-2021
https://doi.org/10.1017/S0956796820000076
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

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