From a78dcd779dd73c52642419ce03f1c2c0294f576a Mon Sep 17 00:00:00 2001 From: Grigore Rosu Date: Thu, 17 Oct 2024 11:41:53 -0500 Subject: [PATCH] Update index.md --- teaching/2024/cs422/index.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/teaching/2024/cs422/index.md b/teaching/2024/cs422/index.md index bb7a8f6..f9dd966 100644 --- a/teaching/2024/cs422/index.md +++ b/teaching/2024/cs422/index.md @@ -69,7 +69,7 @@ Do the exercises in the K Tutorial. They are spread through the lessons in Sect - [K Overview]({{site.baseurl}}/assets/CS422-K-Overview.pdf) paper to learn more about K. Sections 1 and 2 (the other sections are optional now; they are covered below) --- -HW3 (due date: Tuesday, October 22, AoE) +HW3 (due date: Thursday, October 24, AoE) ***Exercise 1 (10 points):*** The current K LAMBDA semantics of mu (in Lesson 8) is based on substitution, and then letrec is defined as a derived operation using `mu`. Give `mu` a different semantics, as a derived construct by translation into other LAMBDA constructs, like we defined `letrec` in Lesson 7. To test it, use the same definition of letrec in terms of mu (from Lesson 8) and write 3 recursive programs, like the provided `factorial-letrec.lambda`.