Lambda Abstraction
Lambda abstraction is a formal syntactic operation in logic and semantics that, within truth-conditional compositional frameworks, introduces a bound variable to construct a predicate or function from a formula, thereby enabling the representation of meaning components with variable-bearing expressions that can be applied or evaluated in context.
48
Publications
2.3K
Citations
83
Authors
55
Institutions
Publications per year
2017–2026
4
48
Full Abstraction in the Lazy Lambda Calculus
Samson Abramsky, C.-H. Luke Ong · Information and Computation · 1993 · 238 citations
Full functional verification of linked data structures
Karen Zee, Viktor Kunčak, Martin Rinard · 2008 · 202 citations · Full text
The call-by-need lambda calculus
Zena M. Ariola, Matthias Felleisen · Journal of Functional Programming · 1997 · 173 citations · Full text
de Bruijn notation as a nested datatype
Richard Bird, Ross Paterson · Journal of Functional Programming · 1999 · 146 citations · Full text
1–5 of 48
83
4
h-index
4
h-index
3
h-index
3
h-index
3
h-index
1–5 of 83
55
Institut national de recherche en sciences et technologies du numérique
Le Chesnay-Rocquencourt, France
3 h-index
3 publications
59 citations
Iowa State University
Ames, United States
3 h-index
3 publications
64 citations
École Polytechnique Fédérale de Lausanne
Lausanne, Switzerland
2 h-index
2 publications
238 citations

University of Wrocław
Wroclaw, Poland
2 h-index
6 publications
144 citations
University of Oxford
Oxford, United Kingdom
2 h-index
3 publications
394 citations

Aarhus University
Aarhus, Denmark
2 h-index
2 publications
41 citations
Ca' Foscari University of Venice
Venice, Italy
2 h-index
2 publications
36 citations
Brown University
Providence, United States
2 h-index
2 publications
53 citations
1–8 of 55
6 publications · 500 citations
6
h-index
ENTCS · 3 publications · 39 citations
3
h-index
3 publications · 50 citations
3
h-index
MSCS · 2 publications · 23 citations
2
h-index
2 publications · 306 citations
2
h-index
1–5