Log of changes on this site
August 2008 through July 2009

Please refer to ChangeLog.html for the most recent changes

July 4, 2009

• Pointed to the Iteratee-based IO library on Hackage by John Lato and collaborators. Added a section on the design of Iteratees and the CPS implementation
• Generic polyvariadic printf in Haskell98
• Safe and generic printf/scanf with C-like format string
• Monolingual Probabilistic Programming Using Generalized Coroutines: UAI 2009
• Parameterized syntax: interpreters without run-time interpretive overhead

June 5, 2009

• Advanced Polymorphism in Simpler-Typed Languages
• Multitarget tracking in HANSEI
• Proving termination of interesting functions in Twelf

May 1, 2009

• HANSEI: Embedded domain-specific language for probabilistic models and (nested) inference
  Examples of Bayesian nets, Hidden Markov Models, population estimation, motivic development in classical music

April 5, 2009

• Annotating trees post factum
• File integrity checking on IBM S/360 and PDP-11

March 1, 2009

• Pure functional, mutation-free, efficient double-linked lists
• Strengthening in Logical Frameworks
• Catching exceptions in a general MonadIO

February 1, 2009

• Shifting the Stage: Staging with Delimited Control
• Yet another explanation of intrinsic encoding
• Mechanized proofs of type soundness of delimited control
• Probabilistic programming in POSIX C and OCaml: shift vs fork

January 1, 2009

• Type-level call-by-value lambda-calculator in three lines
• Applications of computable types
• Embedded probabilistic programming
• Formatted IO as an embedded DSL: the initial view
• Formatted IO as an embedded DSL: the final view
• Call-by-need via delimited continuations
• Multi-stage programming with functors and monads: eliminating abstraction overhead from generic code: a revised and expanded journal version, SCP, in press and online

December 5, 2008

• Simple and reliable uni- and bi-directional pipes
• Random and binary IO: Reading TIFF

November 1, 2008

• Lambda-calculator and alpha-conversion in pure Prolog
• leanTAP theorem prover in pure Prolog
• Beyond pure Prolog: power and danger

October 5, 2008

• Eliminating translucent existentials and the precise type of all scramblings of a string
• Lightweight monadic regions
• Streams and Iteratees: Incremental multi-level input processing and collection enumeration

September 1, 2008

• Call-by-name typed shift/reset calculus
• Compilation by evaluation as syntax-semantics interface in natural languages
• New version of MetaScheme, or untyped MetaOCaml
  Added tests showing why static renaming of bound identifiers is insufficient; implemented dynamic renaming as suggested by Chung-chieh Shan. Added support for a simple let form.

August 1, 2008

• Interpreting types as abstract values FLOLAC08 lecture notes and the source code for evaluators/type reconstructors
• Type-class overloaded functions: second-order type-class programming with backtracking
• An introductory section on delimited continuations added to the talk Persistent delimited continuations for CGI programming with nested transactions
• New version of Native delimited continuations in (byte-code) OCaml
  Added a new primitive, push_prompt_subcont, to push a captured continuation along with the control delimiter. The primitive is used to implement shift and shift0 without leaking memory. The new version includes many optimizations, which reduce the size of captured continuations.

August 2007 through July 2008

continues in a separate document, ChangeLog-12.html