Wed Jun 17 11:50:38 CEST 2009

Hash Tables Of Closures

I'm trying to make explicit the design used in sweb.  The document
structure is a graph, where each node (accessed by a symbol)
represents either a server response object or something else.

It is a combination of the following principles:

  * late binding
  * lazyness + caching (= "non-functional" lazyness)
  * protype-based programming

This is a common[1][2] pattern in web programming.

Message sending happens by abstracting both nodes and messages as
objects (hash tables).

[1] http://www.paulgraham.com/noop.html
[2] http://lispy.wordpress.com/2007/07/09/closures-hash-tables-as-much-oop-as-youll-ever-need/