Higher-order Computability

Higher-Order Computability is a theoretical framework within computability theory that extends the scope of computation to include functions and functionals operating on higher-type objects, such as functions of functions, thereby enabling the study of computability over abstract data types beyond natural numbers.

52

Publications

1.6K

Citations

80

Authors

57

Institutions

Publications per year

2017–2026

11

Authors

80

  1. UD
    Ugo Dal Lago

    University of Bologna, Italy

    4 publications · 72 citations

    4

    h-index

  2. SS
    Sam Sanders

    Technische Universität Darmstadt, Germany

    3 publications · 54 citations

    3

    h-index

  3. MP
    Michele Pagani

    Istituti di Ricovero e Cura a Carattere Scientifico, Italy

    3 publications · 139 citations

    3

    h-index

  4. FP
    Frank Pfenning

    Carnegie Mellon University, United States

    2 publications · 39 citations

    2

    h-index

  5. DM
    Damiano Mazza

    Centre National de la Recherche Scientifique, France

    2 publications · 63 citations

    2

    h-index

1–5 of 80

Venues

  1. Information and Computation

    4 publications · 194 citations

    4

    h-index

  2. Journal of Logic and Computation

    3 publications · 57 citations

    3

    h-index

  3. Mathematical Structures in Computer Science

    MSCS · 3 publications · 101 citations

    3

    h-index

  4. Journal of Automated Reasoning

    3 publications · 101 citations

    3

    h-index

  5. Archive for Mathematical Logic

    2 publications · 25 citations

    2

    h-index

1–5