Proper tail recursion and space efficiency

@article{Clinger1998ProperTR,
  title={Proper tail recursion and space efficiency},
  author={W. Clinger},
  journal={Proceedings of the ACM SIGPLAN 1998 conference on Programming language design and implementation},
  year={1998}
}
  • W. Clinger
  • Published 1998
  • Computer Science
  • Proceedings of the ACM SIGPLAN 1998 conference on Programming language design and implementation
The IEEE/ANSI standard for Scheme requires implementations to be properly tail recursive. This ensures that portable code can rely upon the space efficiency of continuation-passing style and other idioms. On its face, proper tail recursion concerns the efficiency of procedure calls that occur within a tail context. When examined closely, proper tail recursion also depends upon the fact that garbage collection can be asymptotically more space-efficient than Algol-like stack allocation.Proper… Expand
119 Citations
A Tail-Recursive Semantics for Stack Inspections
A tail-recursive machine with stack inspection
Efficient and safe-for-space closure conversion
The Tail-Recursive SECD Machine
QUANTIFYING TAIL RECURSION, RECURSION AND ITERATION
Revised6 Report on the Algorithmic Language Scheme
Bounding space usage of conservative garbage collectors
...
1
2
3
4
5
...