Log of changes on this site
August 2004 through July 2005

Please refer to ChangeLog.html for the most recent changes

July 4, 2005

• LogicT - backtracking monad transformer with fair operations and pruning
• Simple fair and terminating backtracking Monad
• How to take a tail of a functional stream
• How to make a Haskell function strict without changing its body
• Version 2.7 of Advanced i/o, Networking, and Arithmetic Compression classlib

June 5, 2005

• Run-time macros as a pattern-matching library
• Soutei, a logic-based trust-management system
• Axiom of Choice as a black-box cursor-like Set API

May 5, 2005

• New page Continuations and delimited control
  The simplest implementation of the delimited continuation operators control, shift0, control0 and others in terms of shift/reset
• Writing LaTeX/PDF mathematical papers with SXML
• A monadic version of the lambda-calculator in Haskell gives us the trace of the reduction steps

April 1, 2005

• References to the papers A Methodology for Generating Verified Combinatorial Circuits and Relating FFTW and Split-Radix Joint work with Kedar N. Swadi and Walid Taha.
• How to write a Haskell typeclass instance for not-a-function
• Controlled and transparent memoization in Haskell

March 5, 2005

• First release of Kanren: A declarative logic programming system
• Added a discrete logarithm predicate to Pure, declarative, and constructive binary arithmetic all-mode relations. The division predicate div/4 now reports finite failures in more situations (e.g., when trying to divide any odd number by two with the zero remainder).
• Universal quantification, impredicative terms, and effects in logical programs

February 5, 2005

• Genuine, strongly typed keyword arguments in Haskell
• Scheme macros with keyword (labeled) arguments
• Added an example to the page Normal-order syntax-rules and proving the fix-point of call/cc that shows that eta-expansion is not sound with respect to (call/cc call/cc). First-class continuations can be tricky, therefore, being formal helps.

January 1, 2005

• Normal-order syntax-rules and proving the fix-point of call/cc The presentation at the Workshop ``Daniel P. Friedman: A Celebration.'' December 4, 2004.
  The article introduces a short and fast direct-style syntax-rule macro for normal-order beta-normalization, and integrates it with the CPS transform macro. The article also discusses relationships between various delimited control operators: shift/reset, control/prompt, etc.
• Zipper in Scheme
• eval-uating open code

December 1, 2004

• Layered I/O statement
• Reference to a paper Implicit configurations -- or, type classes reflect the values of types. Joint work with Chung-chieh Shan.
• Reference to a paper Strongly typed heterogeneous collections. Joint work with Ralf Lämmel and Keean Schupke.

November 5, 2004

• lambda as a library syntax
• Two misconceptions about closures
• lookup-def: Look up a value in alists of various formats and handle the look-up failure

October 1, 2004

• Giving a Haskell function a partial signature
• A cleaner version of the source code that accompanies the page on Number-parameterized types
• Macro-expand-time environments and S-expressions as identifiers
• Release 5.1 of SSAX and SXML

September 5, 2004

• Functions with the variable number of (variously typed) arguments, in Haskell
• It turns out that exactly the same method was used five years ago to implement ``currying'' in C++: Lambda abstractions in C++ vs. Scheme. Currying. More explanations are added to the latter page, following the kind suggestions by Pablo Nogueira.
• Mentioning of the KANREN, a declarative logic programming system, on the Scheme index page
• Pure, declarative, recursively-enumerating binary arithmetic all-mode relations, in Prolog and Kanren

August 1, 2004

• New page: Y overriding self-application
• Generating optimal code with confidence
• Added a reference to Tom Bethell's ``A Map to Nowhere. The genome isn't a code and we can't read it'' to the page Doubts about the concept of information

August 2003 through July 2004