bibliography

If you are into continuations, check Friedman's papers on ReadScheme. https://github.com/schemedoc/bibliography/blob/master/page6.... In particular look at "Programming with Continuations", "Engines Build Process Abstractions" and "Continuations and Coroutines".

C is often used as target language for compiler from higher level languages. The Scheme programming language requires all tail calls not to grow the stack. Therefore implementors have explored various techniques including trampolines. I don't have a citation, but you can find the answer in the papers on compiling Scheme to C. If there is no guarantee of TCO in the target language, then the generated programs will be slower. Incidentally, this is why implementors of (especially) high level languages are annoyed that TCO was removed from the JavaScript specification. There are even solution for having TCO and still have stack inspection. https://github.com/schemedoc/bibliography/blob/master/page8....

Lisp is strongly, implicit and dynamically typed, with type coercions. For example it provides generic arithmetic: * (let ((a 1) ; integer (b 2.0) ; default float (c 1/3) ; ratio (d #c(1.2 2.3))) ; complex number (+ a b c d)) #C(4.5333333 2.3) Variables A, B, C, D have no type declarations. The values usually carry type information. The + operation will take any numeric value and create a result value of a type it chooses. for example (+ 1/2 1/2) will result to 1. Adding ratios might create a ratio or an integer. There is a whole bunch of literature on compiling Scheme: https://github.com/scheme-live/library.readscheme.org/blob/m...