Tail Call Optimization

Tail Call Optimization is a compiler-level optimization technique that eliminates the creation of a new stack frame for a function call appearing in tail position, thereby enabling space-efficient recursion and preventing unbounded stack growth in tail-recursive programs.

13

Publications

822

Citations

24

Authors

19

Institutions

Publications per year

2017–2026

1

Authors

24

  1. GM
    Greg Morrisett

    Harvard University Press, United States

    2 publications · 113 citations

    2

    h-index

  2. WC
    William Clinger

    Northeastern University, United States

    2 publications · 132 citations

    2

    h-index

  3. NG
    Neal Glew

    Cornell University, United States

    2 publications · 113 citations

    2

    h-index

  4. BC
    Benjamin C. Pierce

    University of Pennsylvania, United States

    2 publications · 381 citations

    2

    h-index

  5. DN
    David N. Turner

    University of Glasgow, United Kingdom

    2 publications · 381 citations

    2

    h-index

1–5 of 24

Venues

  1. 3

    h-index

  2. Journal of Functional Programming

    3 publications · 130 citations

    3

    h-index

  3. ACM Letters on Programming Languages and Systems

    LOPLAS · 1 publications · 21 citations

    1

    h-index

  4. Electronic Notes in Theoretical Computer Science

    ENTCS · 1 publications · 32 citations

    1

    h-index

  5. ACM SIGPLAN Notices

    1 publications · 14 citations

    1

    h-index

1–5