The new executive
http://www.geocities.com/kumar_arya/arunmark/programs/secretaryd.htm
J2EE, dot-NET, and Cantfake-executive
	Every one is convinced there is a horrible war brewing between J2EE (Sun, extends Java) and dot-com (.net of Microsoft). That is because they have never heard of me who now presents a third alternative, just as comprehensive, and different. J2EE is (Java 2 enterprise edition). Fundamental to both models is automatic memory management. Fundamental to mine is lack of need for it.
Philosophical dimensions
	More than just flowery speech, each of adjectives here represent complete fields, each with a tantalizing simple question set for you to understand and ask your seer. For I am not another one, but THE seer destined to stupidify them. CX is not just a new system, it represents a new philosophy beyond existing religion. law, mathematics, intelligence, and linguistics. Beyond existing religions it forces dispassionate scientific closure analysis. Beyond law it forces on fair resolution of generic conflicts, and lays down a superior resolution model. Beyond mathematics, it forces into issues of closure, completeness, and metafunctions. Beyond intelligence it forces onto general diagnostics, truth, and secure intelligence. Beyond linguistics, it forces into definitions, semantics, and classification.
Can it be done at all, or requires faith
	Yes it can be with no faith at all. It is based on generalized Whofian hypothesis - "A sentinent can't think except in a language", and the church-Turing hypothesis - "If it can be computed, then TM-equivalent can". TMH follows from Goedel's work. It led to LISP in 1960's and Scheme in 1990's. A common dominant theme has always been REUSE for it improves the productivity. Genuine problems in LISP led to Structured programming and to Object orientation via Simula, Unix-C(verbs) and Small-talk. OO led to GUI, Microsoft, Internet, HTML (nouns) and CPP (objects). One now begins combing the auto allocated object models into c# and Java. After all, an object is a seamless confluence of the noun part, verb parts, and the events. Reuse problems in early experience with OO programming led to multiple inheritance and parametric inheritance. The solutions proposed and done were so bad that they were abandoned.
The cantfake-executive
	The world according to me shall be made of computational atoms, combined to form molecules. An atom has external representations for its users, and internal representations for its implementers. Internally it could be an atom, or a molecule over atoms and other molecules. The structure is quite irrelevant to users who view the computational object as a set of operations (adjectives) and as verbs on other objects that return the CO. Thus color Top is an adjective, while new 16 => thash is a verb that happens to return a thash. The important difference between the two is context - adjectives are context-free, verbs are not. Incidentally a world without this distinction and automatic casts is NP-complete hence dead. Even without auto cast, like Ada, is quite complicated once one introduces procedure pointers.

The model is that of a cmolecule constructed from many catom connected by | with a sequence starting with empty cmolecule.

p0 | catom(Iota,"source",10*sizeof(int),0);
eval (pp | catom(p0) | catom(Square,Q 0) | catom(Target,o.l));

The catom are constructed from Verb(nm) ...RND. There are four ways building catom(....). One can have catom(nm,pair-s,0) for many args, catom(nm, noun) for premade noun, catom(cmolecule), or catom(nm,Q 0) if no args.

The Nouns can be declared globally using dNoun(nm) <MS bug wont work locally> and initialized/declared using dNoun2(nm,expr).

Each verb can use object to access globals as char**, o as cpair, StdIn and StdOut, and Molecule. Bar uses StdIn and StdOut.

1. A deck, not a file, is the universal unit. Think of a deck as a stream of string pointers or decks i,e, pointers to objects without pointers, or decks.

2. A typed unit, not a string, is the value part of a pair in an argument list. Imporantly, if can be deck. This allows atoms to have more than one connection. Below does a nonlinear pipeline!

eval( catom(source,"name","datafile.htm",0) | catom(interpret,"program",compiled,0))

4. There is no implementational difference between lists, nouns, arguments, and bindings!!!!! Each is a list of pairs.

Main point is cantfake-addendum-learning-curve. What you already know can be easily upgraded. There are many new things, even better ways of doing existing, but these can be learned with time. And ALL existing tools will carry over easily to the new world.

An unknown atom must be known as a set of adjectives, verbs, and events, can be bought and sold safely. For safety, every object must support sign and checksign methods. First returns an integer encoding a signature of state. Second verifies the argument is the sign, returning false otherwise. These methods must fail at least 4/maxint probability for cantfake change subsumes random impermissible state change. For the purpose of safety, ONLY internet programs allowed are permitted byte codes. However the implementor can explicitly request the compilation of any byte code string.

Any objects on host machine can be accessed provided they are in the capability list. C-list are created based on purported class. cantfake trustfree - It is MY responsibility to ensure thatt any one can not misrepresent class or that a user can not misstate being subjected to misrepresentation. Membership in a class can not be ordered WITHOUT the orderer assuming full responsibility for ALL damages. Cantfake membership rules in a class are a full list that subsumes the ability to vote for removal from class any one WITHOUT assigning any reason with 2/3 of the vote of ALL votes subject to cantfake voting rules.

Who lit the match that caused the big bang? How come fragments of that explosion are accelerating away from each other? where are they? How can a rabbit overtake a tortoise?

Beyond law it forces on fair resolution of generic conflicts, and lays down a superior resolution model.

Can law be derived from lack of belief in any religion? Can scofflaws be reliably stopped?

Beyond mathematics, it forces into issues of closure, completeness, and metafunctions.

Beyond intelligence it forces onto general diagnostics, truth, and secure intelligence.

Can one reliably and efficiently disgnose patients, programs, cars, airplanes, spaceships, toasters, students, government servants?

Can ome have a non-jurisdictional semantics? Agreed to classification? Common semantics?