Log of changes on this site
August 2007 through July 2008

Please refer to ChangeLog.html for the most recent changes

July 1, 2008

• A new page Representing existential data types with isomorphic simple types
• Added the standard list API and two examples of surprisingly simple expressions of list intersperse and Fibonacci in terms of fold, to the library of fold transformers

June 1, 2008

• Ask-by-need: on-demand evaluation with effects
• Choosing a type-class instance based on the context

May 4, 2008

• Persistent twice-delimited continuations in OCaml
• Persistent delimited continuations for CGI programming with nested transactions
• Pure, declarative, and constructive arithmetic relations in Prolog and Kanren -- now with explanations and proofs
• Logic programming in Haskell optimized for reasoning
• Delimited continuations with effect typing, full soundness, answer-type modification and polymorphism

April 4, 2008

• MetaScheme, or untyped MetaOCaml Meta-programming in Scheme with an arbitrary number of stages and cross-stage persistence. Or, why bracket is not a quasiquote.
• Talk: Delimited Continuations in Computer Science and Linguistics

March 1, 2008

• Type(class)-directed symbolic differentiation
• Most optimal symbolic differentiation of compiled numeric functions
• Do-notation for restricted monads: Data.Set as MonadPlus

February 1, 2008

• Total stream processors and their applications to all infinite streams
  Response to `Seemingly impossible functional programs'
• Closing the Stage: from staged code to typed closures
• Variable (type)state `monad'

January 1, 2008

• Finally Tagless, Partially Evaluated: Tagless Staged Interpreters for Simpler Typed Languages
  on a new web page on typed tagless interpretations, typechecking, staging, and dependent types
• Typed Compilation
• Tagless (staged) interpreter typeclass for typed languages
• Typed compilation to HOAS as emulation of staging
• Metatypechecking: Staged Typed Compilation into GADT via typeclasses
• Typed compilation via GADTs
• Relating Final and Initial typed tagless representations

December 7, 2007

• A new page on Meta-Theory and Logical Frameworks, with an example of formalizing monadic System F and mechanically proving its type soundness
• A summary of the J. Strother Moore's talk Machine reasoning about machines: ACL2 theorem prover
• Fixpoint combinator from typed prompt/control
• General recursive types via delimited continuations
• Noted that the paper `Lightweight static capabilities' has been published in Electr. Notes Theor. Comput. Sci, 174(7), pp. 79-104, 2007

November 4, 2007

• A new page Monadic Regions with the description of Simple IO regions, in Haskell98 + existentials
• Local globally-quantified exceptions in OCaml, and their relationship with delimited continuations
• Newer FastCGI and the memory-efficient IO interface
• Self-quoting fix-points: Quines, in Scheme and MetaOCaml

October 5, 2007

• Generic de-serialization
• In quest for staged calculus
• Dependent open terms and the evaluation contexts that bind them

September 1, 2007

• Delimited continuations in operating systems
• State Monad as a term algebra

August 1, 2007

• Type checking as small-step abstract evaluation
• A Substructural Type System for Delimited Continuations
• Smash along your boilerplate -- an approach to generic programming in Haskell
• Generic traversal of non-existent terms
• Typeable makes Haskell98 unsound

August 2006 through July 2007

continues in a separate document, ChangeLog-11.html