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

Authors

83

  1. AS
    Antonino Salibra

    Ca' Foscari University of Venice, Italy

    4 publications · 77 citations

    4

    h-index

  2. PC
    Paris C. Kanellakis

    Brown University, United States

    4 publications · 84 citations

    4

    h-index

  3. DP
    Don Pigozzi

    Iowa State University, United States

    3 publications · 64 citations

    3

    h-index

  4. MJ
    Murdoch J. Gabbay

    Heriot-Watt University, United Kingdom

    3 publications · 34 citations

    3

    h-index

  5. DP
    Dominic P. Mulligan

    University of Cambridge, United Kingdom

    3 publications · 34 citations

    3

    h-index

1–5 of 83

Venues

  1. Journal of Functional Programming

    6 publications · 500 citations

    6

    h-index

  2. Electronic Notes in Theoretical Computer Science

    ENTCS · 3 publications · 39 citations

    3

    h-index

  3. Fundamenta Informaticae

    3 publications · 50 citations

    3

    h-index

  4. Mathematical Structures in Computer Science

    MSCS · 2 publications · 23 citations

    2

    h-index

  5. Information and Computation

    2 publications · 306 citations

    2

    h-index

1–5