Fixed-point Semantics

Fixed-Point Semantics is a formal method in mathematical logic and programming language theory that specifies the meaning of recursive definitions by identifying the least fixed point of a monotone function over a complete lattice, thereby ensuring a consistent and compositional interpretation of self-referential constructs.

223

Publications

12.8K

Citations

348

Authors

206

Institutions

Publications per year

2017–2026

14

Authors

348

  1. ZM
    Zohar Manna

    Stanford University, United States

    5 publications · 258 citations

    5

    h-index

  2. PM
    P. Madhusudan

    University of Illinois Urbana-Champaign, United States

    4 publications · 97 citations

    4

    h-index

  3. AM
    Andrew M. Pitts

    University of Cambridge, United Kingdom

    4 publications · 146 citations

    4

    h-index

  4. MD
    Marc Denecker

    KU Leuven, Belgium

    4 publications · 102 citations

    4

    h-index

  5. JV
    Joost Vennekens

    KU Leuven, Belgium

    3 publications · 86 citations

    3

    h-index

1–5 of 348

Venues

  1. Theoretical Computer Science

    15 publications · 679 citations

    14

    h-index

  2. Theory and Practice of Logic Programming

    6 publications · 226 citations

    6

    h-index

  3. Fundamenta Informaticae

    6 publications · 142 citations

    6

    h-index

  4. SIAM Journal on Computing

    6 publications · 153 citations

    6

    h-index

  5. ACM SIGPLAN Notices

    6 publications · 179 citations

    6

    h-index

1–5