Return to Answer

##Overcoming the 5 character limit on names

Make the val(x) of the object be a hash value which maps the full string in a string table.

I think the T == 1 and NIL == 0 property can be maintained simply by forcing 0 to be the index of "T".

Then all the special encoding stuff can just be removed. It's fun and cool, but unnecessary distraction when the rest of the program is already so strange.

Assumes 32-bit without explicit assertion

Yep. Tssk.

Overcoming the 5 character limit on names

Make the val(x) of the object be a hash value which maps the full string in a string table.

I think the T == 1 and NIL == 0 property can be maintained simply by forcing 0 to be the index of "T".

Then all the special encoding stuff can just be removed. It's fun and cool, but unnecessary distraction when the rest of the program is already so strange.

Assumes 32-bit without explicit assertion

Yep. Tssk.

##Overcoming the 5 character limit on names

Make the val(x) of the object be a hash value which maps the full string in a string table.

I think the T == 1 and NIL == 0 property can be maintained simply by forcing 0 to be the index of "T".

Then all the special encoding stuff can just be removed. It's fun and cool, but unnecessary distraction when the rest of the program is already so strange.

##Overcoming the 5 character limit on names

Make the val(x) of the object be a hash value which maps the full string in a string table.

I think the T == 1 and NIL == 0 property can be maintained simply by forcing 0 to be the index of "T".

Then all the special encoding stuff can just be removed. It's fun and cool, but unnecessary distraction when the rest of the program is already so strange.

Assumes 32-bit without explicit assertion

Yep. Tssk.