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
Parents
52
Peter Ørbæk, Jens Palsberg · Journal of Functional Programming · 1997 · 98 citations · Full text
Jens Palsberg, Peter Ørbæk · 1995 · 86 citations
1–5 of 52
80
4
h-index
3
h-index
Istituti di Ricovero e Cura a Carattere Scientifico, Italy
3 publications · 139 citations
3
h-index
2
h-index
2
h-index
1–5 of 80
57
Université Paris Cité
Paris, France
5 h-index
8 publications
467 citations

University of Bologna
Bologna, Italy
5 h-index
8 publications
117 citations

Centre National de la Recherche Scientifique
Paris, France
4 h-index
9 publications
543 citations

Technische Universität Darmstadt
Darmstadt, Germany
3 h-index
3 publications
46 citations
Carnegie Mellon University
Pittsburgh, United States
3 h-index
5 publications
134 citations

University of Oslo
Oslo, Norway
3 h-index
3 publications
47 citations
University at Albany, State University of New York
Albany, United States
2 h-index
2 publications
39 citations
Université Sorbonne Paris Nord
Villetaneuse, France
2 h-index
2 publications
91 citations
1–8 of 57
4 publications · 194 citations
4
h-index
3 publications · 57 citations
3
h-index
MSCS · 3 publications · 101 citations
3
h-index
3 publications · 101 citations
3
h-index
2 publications · 25 citations
2
h-index
1–5