[doc changes tom@zwizwa.be**20080718141023] hunk ./doc/scrbl/Makefile 17 +RSYNC = rsync --archive --update --delete --numeric-ids --verbose --one-file-system --progress --rsh=ssh + hunk ./doc/scrbl/Makefile 21 - rsync.backup scribble.css scribble-common.js staapl.html giebrok:darcs/staapl/www/-/ + $(RSYNC) scribble.css scribble-common.js staapl.html giebrok:darcs/staapl/www/-/ hunk ./doc/scrbl/staapl.scrbl 48 -comprising the purely functional concatentative (compositional) Scat +comprising the purely functional concatenative (compositional) Scat hunk ./doc/scrbl/staapl.scrbl 131 -Identifiers occuring in a @scheme[scat:] form are always referenced +Identifiers occurring in a @scheme[scat:] form are always referenced hunk ./doc/scrbl/staapl.scrbl 239 -function following the invokation, @scheme[exit] to abort the +function following the invocation, @scheme[exit] to abort the hunk ./doc/scrbl/staapl.scrbl 316 -targets. In classic Forth, this functionality is implememented as +targets. In classic Forth, this functionality is implemented as hunk ./doc/scrbl/staapl.scrbl 363 -defintion, changing the the meaning of the following source text word +definition, changing the the meaning of the following source text word hunk ./doc/scrbl/staapl.scrbl 376 -essential non-reducable components (primitives + composition) of Coma, +essential non-reducible components (primitives + composition) of Coma, hunk ./doc/scrbl/staapl.scrbl 380 -extra complexitity in 1 (or 2) preprocessing steps necessary to +extra complexity in 1 (or 2) preprocessing steps necessary to hunk ./doc/scrbl/staapl.scrbl 450 -What is special about this form of two-stage progamming is that it +What is special about this form of two-stage programming is that it hunk ./doc/scrbl/staapl.scrbl 475 -non-staged semantics is clear, staging annotiations can be studied to +non-staged semantics is clear, staging annotations can be studied to hunk ./doc/scrbl/staapl.scrbl 487 -Forth (2002), Mole (2004), Badnop(2004) and Brood/Staapl(2006). Staapl +Forth (2002), Mole (2004), Badnop(2005) and Brood/Staapl(2006). Staapl hunk ./doc/scrbl/staapl.scrbl 491 -is a Lisp/Forth hibrid that explores multimethods and linear memory +is a Lisp/Forth hybrid that explores multimethods and linear memory hunk ./doc/scrbl/staapl.scrbl 499 -Diggins' efforts. Cat is a typed Joy with a preprocessing term rewrite -system. Cat has fueled my interest in type systems and statically -typed functional languages, which eventually lead to the discovery of -MetaOcaml and Walid Taha's efforts in the RAP domain. I want to -acknowledge Slava Pestov for being a source of ideas by being verbal -about Factor and his opinions on language design and +Diggins' efforts. Cat is a typed Joy with a preprocessing +term rewrite system. Cat has fueled my interest in type systems and +statically typed functional languages, which eventually lead to the +discovery of MetaOcaml and Walid Taha's efforts in the RAP domain. I +want to acknowledge Slava Pestov for being a source of ideas by being +verbal about Factor and his opinions on language design and hunk ./www/index.html 20 - Forth. Staapl is an attempt to create a programmable interactive - compiler for networked deeply embedded applications. + Forth. Staapl is an attempt to create a programmable + interactive compiler for networked deeply embedded applications. For + a more elaborate introduction + see here. hunk ./www/index.html 63 -
The documentation is mostly the source, but there are some ad-hoc - text files in the doc folder. Some preliminary - papers are available for Staapl, - Purrr18 and - the Sheep sound synthesizer. I'm - working on some scribble docs for the Staapl core. +
The documentation is mostly the source, but there's a + small + introduction + and blog.