X-Git-Url: http://lambda.jimpryor.net/git/gitweb.cgi?p=lambda.git;a=blobdiff_plain;f=assignment5.mdwn;h=12ac950a24994ce787f396bc6db7a42330ea36bb;hp=2078c1c094b59441c69a357729ee8fc505ca3fe0;hb=c5e9c5f26878492029108cbfac0ba695ed41f986;hpb=472e280120834cc613fe8b7ff045a99e956636d3

diff --git a/assignment5.mdwn b/assignment5.mdwn
index 2078c1c0..12ac950a 100644
--- a/assignment5.mdwn
+++ b/assignment5.mdwn
@@ -146,7 +146,8 @@ Baby monads
 Booleans, Church numbers, and Church lists in OCaml
 ---------------------------------------------------
 
-These questions adapted from web materials written by some smart dude named Acar.
+(These questions adapted from web materials by Umut Acar. See <http://www.mpi-sws.org/~umut/>.)
+
 The idea is to get booleans, Church numbers, "Church" lists, and
 binary trees working in OCaml.