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
13
Naoki Kobayashi, Benjamin C. Pierce, David N. Turner · 1996 · 141 citations · Full text
Proper tail recursion and space efficiency
William Clinger · 1998 · 118 citations · Full text
Stack-based typed assembly language
Greg Morrisett, Karl Crary, Neal Glew et al. · Journal of Functional Programming · 2002 · 102 citations · Full text
1–5 of 13
24
2
h-index
2
h-index
2
h-index
2
h-index
2
h-index
1–5 of 24
19
Carnegie Mellon University
Pittsburgh, United States
2 h-index
4 publications
226 citations

Cornell University
Ithaca, United States
2 h-index
2 publications
113 citations
The University of Tokyo
Tokyo, Japan
2 h-index
2 publications
381 citations
Universidad del Noreste
Tampico, Mexico
2 h-index
2 publications
132 citations
Stony Brook University
Stony Brook, United States
1 h-index
3 publications
63 citations
University of Cambridge
Cambridge, United Kingdom
1 h-index
1 publications
141 citations

Roskilde University
Roskilde, Denmark
1 h-index
1 publications
32 citations

University of Glasgow
Glasgow, United Kingdom
1 h-index
1 publications
141 citations
1–8 of 19
3 publications · 303 citations
3
h-index
3 publications · 130 citations
3
h-index
LOPLAS · 1 publications · 21 citations
1
h-index
ENTCS · 1 publications · 32 citations
1
h-index
1 publications · 14 citations
1
h-index
1–5