Logiweb(TM) How the parts play together

Prev Up Next Page 423 of 800 Search internet

Codification of a page with reference cardinal R takes the cache C and the body P of the page as input. C and P remain fixed during codification.

A page whose bibliography contains no proper entries is a 'base page'. To start the iteration, an initial codex X_0 is constructed. If the page being codified is no base page then the initial codex is empty. If the page being codified is a base page and symbol number one of the page has arity two, then that symbol is made a proclamation symbol in X_0. That is done by setting the 'definition' aspect of symbol number one to ((0 . 7883939740841374320)) where (0 . 7883939740841374320) is the string symbol whose name is 'proclaim'.

Given the cache C, the codex X_i, and the body P, each iteration consists of three steps.

Step 1. A new cache C' is constructed. C' is identical to C except that reference cardinal R is mapped to X_i. In other words, the codex X_i is non-destructively added to the cache C.

Step 2. The body P is macro expanded into an expansion S using the cache C'. The constructs in P are macro expanded according the the macro aspects of the constructs as defined by C'.

Step 3. The expansion S is harvested, yielding a new codex X_{i+1}.

The iteration ends when X_i equals X_{i+1}. If that never happens, then codification does not terminate.

When writing base pages, one should ensure that symbol number one proclaims itself to be a proclamation symbol. This ensures that symbol number one will be a proclamation symbol not only in X_0, but also in X_i for i>0. (Exercise: write a base page in which symbol number two ends up being a proclamation symbol whereas symbol number one ends up not being a proclamation symbol).

Prev Up Next Page 423 of 800 Search logiweb.eu

Copyright © 2010 Klaus Grue, GRD-2010-01-05