Big-step Semantics

Big-Step Semantics is a formal method in programming language semantics that belongs to the class of operational semantics and is distinguished by its direct characterization of program evaluation through relations that map an initial configuration to its final result in a single step, typically written in the form ⟨e, σ⟩ ⇓ v, where expressions are evaluated to values under a given state.

56

Publications

2.2K

Citations

88

Authors

55

Institutions

Publications per year

2017–2026

5

Authors

88

  1. OD
    Olivier Danvy

    Aarhus University, Denmark

    8 publications · 369 citations

    8

    h-index

  2. DB
    Dariusz Biernacki

    University of Wrocław, Poland

    5 publications · 171 citations

    5

    h-index

  3. TR
    Tiark Rompf

    École Polytechnique Fédérale de Lausanne, Switzerland

    3 publications · 74 citations

    3

    h-index

  4. WT
    Walid Taha

    Rice University, United States

    3 publications · 278 citations

    3

    h-index

  5. KN
    Keiko Nakata

    Tallinn University of Technology, Estonia

    3 publications · 78 citations

    3

    h-index

1–5 of 88

Venues

  1. Electronic Notes in Theoretical Computer Science

    ENTCS · 9 publications · 225 citations

    9

    h-index

  2. BRICS Report Series

    8 publications · 279 citations

    8

    h-index

  3. ACM SIGPLAN Notices

    5 publications · 109 citations

    5

    h-index

  4. Journal of Functional Programming

    3 publications · 83 citations

    3

    h-index

  5. Proceedings of the ACM on Programming Languages

    PACMPL · 3 publications · 53 citations

    3

    h-index

1–5