Pattern Matching Semantics
Pattern Matching Semantics is a formal method in interpreter design that specifies the computational behavior of syntactic patterns by defining how they are matched against program constructs and evaluated within a given language framework.
56
Publications
2.1K
Citations
122
Authors
69
Institutions
Publications per year
2017–2026
5
Parents
56
Adding trace matching with free variables to AspectJ
Chris Allan, Pavel Avgustinov, Aske Simon Christensen et al. · 2005 · 427 citations
Computing, Computer Science, History +13
Adding trace matching with free variables to AspectJ
Chris Allan, Pavel Avgustinov, Aske Simon Christensen et al. · ACM SIGPLAN Notices · 2005 · 91 citations
Computing, Computer Science, History +13
ML with extended pattern matching and subtypes
Lalita Jategaonkar, John C. Mitchell · 1988 · 81 citations · Full text
1–5 of 56
122
3
h-index
3
h-index
3
h-index
3
h-index
3
h-index
1–5 of 122
69
Chalmers University of Technology
Gothenburg, Sweden
4 h-index
9 publications
154 citations

Centre National de la Recherche Scientifique
Paris, France
3 h-index
6 publications
120 citations
Stanford University
Stanford, United States
3 h-index
5 publications
158 citations
University of Oxford
Oxford, United Kingdom
3 h-index
15 publications
3.7K citations

Aarhus University
Aarhus, Denmark
2 h-index
2 publications
518 citations
University of Pennsylvania
Philadelphia, United States
2 h-index
2 publications
43 citations
Carnegie Mellon University
Pittsburgh, United States
2 h-index
6 publications
267 citations

McGill University
Montreal, Canada
2 h-index
4 publications
1K citations
1–8 of 69
4 publications · 123 citations
4
h-index
ENTCS · 3 publications · 72 citations
3
h-index
2 publications · 51 citations
2
h-index
2 publications · 109 citations
2
h-index
PVLDB · 2 publications · 81 citations
2
h-index
1–5