Log of changes on this site
August 2012 through July 2013

Please refer to ChangeLog.html for the most recent changes

July 4, 2013

• CPS-transforming a restricted monad to the ordinary one
• Proper and efficient Set monad through knowledge propagation
• Proper and efficient Set monad through reflection-reification
• A simple linear pattern matcher in Scheme from long time ago
• A new version of Simple and reliable uni- and bi-directional pipes: If the process lingers too long after the forceful closure, kill it

June 7, 2013

• Cross-stage persistence
• A brief history of (BER) MetaOCaml

May 5, 2013

• Constant-space XML processing with well-formedness check
• A sharper example of Breaking referential transparency with unsafeInterleaveST
• Better examples of Lazy IO breaking equational reasoning

April 5, 2013

• MetaOCaml as a domain-specific optimizer: Shonan Challenge 1

March 7, 2013

• Efficient and insightful type generalization
• What polymorphism and garbage collection have in common
• History of discovery of type levels
• Understanding parts of the OCaml type checker

February 5, 2013

• Re-implemented BER MetaOCaml N100 for OCaml 4.00.1
• Shonan Challenge for Generative Programming: PEPM 2013 paper

January 1, 2013

• Simple Generators v. Lazy Evaluation
• Simple generators in Haskell
• Incremental, Linear Pretty-printing
• Non-deterministic choice in a conventional programming language: Enough for logic programming?
• BER MetaOCaml, version N004
• Delimited control in OCaml, abstractly and concretely: The greatly expanded, journal version of the paper
• Typed Tagless Final Interpreters: published lecture notes

December 1, 2012

• Genuine dependent types and faking them on the example of type-safe printf
• Incremental XML parsing with Iteratees
• A new version of the HList library, with fancier kinds and more type-level computations with no run-time overhead

November 5, 2012

• Maximal munch, committed choice and nested inference
• Impredicativity Bites Further

October 9, 2012

• Guess Lazily! Making a program guess, and guess well
• `Reversible' parser combinators
• Generating optimal stencil code: improved and simplified version. The generated code assuredly has no array-bound errors.

September 1, 2012

• Generating optimal stencil code: solving a Shonan Challenge problem
• Breaking referential transparency with unsafeInterleaveST
• Observing strictness

August 9, 2012

• An argument against call/cc
• call/cc implements shift? A good question
• A new version of HSXML: Typed SXML with overloaded string literals and many simplifications

August 2011 through July 2012

continues in a separate document, ChangeLog-16.html