P. Wadler, chapter on the compilation of pattern matching in: S. L. Peyton Jones, "The Implementation of Functional Programming Languages''. Prentice-Hall, 1987.

Google Scholar

[11]

P. Weis, "The CAML Reference manual" Version 2.6.1, INRIA Technical Report 121 1990.

Google Scholar

Cited By

View all

Baudon TRadanne GGonnord L(2023)Bit-Stealing Made Legal: Compilation for Custom Memory Representations of Algebraic Data TypesProceedings of the ACM on Programming Languages10.1145/36078587:ICFP(813-846)Online publication date: 31-Aug-2023
https://dl.acm.org/doi/10.1145/3607858
Smits JHartman TCockx JFischer BBurgueño LCazzola W(2022)Optimising First-Class Pattern MatchingProceedings of the 15th ACM SIGPLAN International Conference on Software Language Engineering10.1145/3567512.3567519(74-83)Online publication date: 29-Nov-2022
https://dl.acm.org/doi/10.1145/3567512.3567519
COCKX JABEL A(2020)Elaborating dependent (co)pattern matching: No pattern left behindJournal of Functional Programming10.1017/S095679681900018230Online publication date: 21-Jan-2020
https://doi.org/10.1017/S0956796819000182
Show More Cited By

Index Terms

Compiling lazy pattern matching
1. Software and its engineering
  1. Software notations and tools
    1. Compilers
    2. General programming languages
      1. Language types
2. Theory of computation
  1. Design and analysis of algorithms
    1. Data structures design and analysis
      1. Pattern matching

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 ...
Read More
Compiling pattern matching by term decomposition
LFP '90: Proceedings of the 1990 ACM conference on LISP and functional programming

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 ...
Read More
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 ...
Read More

Comments

Information & Contributors

Information

Published In

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

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 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

19
Total Citations
View Citations
575
Total Downloads

Downloads (Last 12 months)70
Downloads (Last 6 weeks)4

Other Metrics

View Author Metrics

Citations

Cited By

View all

Baudon TRadanne GGonnord L(2023)Bit-Stealing Made Legal: Compilation for Custom Memory Representations of Algebraic Data TypesProceedings of the ACM on Programming Languages10.1145/36078587:ICFP(813-846)Online publication date: 31-Aug-2023
https://dl.acm.org/doi/10.1145/3607858
Smits JHartman TCockx JFischer BBurgueño LCazzola W(2022)Optimising First-Class Pattern MatchingProceedings of the 15th ACM SIGPLAN International Conference on Software Language Engineering10.1145/3567512.3567519(74-83)Online publication date: 29-Nov-2022
https://dl.acm.org/doi/10.1145/3567512.3567519
COCKX JABEL A(2020)Elaborating dependent (co)pattern matching: No pattern left behindJournal of Functional Programming10.1017/S095679681900018230Online publication date: 21-Jan-2020
https://doi.org/10.1017/S0956796819000182
Kosarev DLozov PBoulytchev D(2020)Relational Synthesis for Pattern MatchingProgramming Languages and Systems10.1007/978-3-030-64437-6_15(293-310)Online publication date: 24-Nov-2020
https://doi.org/10.1007/978-3-030-64437-6_15
Cockx JAbel A(2018)Elaborating dependent (co)pattern matchingProceedings of the ACM on Programming Languages10.1145/32367702:ICFP(1-30)Online publication date: 30-Jul-2018
https://dl.acm.org/doi/10.1145/3236770
Karachalias GSchrijvers TVytiniotis DJones S(2015)GADTs meet their match: pattern-matching warnings that account for GADTs, guards, and lazinessACM SIGPLAN Notices10.1145/2858949.278474850:9(424-436)Online publication date: 29-Aug-2015
https://dl.acm.org/doi/10.1145/2858949.2784748
Karachalias GSchrijvers TVytiniotis DJones SFisher KReppy J(2015)GADTs meet their match: pattern-matching warnings that account for GADTs, guards, and lazinessProceedings of the 20th ACM SIGPLAN International Conference on Functional Programming10.1145/2784731.2784748(424-436)Online publication date: 29-Aug-2015
https://dl.acm.org/doi/10.1145/2784731.2784748
Solodkyy YDos Reis GStroustrup B(2013)Open pattern matching for C++ACM SIGPLAN Notices10.1145/2637365.251722249:3(33-42)Online publication date: 27-Oct-2013
https://dl.acm.org/doi/10.1145/2637365.2517222
Solodkyy YDos Reis GStroustrup BJärvi JKästner C(2013)Open pattern matching for C++Proceedings of the 12th international conference on Generative programming: concepts & experiences10.1145/2517208.2517222(33-42)Online publication date: 27-Oct-2013
https://dl.acm.org/doi/10.1145/2517208.2517222
Carlier MDubois CGotlieb A(2012)A first step in the design of a formally verified constraint-based testing toolProceedings of the 6th international conference on Tests and Proofs10.1007/978-3-642-30473-6_5(35-50)Online publication date: 31-May-2012
https://dl.acm.org/doi/10.1007/978-3-642-30473-6_5
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

Compiling pattern matching by term decomposition

Optimising First-Class Pattern Matching