Raul wrote: > Has anyone gone through and tried to identify a > "minimal J core language"?
That is the intent of PrimitivePrimitives. There are many ways to rewrite J in J; just as, in theory, you could implement any processor with only NOR gates. Each complete set of primitive primitives (PPS) will have distinct and sometimes interesting properties. Some of those sets will have a property you seek: they contain the smallest number of primitives required to re-implement J. Now, I say, "a property you seek" instead of "the property you seek" because you clearly seek more than you stated explicitly. To wit: how will you choose among the minimal PPS? Will any do? Are they all equal? If I told you you could reimplement all of J with a sufficient number of ~: , would that satisify you? Put another way: you indicate the equivalence | <==> #: . If they are equivalent, then there are at least two "minimal" PPS. One contains | and the other #: . Which do you choose? In any case, once the PP page is complete, we can have code which will explore all these possibilities, and lets you state explicitly and unambiguously the properties you require of a PPS. One way to expedite that process is to record equivalences like | <==> #: when you discover them. -Dan ---------------------------------------------------------------------- For information about J forums see http://www.jsoftware.com/forums.htm
