Extensible pattern matching via a lightweight language extension
From MaRDI portal
Publication:5168922
DOI10.1145/1291151.1291159zbMATH Open1291.68133OpenAlexW2109795737MaRDI QIDQ5168922FDOQ5168922
Authors: Don Syme, Gregory Neverov, James Margetson
Publication date: 21 July 2014
Published in: Proceedings of the 12th ACM SIGPLAN international conference on Functional programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1291151.1291159
Recommendations
Cited In (12)
- Functional semantics
- Extended pattern matching for embedded languages
- Title not available (Why is that?)
- Pattern matching for the masses using custom notations
- Translation Correctness for First-Order Object-Oriented Pattern Matching
- A new look at pattern matching in abstract data types
- Title not available (Why is that?)
- Pattern matching with abstract data types
- More Efficient Left-to-Right Pattern Matching in Non-sequential Equational Programs
- Extensible algebraic datatypes with defaults
- Statically checkable pattern abstractions
- Gradual refinement. Blending pattern matching with data abstraction
Uses Software
This page was built for publication: Extensible pattern matching via a lightweight language extension
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5168922)