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

Authors

532

  1. NK
    Naoki Kobayashi

    The University of Tokyo, Japan

    14 publications · 979 citations

    13

    h-index

  2. CL
    C.-H. Luke Ong

    University of Oxford, United Kingdom

    13 publications · 926 citations

    12

    h-index

  3. OS
    Olivier Serre

    Université Paris Cité, France

    5 publications · 267 citations

    5

    h-index

  4. SR
    Steven Ramsay

    University of Oxford, United Kingdom

    5 publications · 236 citations

    5

    h-index

  5. LJ
    Lance J. Dixon

    SLAC National Accelerator Laboratory, United States

    5 publications · 832 citations

    5

    h-index

1–5 of 532

Venues

  1. Journal of High Energy Physics

    JHEP · 10 publications · 457 citations

    10

    h-index

  2. Physical Review A

    PRA · 8 publications · 261 citations

    8

    h-index

  3. Physical review. B, Condensed matter

    PRB · 8 publications · 392 citations

    8

    h-index

  4. The Journal of Chemical Physics

    8 publications · 222 citations

    8

    h-index

  5. Theoretical Computer Science

    8 publications · 421 citations

    8

    h-index

1–5