Log of changes on this site
August 2015 through July 2016

Please refer to ChangeLog.html for the most recent changes

July 3, 2016

• Non-Kleene predecessors: a representation workout
• Alpha-conversion is inevitable

June 7, 2016

• The Music of Streams on a strict instrument

May 1, 2016

• The curious case of the test-driven development

April 1, 2016

• Lazy State: possible with extensible effects, after all

March 1, 2016

• A brief introduction to probabilistic programming
• Problems of the Lightweight Implementation of Probabilistic Programming

February 1, 2016

• Finally, Safely-Extensible and Efficient Language-Integrated Query
• Staging Beyond Terms: Prospects and Challenges

January 1, 2016

• An optimized version of extensible-effects: adding specialization RULEs and inlining directives notably improved the performance
• A more efficient implementation of open unions, as existentials over a finite type universe
• Combinators for Impure yet Hygienic Code Generation published in Science of Computer Programming
• The post-proceedings with the extended versions of the selected ML Family and OCaml 2014 workshop submissions are published as EPTCS 198
• FLOPS 2016 First call for participation and call for posters

December 7, 2015

• Further development of the Applicative Abstract Categorial Grammars and applying it to more interesting analyses (LENLS 2015 paper)

November 7, 2015

• Free and Freer Monads: putting monads back into closet

October 7, 2015

• Generating code with polymorphic let
• Tagless-final, systematic optimizations in Haskell and OCaml: Tutorial (CUFP 2015 tutorial)

September 7, 2015

• Freer Monads, More Extensible Effects. The code and the re-implementations of LogicT, Catching dynamic and asynchronous exceptions in the presence of other effects, and Lightweight monadic regions as extensible effects.

August 11, 2015

• Approximate Dependent-Type Programming (the first part)

August 2014 through July 2015

continues in a separate document, ChangeLog-19.html