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
Parents
223
The Semantics of Predicate Logic as a Programming Language
M. H. van Emden, Robert Kowalski · Journal of the ACM · 1976 · 1.5K citations · Full text
Humanities, Computer Science, Logic +16
Semantics of programming languages: structures and techniques
Choice Reviews Online · 1993 · 422 citations
C. A. R. Hoare, Ian J. Hayes, He Jifeng et al. · Communications of the ACM · 1987 · 389 citations · Full text
1–5 of 223
348
5
h-index
4
h-index
4
h-index
4
h-index
3
h-index
1–5 of 348
206
Stanford University
Stanford, United States
11 h-index
14 publications
697 citations
University of Cambridge
Cambridge, United Kingdom
10 h-index
15 publications
461 citations
University of Oxford
Oxford, United Kingdom
8 h-index
14 publications
2.5K citations
Centrum Wiskunde & Informatica
Amsterdam, The Netherlands
5 h-index
5 publications
125 citations
Institut national de recherche en sciences et technologies du numérique
Le Chesnay-Rocquencourt, France
5 h-index
8 publications
237 citations

University of Amsterdam
Amsterdam, The Netherlands
5 h-index
6 publications
170 citations
RWTH Aachen University
Aachen, Germany
5 h-index
6 publications
164 citations

University of Warsaw
Warsaw, Poland
4 h-index
3 publications
113 citations
1–8 of 206
15 publications · 679 citations
14
h-index
6 publications · 226 citations
6
h-index
6 publications · 142 citations
6
h-index
6 publications · 153 citations
6
h-index
6 publications · 179 citations
6
h-index
1–5