Log of changes on this site

July 9, 2014

• Generic crossover, with extensible effects
• Effects a la Carte
• ML Family workshop: first call for participation

June 9, 2014

• The Design and Implementation of BER MetaOCaml
• Let-insertion without pain or fear or guilt

May 7, 2014

• Left fold vs. right fold: theory vs. practice
• A new version of HSXML: Typed SXML simplified the main Build class, added tables and a rudimentary CSS support, moved from type families to functional dependencies to shut up the ambiguity checker.

April 5, 2014

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

March 9, 2014

• 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

February 7, 2014

• Implementing, and understanding type classes
• Stefan Kaes, the forgotten father of type classes

January 1, 2014

• 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

December 5, 2013

• 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

November 5, 2013

• Tutorial: Systematic generation of optimal code with MetaOCaml
• Generating interesting lambda-terms

October 5, 2013

• 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

September 1, 2013

• 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

August 1, 2013

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

August 2012 through July 2013

continues in a separate document, ChangeLog-17.html

December 1995 through August 1996

continues in a separate document, ChangeLog-0.html