cleaned monad links

[lambda.git] / family_tree_of_functional_programming_languages.mdwn

diff --git a/family_tree_of_functional_programming_languages.mdwn b/family_tree_of_functional_programming_languages.mdwn
index dd4c1c3..cc2b424 100644 (file)
--- a/family_tree_of_functional_programming_languages.mdwn
+++ b/family_tree_of_functional_programming_languages.mdwn
@@ -1,4 +1,5 @@
-There's no need for you to know this for our seminar. But in case you're interested...
+There's a lot more trivia and links here than anyone needs to know for this seminar. It's
+there for anyone who may be interested.
 
 Others (and ourselves) will often talk about "functional programming
 languages." But it would be more appropriate to talk of functional *paradigms*
@@ -101,8 +102,9 @@ Most programming languages, functional or not, use **strict/eager evaluation**.
 instance, languages of the ML family are all statically-typed functional
 languages with strict/eager evaluation. These include [[!wikipedia Standard ML desc="SML"]] and
 [[!wikipedia Caml]] and [[!wikipedia Nemerle]]. SML in turn has several variants
-or implementations: [[!wikipedia MLton]], [[!wikipedia SML/NJ]], [[!wikipedia Moscow ML]],
-and [[!wikipedia Mythryl]].
+or implementations: [[!wikipedia MLton]], [[!wikipedia Standard ML of New Jersey desc="SML/NJ"]], [[!wikipedia Moscow ML]],
+and [[!wikipedia Mythryl]]. Microsoft's [[!wikipedia F Sharp (programming language) desc="F#"]]
+is derived from Caml.
 
 Other statically-typed functional languages with strict/eager evaluation are
 [[!wikipedia Scala (programming language) desc="Scala"]] and [[!wikipedia