From ff9ff96c9806b28eaa3b443df3a47d74da0ec089 Mon Sep 17 00:00:00 2001 From: Chris Date: Mon, 9 Mar 2015 16:10:32 -0400 Subject: [PATCH] edits --- exercises/assignment5.mdwn | 6 ++---- 1 file changed, 2 insertions(+), 4 deletions(-) diff --git a/exercises/assignment5.mdwn b/exercises/assignment5.mdwn index 7bcbbee0..73889482 100644 --- a/exercises/assignment5.mdwn +++ b/exercises/assignment5.mdwn @@ -329,9 +329,7 @@ any type `α`, as long as your function is of type `α -> α` and you have a bas -- Or this: let sysf_true = (\y n -> y) :: Sysf_bool a - Note that in both OCaml and the Haskell code, the generalization `∀'a` on the free type variable `'a` is implicit. If you really want to, you can supply it explicitly in Haskell by saying: - - :set -XExplicitForAll + :set -XExplicitForAll let { sysf_true :: forall a. Sysf_bool a; ... } -- or let { sysf_true :: forall a. a -> a -> a; ... } @@ -408,7 +406,7 @@ Be sure to test your proposals with simple lists. (You'll have to `sysf_cons` up # k 1 true ;; - : int = 1 - If you can't understand how one term can have several types, recall our discussion in this week's notes of "principal types". (WHERE?) + If you can't understand how one term can have several types, recall our discussion in this week's notes of "principal types". -- 2.11.0