To implement a let
expression in your own interpreter first you have to transform it into a lambda
application, something similar to this (procedure names should be self-explanatory):
(define (let->combination exp)
(let* ((bindings (let-bindings exp))
(body (let-body exp))
(exps (bindings-all-exps bindings))
(lambda (make-lambda (bindings-all-vars bindings) body)))
(make-application lambda exps)))
(define (make-lambda parameters body)
(list* 'lambda parameters body))
(define (make-application proc . args)
(cond ((null? args) (list proc))
((list? (car args)) (cons proc (car args)))
(else (cons proc args))))
And after the syntax transformation has been performed you can proceed to evaluate it:
(eval (let->combination exp) env)
What I'm trying to point out is that you shouldn't try to evaluate it directly. Also be careful, the code you're generating has a couple of incorrect quotes:
((lambda '(x y) (* x y)) '(2 3))
^ ^
here here
It should look like this instead:
((lambda (x y) (* x y)) 2 3)