August 2005 through July 2006

- How to zip folds: A library of fold transformers (streams)
- Representing knowledge about knowledge: ``Mr.S and Mr.P'' puzzle
- Resumable exceptions
- RTRAN parsing and finding direct products in Algol-68

Babel.hs is the*HSXML*source of that page - portable, R5RS syntax-rule tracer

- The taste of logic programming. Logic variables as quantum-mechanical quantities, unification as the measurement
- The Scheme source code for the first version of Soutei
- A link to the MetaOCaml source code for the first paper about Generating optimal code with confidence

- An archive of ML code
- Dynamically scoped variables in OCaml
- Generic print function
- Abstract and a link to the Soutei paper presented at FLOPS2006

- Native delimited continuations in (byte-code) OCaml
- Reading comma-separated values (CSV), added to the input parsing library in Scheme

- Reversing Haskell typechecker: converting from
`undefined`

to defined - Inverse typechecking and theorem proving in intuitionistic and classical logics
- Addendum Eliminating
*Multiple-Array*Array Bound Checking through Non-dependent types - This ChangeLog in RSS 2.0

- Lightweight Dependent-type Programming
- Eliminating Array Bound Checking through Non-dependent types
- More properties of P-Numerals, and their relationship to Goedel's recursor R
- Deriving fast functions to compute all subsets of size N
- Fast computation of Bernoulli numbers

- All the ways to express the fully polymorphic fixpoint combinator in Ocaml
- Poly-variadic fix-point combinators in Scheme (briefly) and Haskell
- Monadic transformer code for the Simple fair and terminating backtracking Monad

- Generic Zipper and its applications
- Added commands
`mv`

,`cp`

, and`help`

to the Zipper-based file server/OS. The`cp`

command can copy files, directories, and arbitrary directory trees -- in constant time, thanks to the pervasive copy-on-write semantics of ZFS - leanTAP theorem prover in Kanren

- Zipper-based file server/OS
- Number-parameterized types: Replaced the old content with the reference to the full article, published in
*The Monad.Reader*IssueFive, Oct 2005

- From
`control0`

through`control`

to`shift`

: A generic R5RS Scheme implementation of all four Friedman-Felleisen`F`

delimited continuation operators - Monadic regions
- Joint processing of two immutable SXML documents with update cursors
- Scheme implementation of the Simple fair and terminating backtracking Monad, as a mini-Kanren evaluator

continues in a separate document, ChangeLog-9.html