Scheme equivalent to Haskell where clause

Question

I am just learning scheme, but I would love to be able to repeat myself less.

Is there a way I can assign a name to a subexpression in the local scope?

As per the comment:

Haskell where clause

x = s * t 
  where s = 10
        t = 20

x should be 200 in this case.

Answer 1

Let (or letrec for recursive bindings), e.g.:

(define (f g) 
  (let ((x 1) (y (* g 2))) 
       (+ x y)))