- Iteratee parsing combinators with good error reporting
- Iteratee fork: backtracking-free non-determinism

- Tagless-Staged: Combinators for Impure yet Hygienic Code Generation
- Streams of random data: a pitfall of lazy evaluation
- Higher-order, Typed, Inferred, Strict: ACM SIGPLAN ML Family Workshop Call for papers

- Seemingly impossible generic map in SYB
- Reify a data type as a graph term
- A wordstar-like text editor for Electronics BK-0010 in 1754 bytes
- Efficient integer logarithm of large numbers in any base
- Simple fair and terminating backtracking Monad Transformer as it turns out, implements the LogicT interface
- Editorial: PEPM2012 Special Issue of Higher-Order and Symbolic Computation
- Functional un|unparsing published in HOSC

- BER MetaOCaml N101 for OCaml 4.01, without environment classifiers but with the comprehensive scope-extrusion check
- Moving free variables around but not letting them escape

- Extensible Effects: an alternative to Monad Transformers
- MetaOCaml lives on: Lessons from implementing a staged dialect of a functional language. ML 2013 talk
- Implementing staging

- A new version of delimcc, with a number of small optimizations and a new lightweight concurrency benchmark
- Lambda: the ultimate syntax-semantics interface the web site is updated for the ESSLLI course
- Analysis of expressives in the semantic calculator with applicatives

- Simplest poly-variadic fix-point combinators for mutual recursion in Haskell, OCaml, Scheme
- Fix-point combinators are infinitely many and recursively-enumerable

continues in a separate document, ChangeLog-17.html

continues in a separate document, ChangeLog-0.html