Show that TLS-Scheme correctly implements lexical scope. ; tls-scheme uses local variable "table" to evaluate function
computer science
Description
1. Show that TLS-Scheme correctly implements lexical scope. ; tls-scheme uses local variable "table" to evaluate function. When outter function finish evaluation with its local table, ; the inner function will create another local table to evaluate itself. Functions have different tables which Make ; TLS-Scheme lexical scope. ;
2. Show that TLS-Scheme correctly implements first class functions. ; Write, and prove correct, a syntax checker for TLS-Scheme. Use the inductive definition of TLS-Scheme given in lecture15.scm. You ; will need to give a complete specification for your program. ;
Problem 3. Modify tls-scheme so that it correctly evaluates scheme expressions ; containing let. As you would by now expect, you need to give a complete and careful ; description and certification of your modifications; do not neglect the possibility ; that occurrences of let may be nested. Again, a key piece is to say what you mean ; by correctness.
