Log of changes on this site
August 2006 through July 2007

Please refer to ChangeLog.html for the most recent changes

July 4, 2007

• A new page with comments, impressions, summaries of conferences, talks, and papers.
  Principia Mathematica is modern and insightful -- notes on Chapter 1 of Principia
• Functional Approach to Texture Generation The summary of Jerzy Karczmarczuk's PADL02 talk
• A new page on Data-Generic and Data-Extensible Programming in Haskell.
  Polymorphic variants: solving the expression problem
• A variation on the theme of SYB3

June 1, 2007

• Typeclass overloading and bounded polymorphism in ML
• Non-deterministic choice amb in OCaml

May 4, 2007

• Typed memory areas and time-parameterized monads, for safe embedded and systems programming
• Binary type arithmetic
• Iterated zipping puzzles

April 7, 2007

• Restricted Monads
• Eratosthenes and other number sieves

March 4, 2007

• Class-parameterized classes, the type-level logarithm, and the higher-order for-loop on types
• Blending static and dynamic typing: Scheme programming in ML
• An example of Stream-wise SSAX parsing of a large XML document, recording only `interesting' parts

February 4, 2007

• Listing all top-level bindings in OCaml toplevel
• Impredicativity and explicit type applications in Haskell
• Simple PC text-mode window system in Modula-2

January 1, 2007

• HSXML: Typed SXML
• Printing the outline of a pruned tree: an example of the extended dynamic binding
• Reference to the paper In search of a program generator to implement generic transformations for high-performance computing
• Simply typed lambda-calculus with a typed-prompt delimited control is not strongly normalizing
• Predecessor and lists are not representable in simply typed lambda-calculus

December 1, 2006

• A poly-variadic function of a non-regular type
• Reference to the paper A monadic approach for avoiding code duplication when staging memoized functions
• More efficient Eratosthenes Sieve algorithm proposed by George Kangas

November 5, 2006

• Solving the show . read problem with local functional dependencies and syntactic hints.
• More examples of local functional dependencies
• Simply typed lambda-calculus with dynamic binding is not strongly normalizing

October 1, 2006

• References to the paper Multi-stage programming with functors and monads: eliminating abstraction overhead from generic code
• A new page Dynamic binding, binding evaluation contexts, and (delimited) control effects with the references to the paper, presentation, and the code of ``Delimited Dynamic Binding''
• Mutable bindings in evaluation contexts: formalization of dynamic binding in Twelf

September 1, 2006

• References to the paper and the talk `Lightweight static capabilities', along with accompanying source code and formal proofs in Twelf
• Formalizing the syntactic approach to type soundness in Twelf
• Added a reference to Haskell-like monadic notation for OCaml
• Software development at Pixar, relevance of academia to industry, and other summaries from USENIX 2006

August 5, 2006

• Type improvement constraint, local functional dependencies, and a type-level typecase
  Added items about a deep monadic join, deepest functor, local functional dependencies, and the resolution of overloading ambiguity
• Haskell implicit parameters are not dynamically scoped
• Simple text editor in PL/I, added to the collection of old code

August 2005 through July 2006

continues in a separate document, ChangeLog-10.html