Skip to Main Content
This paper presents some recent results in interpreter optimization. The techniques of shallow binding and repetitive interpretation of tail recursive functions are adapted to Lisp with static scoping as the binding method for-all identifiers. Then a new technique of interpreting" covered tail recursive" functions is proposed. The purpose of the paper is to show that the extra expense for static scoping can be kept small by combining these techniques.