Type Systems
Type Systems is a formal framework in programming language theory that classifies program phrases into types according to their computational behavior, thereby enabling the static detection of errors by enforcing syntactic and semantic correctness constraints during compilation.
8.2K
Publications
460.3K
Citations
8K
Authors
1.5K
Institutions
Publications per year
2017–2026
763
8.2K
The Magma Algebra System I: The User Language
Wieb Bosma, John Cannon, Catherine Playoust · Journal of Symbolic Computation · 1997 · 7.4K citations
Patrick Cousot, Radhia Cousot · 1977 · 6.2K citations
Symbolic execution and program testing
James C. King · Communications of the ACM · 1976 · 3K citations · Full text
1–5 of 8.2K
8K
Microsoft Research (United Kingdom), United Kingdom
89 publications · 7.7K citations
43
h-index
37
h-index
36
h-index
33
h-index
32
h-index
1–5 of 8K
1.5K
Carnegie Mellon University
Pittsburgh, United States
79 h-index
494 publications
36K citations
Institut national de recherche en sciences et technologies du numérique
Le Chesnay-Rocquencourt, France
65 h-index
470 publications
23.5K citations
Microsoft (United States)
Redmond, United States
64 h-index
333 publications
24.8K citations
Microsoft Research (United Kingdom)
Cambridge, United Kingdom
61 h-index
258 publications
17.6K citations
Stanford University
Stanford, United States
60 h-index
219 publications
18.1K citations

University of Edinburgh
Edinburgh, United Kingdom
60 h-index
228 publications
19.3K citations
University of Pennsylvania
Philadelphia, United States
54 h-index
273 publications
20.4K citations
Massachusetts Institute of Technology
Cambridge, United States
53 h-index
243 publications
24.7K citations
1–8 of 1.5K
174 publications · 17.4K citations
67
h-index
488 publications · 22.9K citations
63
h-index
242 publications · 13.8K citations
61
h-index
200 publications · 11.1K citations
52
h-index
96 publications · 6.2K citations
43
h-index
1–5