August 2010 through July 2011

- Generators in ML
- Running generators side-by-side
- Finally Tagless, Partially Evaluated: Tagless Staged Interpreters for Simpler Typed Languages The journal version of the paper
- A set of simple examples demonstrating iteratees and their composability
- A new version of HSXML: Typed SXML based on the tagless-final approach

- Generators: yield = exceptions + non-determinism
- Applicative syntax-rules: macros that compose better

- for-any vs for-all proving that the predecessor is a left inverse of the successor in lambda-calculus
- Leibniz equality can, after all, be made injective

- Undelimited continuations are not functions
- Recursion from Iteration, an exercise in program derivation

- Generic Zipper: the context of a traversal -- better description, better code, relying on delimcc
- Zipper from any Traversable
- Version N003 of BER MetaOCaml, which now includes generic printing

- Code for Generating optimal FFT code and relating FFTW and Split-Radix. It is harder than it looks
- Two-headed enumeratee: Sorted merge of two sorted streams into one
- Probabilistic programming using first-class stores and first-class continuations
- Correlated memoization and lazy permutations
- HANSEI as a Declarative Logic Programming Language
- Logic programming without logic variables: theories and practice
- The append relation in Hansei
- Solving scheduling problems
- Zebra puzzle in Hansei

- Typed Staged Future: Semi-implicit batched remote code execution as staging
- Mechanizing multilevel metatheory with control effects

- A new version of the iteratee package, with more simplifications and explanations
- Parallel composition of iteratees: one source to several sinks
- Parallel composition of streams: several sources to one sink

- Staged let-generalization may be unsound
- The MetaOCaml files: Status report and research proposal
- First-class modules: hidden power and tantalizing promises

- The library delimcc of delimited control now supports native code OCaml on 32- and 64-bit Linux and FreeBSD OCaml 3.12.0 platforms
- Three new monad transformers for multi-prompt delimited control in Haskell

- Translucent applicative functors in Haskell
- ML-style modules with type sharing by name in Haskell
- Type-directed memoization in ML

continues in a separate document, ChangeLog-14.html