Log of changes on this site
August 2003 through July 2004

Please refer to ChangeLog.html for the most recent changes

July 4, 2004

• C pointers as closures
• Konrad Zuse as the inventor of predicated execution

June 5, 2004

• How to build `identifiers' with syntax-rules
• Takusen: a Haskell DBMS access library built around the left-fold enumerator

May 1, 2004

• Makefile as a functional language program
• Non-trivial language with a decidable halt
• VC 7 project file for the Basic Linear Algebra and Optimization classlib. Markus Bader is gratefully acknowledged for submitting the file.

April 4, 2004

• Version 3.0 of the SXML specification
• A reference to a local version of the paper SXSLT: Manipulation Language for XML
• De-biforestation: deforestation for two consumers feeding on two mutually dependent data streams with different rates of production

March 1, 2004

• Random Relative Primes: Determining and proving the probability of randomly chosen integers being relatively prime
• Multiple values as an effect. Monadic reflection and reification
• An efficient Eratosthenes Sieve implementation

February 1, 2004

• Reading numbers from a file with comments added to the collection of the input parsing library sample code
• Two new complete examples of practical (context-sensitive) SXML Transformations: Labeling nested sections of an SXML document by their nesting depth; Transforming SXML to SXML in SXSLT pipelines
• Added references to several related articles to Many faces of the fixed-point combinator

January 1, 2004

• Self-application as the fixpoint of call/cc
• Towards the best collection traversal interface LL3 poster presentation and the extended abstract
• From enumerators to cursors: turning the left fold inside out, in Haskell
• The general enumerator-inversion code in Scheme
• CPS transform and beta-normalization via syntax-rules: Macro-expander as a proof assistant

December 5, 2003

• How to write symbol? with syntax-rules
• An R5RS (syntax-rule) implementation of a good assert macro with informative reports on failure
• define-opt: A concise definition form with optional arguments and default values
• An implementation of the standard prelude for a Petite Chez 6.0a Scheme system. All special forms are realized as syntax-rule macros.

November 1, 2003

• A new page Scheme binary I/O and applications, which describes, among other things, a new version of a TIFF image library
• Turing-completeness of syntax-rules and hygiene
• Added make-char-quotator to Miscellaneous string utilities. String utility functions that have become part of SRFI-13 are moved to srfi-13-local.scm. The latter is a local, optimized implementation of a small subset of SRFI-13, for Scheme systems that do not offer SRFI-13 natively or conveniently.

October 5, 2003

• Selecting a random node from a tree in one pass: from proof to code
• A reference to a local version of the paper Macros that Compose: Systematic Macro Programming
• A character-efficient Mastermind game code, in Haskell

September 1, 2003

• A discussion of SOAP 1.2 and SXML
• An example of a SSAX parsing with limited XML doctype validation and datatype conversion
• How to map set!
• An advanced example of currying and folding, added to the page Lambda abstractions in C++ vs. Scheme. The example is contributed by Bas van der Linden.
• Dynamic dispatch on a class of a type, in Haskell

August 1, 2003

• Polymorphic stanamically balanced AVL trees, in Haskell
• Neal Stephenson's keynote, a Logic File System, and other summaries from USENIX 2003
• Protocol design, closures in OS systems programming, and other summaries from USENIX 2001

August 2002 through July 2003

December 1995 through August 1996