This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
K. Felgentreu, Department of Computer Science, Institut fiir Numerische und Instrumentelle Mathematik, University of Munster
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.
Index Terms:
tail recursion, Applicative languages, covered tail recursion, interpreter, shallow binding, static scoping
Citation:
K. Felgentreu, W.-M. Lippe, F.H. Simon, "Optimiizing Static Scope Lisp by Repetitive Interpretation of Recursive Function Calls," IEEE Transactions on Software Engineering, vol. 13, no. 6, pp. 628-635, June 1987, doi:10.1109/TSE.1987.233473
Usage of this product signifies your acceptance of the Terms of Use.