User:Dan Bron/Temp

Temporary Pages:

• old version of Lexical Closure
• Essay on J engine hierarchy
• Parsing, Lexing, Execution
• Discussion of the evoke bug report
• Side Effects . How to identify what makes a J script non-deterministic.
• User:Dan Bron/Temp/ErrorsInInterfaceToJ How to detect and handle errors through the DLL/SO/COM interface to J
• Skin count How may layers of skin does an onion have?
• jan jacob's stuff Page related to the selection thread of December 2006.
• Side effects: What can make a J program non-deterministic (aka non-functional)?
• Fix Locals A utility to fix local names.
• State in J Related to side effects, an exploration of what state accumulates in a J session, how it effects execution, how to query it, reset it, and carry forward selected parts to a new J session.
• new layout ideas for PrimitivePrimitives
• Script unlocker A utility to unlock J scripts locked with 3!:6. Produces a reasonable approximation of the original text]
• Read Evaluate Print Loop A utility which implements the standard Read Evaluate Print Loop interface pattern. I supply the R PL, you supply the E.
• report Report these.
• /Parser Bugs and Proposed Resolution
• /TrainToGerund and the associated feature request
• Maybe make a puzzle for case changing in J?

  22 b.&.(a.&i.)~(' ',~{.a.){~e.&'abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ'

  
  
  This would be fast if we could just say ' ' 22 b.&.(a.&i.) ] but we need to check for membership in the letters. So the above verb will first generate a boolean array the same length as y, then generate a literal array of that same length, then match that atom-wise with y . The 22 b.&.(a.&i.) idiom may be fast now, but those mallocs won't be.
• Undocumented foreigns