X-Git-Url: http://lambda.jimpryor.net/git/gitweb.cgi?p=lambda.git;a=blobdiff_plain;f=offsite_reading.mdwn;h=018758017c7572a3a2ec0897cf7545fb43b2271e;hp=8bb42380b30fb731febb77a8c9ad7e6f8311c5ef;hb=9597d0f4796382fd4b18e85f2c5eb37a5f60e715;hpb=1a71e5b2f4c3f6ebbd14e51b3d139e72ce9cff94;ds=sidebyside diff --git a/offsite_reading.mdwn b/offsite_reading.mdwn index 8bb42380..01875801 100644 --- a/offsite_reading.mdwn +++ b/offsite_reading.mdwn @@ -26,6 +26,7 @@ get more out of. (Rinse and repeat.) * [[!wikipedia Functional programming]] * [[!wikipedia Purely functional]] * [[!wikipedia Referential transparency (computer science)]] +* [[!wikipedia Side effect (computer science) desc="Side effects"]] * [[!wikipedia Imperative programming]] ## General issues about variables and scope in programming languages ## @@ -90,39 +91,51 @@ get more out of. (Rinse and repeat.) * [The Y Combinator](http://dangermouse.brynmawr.edu/cs245/ycomb_jim.html) derives the applicative-order Y-combinator from scratch, in Scheme. This derivation is similar in flavor to the derivation found in The Little Schemer, but uses a slightly different starting approach... * [The church of the least fixed point, by Sans Pareil](http://www.springerlink.com/content/n4t2v573m58g2755/) +## Folds ## + +* [[!wikipedia Fold (higher-order function)]] + ## Types ## -* [[!wikipedia Tagged union]] -* [[!wikipedia Algebraic data type]] -* [[!wikipedia Recursive data type]] -* [[!wikipedia Pattern matching]] -* [[!wikipedia Unit type]] -* [[!wikipedia Bottom type]] * [[!wikipedia Typed lambda calculus]] * [[!wikipedia Simply typed lambda calculus]] * [Type Theory](http://plato.stanford.edu/entries/type-theory/) at the Stanford Encyclopedia of Philosophy * [Church's Type Theory](http://plato.stanford.edu/entries/type-theory-church/) at the Stanford Encyclopedia of Philosophy * [[!wikipedia Type polymorphism]] * [[!wikipedia System F]] +