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

Authors

122

  1. LH
    Laurie Hendren

    McGill University, Canada

    3 publications · 528 citations

    3

    h-index

  2. PA
    Pavel Avgustinov

    University of Oxford, United Kingdom

    3 publications · 528 citations

    3

    h-index

  3. DS
    Damien Sereni

    University of Oxford, United Kingdom

    3 publications · 528 citations

    3

    h-index

  4. CA
    Chris Allan

    University of Dundee, United Kingdom

    3 publications · 528 citations

    3

    h-index

  5. JT
    Julian Tibble

    University of Oxford, United Kingdom

    3 publications · 528 citations

    3

    h-index

1–5 of 122

Venues

  1. Journal of Functional Programming

    4 publications · 123 citations

    4

    h-index

  2. Electronic Notes in Theoretical Computer Science

    ENTCS · 3 publications · 72 citations

    3

    h-index

  3. 2

    h-index

  4. ACM SIGPLAN Notices

    2 publications · 109 citations

    2

    h-index

  5. Proceedings of the VLDB Endowment

    PVLDB · 2 publications · 81 citations

    2

    h-index

1–5