Programming Languages, Fall 2013 HW6 - Midterm I revisited Due electronically on Blackboard on Tuesday October 29, 11:59pm. 1. (optional) Redo all questions in Midterm I (no need to submit). 2. Implement a Haskell version of the language on page 2. In particular, implement the big-step and small-step evaluation functions and try it on the examples in 1 and 4. See also: Quiz (p.2) and HW4 (Q1). Can you make a version that can print the small-step derivation trees (note it's just a sequence of rules applied)? 3. (optional) Use Haskell to simulate the lambda-calculus versions of all and map. Note: not the native Haskell version, which is trivial. See also: HW5 (Q2). Debriefing (required!): -------------------------- 1. Approximately how many hours did you spend on this assignment? 2. Would you rate it as easy, moderate, or difficult? 3. Did you work on it mostly alone, or mostly with other people? 4. How deeply do you feel you understand the material it covers (0%–100%)? 5. Any other comments? This section is intended to help us calibrate the homework assignments. Your answers to this section will *not* affect your grade; however, skipping it will certainly do.