Purpose The goal of this problem set is to formulate a set of type checking rules.
Problem 1 Equip your standard reduction model of DADL with a set of type checking rules that implement the checker of problem set 3. Name the judgment wf-dd.
Design evaluate. The function consumes a configuration. If it type checks, it produces the list of rooms room names visited according to ->dd-standard until the first cycle is encountered. Otherwise it produces '("type error!").
; t -> boolean ; (type-checks? t) determines whether the wf-dd judgment holds for t (define (type-checks? t) (judgment-holds (wf-dd ,t)))
Deliverable Email a tar.gz bundle to my CCS email address whose name
combines the last names of the pair in alphabetical order. The tar bundle
must contain a single directory—
;; NameOfPartner1, NameOfPartner2
;; firstname.lastname@example.org, email@example.com