X-Git-Url: http://lambda.jimpryor.net/git/gitweb.cgi?p=lambda.git;a=blobdiff_plain;f=offsite_reading.mdwn;h=4c3b9f5d3af381fa7cc46ca547368790526cb6ea;hp=4dd122eda3082686fb6457350b0295405ded6ee0;hb=7f74fe2290eabf14e172cfa27a6c6394eaf68933;hpb=8ab1fda2b25df482289baedce014cd0a2f3b3fc8 diff --git a/offsite_reading.mdwn b/offsite_reading.mdwn index 4dd122ed..4c3b9f5d 100644 --- a/offsite_reading.mdwn +++ b/offsite_reading.mdwn @@ -82,20 +82,14 @@ different handy extensions. The first standard was published in 1975. A revision was published in 1978 called "The revised report on Scheme, a dialect of Lisp." Thereafter, revisions of the standard were titled "The Revised Revised Report..." and so on, or "The Revised^n Report..." for -short, for increasing n. The most widely implemented standard is [The -Revised^5 Report on Scheme](http://docs.racket-lang.org/r5rs/index.html), +short. One widely implemented standard is [The +Revised^5 Report on Scheme](http://www.schemers.org/Documents/Standards/R5RS/HTML/), or R5RS, published in 1998. -\[ [Alt link](http://www.schemers.org/Documents/Standards/R5RS/HTML/) \] -A new standard [R6RS](http://docs.racket-lang.org/r6rs/index.html) was ratified +A new standard [R6RS](http://www.r6rs.org/final/html/r6rs/r6rs.html) was ratified in 2007, but this has many detractors and has not been fully accepted in the -community. -\[ [Alt link](http://www.r6rs.org/final/html/r6rs/r6rs.html); -[Libraries](http://www.r6rs.org/final/html/r6rs-lib/r6rs-lib.html) \] - +community. ([Libraries for R6RS](http://www.r6rs.org/final/html/r6rs-lib/r6rs-lib.html)) * [Scheme FAQ](http://community.schemewiki.org/?scheme-faq) - * [Scheme Requests for Implementation](http://srfi.schemers.org/) (SRFI) - * The [Schematics Scheme Cookbook](http://schemecookbook.org/) is a collaborative effort to produce documentation and recipes for using Scheme for common tasks. @@ -105,11 +99,11 @@ community. * [[!wikipedia Y combinator]] * [Chapter 9 from The Little Schemer](http://www.ccs.neu.edu/home/matthias/BTLS/sample.ps) on the Y Combinator "...and Again, and Again, and Again..." * [The Y combinator](http://mvanier.livejournal.com/2700.html) +* [The Why of Y](http://www.dreamsongs.com/NewFiles/WhyOfY.pdf) * [The Y Combinator (Slight Return), or: How to Succeed at Recursion Without Really Recursing](http://mvanier.livejournal.com/2897.html) * [Y Combinator for Dysfunctional Non-Schemers](http://rayfd.wordpress.com/2007/05/06/y-combinator-for-dysfunctional-non-schemers/) * [The Y Combinator](http://www.ece.uc.edu/~franco/C511/html/Scheme/ycomb.html) -* [The Y Combinator](http://dangermouse.brynmawr.edu/cs245/ycomb_jim.html), described as: - > This is the derivation of the applicative-order Y-combinator from scratch, in Scheme. The following derivation is similar in flavor to the derivation found in The Little LISPer by Friedman/Felleisen, but uses a slightly different starting approach... +* [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... ## Evaluation Order ## @@ -141,18 +135,21 @@ community. * [A Concise Introduction to Objective Caml](http://www.csc.villanova.edu/~dmatusze/resources/ocaml/ocaml.html) -* Here are [two](http://www.cs.jhu.edu/~scott/pl/lectures/caml-intro.html) [other](http://pauillac.inria.fr/caml/FAQ/stephan.html) bried overviews of OCaml, aimed at readers who already have some programming experience. +* Here are [two](http://www.cs.jhu.edu/~scott/pl/lectures/caml-intro.html) [other](http://pauillac.inria.fr/caml/FAQ/stephan.html) brief overviews of OCaml, aimed at readers who already have some programming experience. Here are [two](http://pauillac.inria.fr/caml/FAQ/exemples-eng.html) [more](http://pauillac.inria.fr/caml/FAQ/qrg-eng.html), even briefer. * Here's a [more detailed tutorial](http://www.ocaml-tutorial.org/) for OCaml. * Jason Hickey has posted a [draft of a nice book introducing OCaml](http://www.cs.caltech.edu/courses/cs134/cs134b/book.pdf). +* FAQs for [OCaml Beginners](http://pauillac.inria.fr/caml/FAQ/FAQ_DEBUTANT-eng.html), and [a few more](http://caml.inria.fr/resources/doc/faq/). Also FAQs for [OCaml Experts](http://pauillac.inria.fr/caml/FAQ/FAQ_EXPERT-eng.html). + ## Side-effects / mutation ## * [[!wikipedia Side effect (computer science) desc="Side effects"]] * [[!wikipedia Reference (computer science) desc="References"]] * [[!wikipedia Pointer (computing) desc="Pointers"]] +* [Pointers in OCaml](http://caml.inria.fr/resources/doc/guides/pointers.html) ## Monads ## @@ -256,9 +253,9 @@ invited talk, *19'th Symposium on Principles of Programming Languages*, ACM Pres * [Understanding continuations](http://keithdevens.com/weblog/archive/2004/Jul/11/continuations) [Commentary](http://lambda-the-ultimate.org/node/86) -* http://en.wikipedia.org/wiki/Continuation +* [[!wikipedia Continuation]] -* http://www.haskell.org/haskellwiki/Continuation +* [Haskell wiki on Continuations](http://www.haskell.org/haskellwiki/Continuation) * [Continuations In Scheme](http://tech.phillipwright.com/2010/05/23/continuations-in-scheme/)