From 08ddabea126b05d49bd952365760d322bcae0304 Mon Sep 17 00:00:00 2001 From: Jim Pryor Date: Wed, 15 Sep 2010 17:46:33 -0400 Subject: [PATCH] week1: add map Signed-off-by: Jim Pryor --- week1.mdwn | 30 +++++++++++++++++++++++++++++- 1 file changed, 29 insertions(+), 1 deletion(-) diff --git a/week1.mdwn b/week1.mdwn index 9e66205e..0122ed9b 100644 --- a/week1.mdwn +++ b/week1.mdwn @@ -99,6 +99,30 @@ For the most part, these uses are only loosely connected to each other. We'll te Map === + + + + + + + + + + + +
Scheme (functional part)OCaml (functional part)C, Java, Pasval
+Scheme (imperative part)
+OCaml (imperative part)
lambda calculus
+combinatorial logic
--------- Turing complete ---------
  +more advanced type systems, such as polymorphic types +  +
  +simply-typed lambda calculus (what linguists mostly use) +  +
+ + + Rosetta Stone ============= @@ -323,7 +347,11 @@ Booleans and pairs Our definition of these is reviewed in [[Assignment1]]. -It's possible to do the assignment without using a Scheme interpreter, however you should take this opportunity to [get the software on your computer](/How to get the programming languages running on your computer), and [get started learning about Scheme](/learning_scheme). +It's possible to do the assignment without using a Scheme interpreter, however +you should take this opportunity to [get Scheme installed on your +computer](/how_to_get_the_programming_languages_running_on_your_computer), and +[get started learning Scheme](/learning_scheme). It will help you test out +proposed answers to the assignment. -- 2.11.0