Motivation

In earlier years I wrote some code to simulate polynomial (sum of products), lazy datatypes in C++ right on the tracks of the Hutton & Meijer paper 'Bananas in Space'. Required some advanced hacking and metaprogramming. Some other bits will go in too. Let's see if I can get this in shape and how the modern compilers deal with these things.

• GCC v4.3 added a C++0x feature: variadic templates.
• There is a new kid on the block: Clang is expected to show solid C++ somewhere in 2010.
• Concepts may pave the path so some early error checkin of fixpoints etc.

Status

The project name refers to the current state of this code, but in the future this may become a tonic of cata :-) Silly, I know.

Background, Anecdotal

Most of this code was developed on the Metrowerks CodeWarrior system, and the complicated template instantiations triggered dozens of bugs in their compiler. So I ended up with filing obscure template bug reports to MW on a daily basis. When a colleague met a MW support engineer at WWDC mentioning my name, the engineer responded: "Yeah, we know that guy, we just refer to him as Gabor Grief!" To their defense, I have to state, that bugs nonwithstanding, CodeWarrior was probably the best compiler of its time (around 1997) when it came to supporting template features.