Recursion Schemes
Recursion Schemes is a formal framework in functional programming that abstracts common patterns of recursive data type traversal and manipulation by expressing them as structured morphisms over fixed-point functors, thereby separating recursion logic from business logic.
312
Publications
15.8K
Citations
532
Authors
294
Institutions
Publications per year
2017–2026
27
Parents
312
General recursive functions of natural numbers
S. C. Kleene · Mathematische Annalen · 1936 · 595 citations
Magic sets and other strange ways to implement logic programs (extended abstract)
François Bancilhon, David Maier, Yehoshua Sagiv et al. · 1985 · 534 citations
Instantons and recursion relations in N = 2 SUSY gauge theory
Marco Matone · Physics Letters B · 1995 · 368 citations · Full text
Natural Sciences, Physics, Algebra +13
1–5 of 312
532
13
h-index
12
h-index
5
h-index
5
h-index
5
h-index
1–5 of 532
294
University of Oxford
Oxford, United Kingdom
15 h-index
36 publications
1.7K citations

Centre National de la Recherche Scientifique
Paris, France
11 h-index
18 publications
585 citations

Tohoku University
Sendai, Japan
9 h-index
18 publications
1.3K citations
Université Paris Cité
Paris, France
8 h-index
12 publications
410 citations

University of Warsaw
Warsaw, Poland
8 h-index
14 publications
545 citations
Institut national de recherche en sciences et technologies du numérique
Le Chesnay-Rocquencourt, France
6 h-index
8 publications
218 citations
University of California, Los Angeles
Los Angeles, United States
6 h-index
9 publications
887 citations
Stanford University
Stanford, United States
6 h-index
14 publications
1.4K citations
1–8 of 294
JHEP · 10 publications · 457 citations
10
h-index
PRA · 8 publications · 261 citations
8
h-index
PRB · 8 publications · 392 citations
8
h-index
8 publications · 222 citations
8
h-index
8 publications · 421 citations
8
h-index
1–5