Article

Free access

Compiling pattern matching by term decomposition

Authors:

Laurence Puel,

Ascander SuarezAuthors Info & Claims

LFP '90: Proceedings of the 1990 ACM conference on LISP and functional programming

Pages 273 - 281

https://doi.org/10.1145/91556.91670

Published: 01 May 1990 Publication History

PDF eReader

Abstract

We present a method for compiling pattern matching on lazy languages based on previous work of Huet and Lévy and, later on, Laville by coding ambiguous linear sets of patterns using “Term Decomposition”, and producing non ambiguous sets over terms with structural constraints on variables. The method can also be applied on strict languages giving a match algorithm with no useless work when such a match exists.

References

[1]

G, Berry. S6quentialit6 de l'6valuation formelle des lambdaexpressions. In Proc, 3rd International Colloquium on Programming, Paris, March 1978. Dunod.

Google Scholar

[2]

R. Burstall, D. MacQueen, and D. Sannella. Hope: An experimental applicative language. In Lisp and Functional programming conference, pages 136-- 143. ACM, 1980.

Digital Library

Google Scholar

[3]

R. Hatter, R. Milner, and M. Torte. The definition of Standard ML version 2. LFCS Report Series 88-62, University of EAinb~, Department of Computer science, The King's Buildings, Edinburgh EH9 3TZ, Scotland, 1988.

Digital Library

Google Scholar

[4]

G. Huet and J.-J. L,6vy. Call by need computations in non ambiguous linear term rewriting systems. Rapport IRIA Laboria 359, IN, Domaine de Voluceau, Rocquencoun BP105, 78153 Le Chesnay Cedex. FRANCE, 1979.

Google Scholar

[5]

G. Huet and D. Oppen. Equations and rewrite roles: A survey. In R. Book, editor, Formal Language Theory: Perspectives and Open Problems, pages 349-405, New York, 1980. Academic Press.

Crossref

Google Scholar

[6]

A. Laville. Evaluation paresseuse des filtrages avec prioritt~. Application au Langage ML. Th~se, UnJversit6 Paris 7, 1988.

Google Scholar

[7]

A. Laville. Implementation of lazy pattern matching algorithrns. In H. Ganzinger, editor, ESOP'88, pages 298-316. Lecture Notes in Computer Science 300, March 1988.

Digital Library

Google Scholar

[8]

L. Puel. Bons prt~ordres sur les arbres associt~s ti des ensembles in~vitables et preuves de terminaison de systbmes de rt~criture. Thise d'Etat, Universit6 Paris 7, 1987.

Google Scholar

[9]

L. Puel. Embedding with patterns and associated recursive path ordering. In N. Dershowitz, editor, RTA, pages 371-387. ~ture Notes in Computer Science 355, April 1989.

Digital Library

Google Scholar

[10]

P. Weis et al. The CAML reference manual. Available through iNRIA, Domaine de Voluceau, Rocquencourt BP105, 78153 Le Chesnay Cedex. FRANCE, January 1989.

Google Scholar

Cited By

View all

Maranget LSumii E(2008)Compiling pattern matching to good decision treesProceedings of the 2008 ACM SIGPLAN workshop on ML10.1145/1411304.1411311(35-46)Online publication date: 21-Sep-2008
https://dl.acm.org/doi/10.1145/1411304.1411311
Hannan J(2005)Making abstract machines less abstractFunctional Programming Languages and Computer Architecture10.1007/3540543961_29(618-635)Online publication date: 6-Jul-2005
https://doi.org/10.1007/3540543961_29
Leung AMishra P(2005)Reasoning about simple and exhaustive demand in higher-order lazy languagesFunctional Programming Languages and Computer Architecture10.1007/3540543961_16(328-351)Online publication date: 6-Jul-2005
https://doi.org/10.1007/3540543961_16
Show More Cited By

Index Terms

Compiling pattern matching by term decomposition
1. Software and its engineering
  1. Software notations and tools
    1. Compilers
    2. General programming languages
      1. Language types
        Functional languages
2. Theory of computation

Recommendations

Compiling pattern matching to good decision trees
ML '08: Proceedings of the 2008 ACM SIGPLAN workshop on ML

We address the issue of compiling ML pattern matching to compact and efficient decisions trees. Traditionally, compilation to decision trees is optimized by (1) implementing decision trees as dags with maximal sharing; (2) guiding a simple compiler with ...
Optimising First-Class Pattern Matching
SLE 2022: Proceedings of the 15th ACM SIGPLAN International Conference on Software Language Engineering

Pattern matching is a high-level notation for programs to analyse the shape of data, and can be optimised to efficient low-level instructions. The Stratego language uses first-class pattern matching, a powerful form of pattern matching that ...
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.
- ...

Comments

Information & Contributors

Information

Published In

LFP '90: Proceedings of the 1990 ACM conference on LISP and functional programming

May 1990

348 pages

ISBN:089791368X

DOI:10.1145/91556

Chairman:
Gilles Kahn

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]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 May 1990

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

LFP90

Sponsor:

LFP90: ACM Conference on Lisp and Functional Programming

June 27 - 29, 1990

Nice, France

Acceptance Rates

Overall Acceptance Rate 30 of 109 submissions, 28%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

19
Total Citations
View Citations
374
Total Downloads

Downloads (Last 12 months)37
Downloads (Last 6 weeks)5

Reflects downloads up to 11 Aug 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Maranget LSumii E(2008)Compiling pattern matching to good decision treesProceedings of the 2008 ACM SIGPLAN workshop on ML10.1145/1411304.1411311(35-46)Online publication date: 21-Sep-2008
https://dl.acm.org/doi/10.1145/1411304.1411311
Hannan J(2005)Making abstract machines less abstractFunctional Programming Languages and Computer Architecture10.1007/3540543961_29(618-635)Online publication date: 6-Jul-2005
https://doi.org/10.1007/3540543961_29
Leung AMishra P(2005)Reasoning about simple and exhaustive demand in higher-order lazy languagesFunctional Programming Languages and Computer Architecture10.1007/3540543961_16(328-351)Online publication date: 6-Jul-2005
https://doi.org/10.1007/3540543961_16
Jouannaud JSadfi W(2005)Strong sequentiality of left-linear overlapping rewrite systemsConditional and Typed Rewriting Systems10.1007/3-540-60381-6_14(235-246)Online publication date: 25-Jun-2005
https://doi.org/10.1007/3-540-60381-6_14
Puel LSuárez A(2005)Optimal solutions to pattern matching problemsTAPSOFT'93: Theory and Practice of Software Development10.1007/3-540-56610-4_85(501-518)Online publication date: 28-May-2005
https://doi.org/10.1007/3-540-56610-4_85
Pettersson M(2005)A term pattern-match compiler inspired by finite automata theoryCompiler Construction10.1007/3-540-55984-1_24(258-270)Online publication date: 1-Jun-2005
https://doi.org/10.1007/3-540-55984-1_24
Kesner D(2005)Free sequentially in orthogonal order-sorted rewriting systems with constructorsAutomated Deduction—CADE-1110.1007/3-540-55602-8_195(603-617)Online publication date: 8-Jun-2005
https://doi.org/10.1007/3-540-55602-8_195
Kesner D(2005)Pattern matching in order-sorted languagesMathematical Foundations of Computer Science 199110.1007/3-540-54345-7_70(267-276)Online publication date: 8-Jun-2005
https://doi.org/10.1007/3-540-54345-7_70
Kounalis ELugiez D(2005)Compilation of pattern matching with associative-commutative functionsTAPSOFT '9110.1007/3-540-53982-4_4(57-73)Online publication date: 7-Jun-2005
https://doi.org/10.1007/3-540-53982-4_4
Hosoya HPierce B(2003)Regular expression pattern matching for XMLJournal of Functional Programming10.1017/S095679680200441013:6(961-1004)Online publication date: 1-Nov-2003
https://dl.acm.org/doi/10.1017/S0956796802004410
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

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

Cited By

Index Terms

Recommendations

Compiling pattern matching to good decision trees

Optimising First-Class Pattern Matching

Order-preserving pattern matching with scaling

Comments

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Conference

Acceptance Rates

Other Metrics

Article Metrics

Other Metrics

Cited By

PDF

eReader

Login options

Full Access

Abstract

References

Cited By

Index Terms

Recommendations

Compiling pattern matching to good decision trees

Optimising First-Class Pattern Matching

Order-preserving pattern matching with scaling

Comments

Information

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Conference

Acceptance Rates

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations