Tail Call Analysis is a static program analysis method that identifies function calls in tail position to enable optimization through tail call elimination, distinguishing itself from other control-flow analyses by focusing specifically on the syntactic and semantic conditions under which a call occurs as the last computational action in a function’s execution path.
13
Publications
890
Citations
20
Authors
18
Institutions
Publications per year
2017–2026
1
Parents
Publications
13
Naoki Kobayashi, Benjamin C. Pierce, David N. Turner · 1996 · 141 citations · Full text
Xiaozhu Meng, Barton P. Miller · 2016 · 130 citations · Full text
Threesomes, with and without blame
Jeremy G. Siek, Philip Wadler · 2010 · 97 citations · Full text
1–5 of 13
Authors
20
- JG
3
h-index
- PW
3
h-index
- BC
2
h-index
- DN
2
h-index
- NK
2
h-index
1–5 of 20
Institutions
18
University of Edinburgh
Edinburgh, United Kingdom
3 h-index
3 publications
126 citations
Universidad del Noreste
Tampico, Mexico
2 h-index
4 publications
86 citations
The University of Tokyo
Tokyo, Japan
2 h-index
2 publications
381 citations
University of Colorado Boulder
Boulder, United States
2 h-index
2 publications
110 citations
Northeastern University
Boston, United States
1 h-index
2 publications
94 citations
École Polytechnique Fédérale de Lausanne
Lausanne, Switzerland
1 h-index
2 publications
64 citations
University of Cambridge
Cambridge, United Kingdom
1 h-index
1 publications
141 citations
University of Pennsylvania
Philadelphia, United States
1 h-index
1 publications
240 citations
1–8 of 18
Venues
- ACM Transactions on Programming Languages and Systems
3 publications · 303 citations
3
h-index
- ACM SIGPLAN Notices
1 publications · 13 citations
1
h-index
- Electronic Notes in Theoretical Computer Science
ENTCS · 1 publications · 32 citations
1
h-index
- Logical Methods in Computer Science
LMCS · 1 publications · 32 citations
1
h-index
1–4