Please solve using Scheme or Lisp Thanks Consider the lambda

Please solve using Scheme or Lisp. Thanks!

Consider the lambda calculus expression (y (lambda y.(lambda x.y))) Write down the same expression in The list-representation of lambda calculus in Scheme. The define-datatype representation in Scheme.

Solution

1)Lists are the basic structured data type in Scheme.The quote prevents Scheme from evaluating the arguments.

let lambda be represented with ^.

where cons takes two arguments and returns a pair (list).

b) Define expressions bind names and values and are of the form below.This is not an assignment statement since it cannot be used to rebind a name to a new value.

Here is an example of a definition.

(y)(define y (define x y))