X-Git-Url: http://lambda.jimpryor.net/git/gitweb.cgi?p=lambda.git;a=blobdiff_plain;f=offsite_reading.mdwn;h=0a660be07032010e6dfa02028e2076eead952aac;hp=4f2a73e9c6eba96367cdf1592a971f66716153b9;hb=HEAD;hpb=94164141b764d71dea5ad1aa3a6a3e052f10c252;ds=sidebyside

diff --git a/offsite_reading.mdwn b/offsite_reading.mdwn
deleted file mode 100644
index 4f2a73e9..00000000
--- a/offsite_reading.mdwn
+++ /dev/null
@@ -1,90 +0,0 @@
-Many off these links are to Wikipedia. You can learn a lot from such articles,
-so long as you remember they may sometimes mislead or make mistakes. However, I
-hope at this point in your education you'll have learned to be a guarded reader
-even of authoritative treatises by eminent authors. So you shouldn't need any
-Wikipedia-specific warnings.
-
-## General issues about variables and binding in programming languages ##
-
-*	[[!wikipedia Variable (programming)]]
-*	[[!wikipedia Variable shadowing]]
-*	[[!wikipedia Scope (programming)]]
-*	[[!wikipedia Free variables and bound variables]]
-*	[[!wikipedia Name binding]]
-*	[[!wikipedia Name resolution]]
-*	[[!wikipedia Parameter (computer science)]]
-
-## Functions as values, etc ##
-
-*	[[!wikipedia Higher-order function]]
-*	[[!wikipedia First-class function]]
-*	[[!wikipedia Closure (computer science)]]
-*	[[!wikipedia Currying]]
-*	[[!wikipedia Recursion (computer science)]]
-
-## Functional vs imperative programming ##
-
-*	[[!wikipedia Declarative programming]]
-*	[[!wikipedia Functional programming]]
-*	[[!wikipedia Purely functional]]
-*	[[!wikipedia Referential transparency (computer science)]]
-*	[[!wikipedia Imperative programming]]
-
-## Scheme and OCaml ##
-
-*	[[!wikipedia Scheme (programming language)]]
-*	[[!wikipedia Objective Caml]]
-
-## Untyped lambda calculus and combinatory logic ##
-
-*	[[!wikipedia Lambda calculus]]<p>
-*	[[!wikipedia Haskell Curry]]
-*	[[!wikipedia Moses Schönfinkel]]
-*	[[!wikipedia Alonzo Church]]<p>
-*	[[!wikipedia Combinatory logic]]
-*	[[!wikipedia B,C,K,W system]]
-*	[[!wikipedia SKI combinatory calculus]]<p>
-*	[[!wikipedia Church-Rosser theorem]]
-*	[[!wikipedia Normalization property]]
-*	[[!wikipedia Turing completeness]]<p>
-*	[[!wikipedia Church encoding]]
-*	[[!wikipedia Y combinator]]<p>
-*	[[!wikipedia Curry-Howard isomorphism]]<p>
-*	[[!wikipedia Evaluation strategy]]
-*	[[!wikipedia Eager evaluation]]
-*	[[!wikipedia Lazy evaluation]]
-*	[[!wikipedia Strict programming language]]
-
-## Types ##
-
-*	[[!wikipedia Tagged union]]
-*	[[!wikipedia Algebraic data type]]
-*	[[!wikipedia Pattern matching]]
-*	[[!wikipedia Unit type]]
-*	[[!wikipedia Bottom type]]
-*	[[!wikipedia Typed lambda calculus]]
-*	[[!wikipedia Simply typed lambda calculus]]
-*	[[!wikipedia Type polymorphism]]
-*	[[!wikipedia System F]]
-
-## Side-effects / mutation ##
-
-*	[[!wikipedia Side effect (computer science)]]
-*	[[!wikipedia Reference (computer science)]]
-*	[[!wikipedia Pointer (computing)]]
-
-## Continuations ##
-
-*	[[!wikipedia Continuation]]
-*	[[!wikipedia Continuation-passing style]]
-*	[[!wikipedia Call-with-current-continuation]]
-*	[[!wikipedia Delimited continuation]]
-
-## Monads ##
-
-*	[[!wikipedia Monad (functional programming)]]
-
-## Linear Logic ##
-
-*	[[!wikipedia Linear logic]]
-