Log of changes on this site

August 1, 2010

• Translucent applicative functors in Haskell
• ML-style modules with type sharing by name in Haskell
• Type-directed memoization in ML

July 4, 2010

• Lambda: the ultimate syntax-semantics interface
• Many ways to the fix-point combinator besides the value recursion
• In defense of UndecidableInstances
• Dynamic epistemic logic puzzles
• Soutei, a logic-based trust-management system is now hosted on SourceForge

June 7, 2010

• Linear and affine lambda-calculi
• Eigen-variables: variables or constants?

May 7, 2010

• Delimited Control in OCaml, Abstractly and Concretely: System description
• shift as a green fork(2): solving puzzles using non-determinism
• Ordinary and one-pass CPS transformation

April 4, 2010

• Typed tagless-final interpretations: Lecture notes
• A new version of the typed tagless-final type-checker and the above-the-board, assuredly safe implementation of Data.Typeable, in the tagless-final style.
• Type-directed partial evaluation in the tagless-final style

March 5, 2010

• Parametric polymorphism over a type class
• The initial release of BER MetaOCaml: a streamlined version of MetaOCaml
• Parameterizing expressions by the evaluation order

February 5, 2010

• Inductive proofs in logical frameworks and logic programming
• ENKITEI: Interactive proof system for natural deduction with inductive definitions
• Sorted list benchmark problem: laziness and importance sampling within very large search space

January 1, 2010

• Iteratee IO: safe, practical, declarative input processing
  Added a reference to the updated `documentation', the annotated talk given on December 17, 2009 at the CST research colloquium, Department of Information and Computing Sciences, Utrecht University, NL.
• A CPS version of the iteratee library The types of enumerators and enumeratees are the simplest here.
• Extensible interpreters -- an alternative to monad transformers
• Montagovian semantics and Scala programming
• Computational Abstract Grammars: Quantifier scope ambiguities and verbal ellipsis
• Dynamic Logic in Abstract Categorial Grammars: Discourse Anaphora and Scoping Islands
• Bounded-Rational Theory of Mind for Conversational Implicature

December 5, 2009

• Differentiating Parsers
• Version 2.0 of the Iteratee library, with restartable exceptions and enumeratees

November 1, 2009

• A new version of the delimcc library: Native delimited continuations in (byte-code) OCaml
  The new version has much clearer code, which is about 10% faster, taking less memory.
• Multi-prompt delimited control in R5RS Scheme, a version of delimcc in Scheme. The specialization of the code yields a new implementation of the ordinary shift/reset in R5RS Scheme, which is memory efficient even if the underlying call/cc copies the whole stack.
• Higher-order polymorphic selection, another example of the unusual polymorphism that can be trivially implemented.

October 4, 2009

• Constructive Law of Excluded Middle
• Purely Functional Lazy Non-deterministic Programming: Added executable small-step semantics based on an alternative, constructive set of laws
• Polyvariadic functions and keyword arguments: pattern-matching on the type of the context
  A new web page collecting old content, with a new introduction and a new entry on type-indexed arguments

September 7, 2009

• Normalizing loop bodies by evaluation
• Functional un|unparsing: Deriving implementations of the typed printf and scanf from their specification
• Purely Functional Lazy Non-deterministic Programming

August 1, 2009

• Haskell with only one typeclass
• GADT in OCaml
• Deriving a very shallow embedding of a probabilistic DSL

August 2008 through July 2009

continues in a separate document, ChangeLog-13.html

December 1995 through August 1996

continues in a separate document, ChangeLog-0.html