Lambda Calculus
Lambda Calculus is a formal system in mathematical logic and computability theory that belongs to the class of computational models, distinguished by its use of variable binding and substitution to represent computation based on function abstraction and application.
1K
Publications
60.3K
Citations
1.1K
Authors
459
Institutions
Publications per year
2017–2026
78
Variants
λ-Calculus
1K
A formulation of the simple theory of types
Alonzo Church · Journal of Symbolic Logic · 1940 · 1.9K citations
Call-by-name, call-by-value and the λ-calculus
Gordon Plotkin · Theoretical Computer Science · 1975 · 1.2K citations
Ingo Mierswa, Michael Wurst, Ralf Klinkenberg et al. · 2006 · 1K citations
Introduction to Mathematical Logic.
Angelo Margaris, Alonzo Church · American Mathematical Monthly · 1957 · 935 citations
1–5 of 1K
1.1K
17
h-index
16
h-index
14
h-index
13
h-index
13
h-index
1–5 of 1.1K
459
Institut national de recherche en sciences et technologies du numérique
Le Chesnay-Rocquencourt, France
33 h-index
89 publications
4.9K citations

University of Edinburgh
Edinburgh, United Kingdom
28 h-index
56 publications
6.3K citations

Centre National de la Recherche Scientifique
Paris, France
26 h-index
68 publications
2.7K citations
Université Paris Cité
Paris, France
25 h-index
65 publications
2.7K citations
Carnegie Mellon University
Pittsburgh, United States
23 h-index
56 publications
3.2K citations
University of Pennsylvania
Philadelphia, United States
22 h-index
45 publications
4.1K citations
University of Cambridge
Cambridge, United Kingdom
21 h-index
38 publications
2.5K citations

University of Bologna
Bologna, Italy
20 h-index
40 publications
1.3K citations
1–8 of 459
55 publications · 4.2K citations
34
h-index
66 publications · 4K citations
28
h-index
MSCS · 48 publications · 3K citations
25
h-index
31 publications · 1.9K citations
24
h-index
ENTCS · 54 publications · 1.4K citations
23
h-index
1–5