PLQ #10Done on:   Tuesday, March 30th

Question 1 @ 2021-03-30 18:11

In the PLQ from the last class we had a bit of code that was similar to:

#lang pl lazy
(define a (list a))

If this language had a type system similar to the one we use in #lang pl, what would be a good type for a:


Question 2 @ 2021-03-30 18:14

The Racket type of a compiled TOY expression is:


Question 3 @ 2021-03-30 18:17

What will be the result for the following test of the call-by-need variant of the SLOTH interpreter?

(run "{{fun {x} 1} {{fun {x} {x x}} {fun {x} {x x}} {fun {x} {x x}}}}")

Question 4 @ 2021-03-30 18:20

Consider the eval function from the TOY language:

[...omitted...]

In order to turn this into a lazy language, which of the following is NOT true: (Choose the best answer!)