Warning: This message contains over-simplifications and incomplete descriptions in order to stick to a specific partial vision.
In the past some people tried to unify array's processing power of APL with list's processing power of Lisp. The language then created was QNial and it could be (partially) viewed as using Lisp syntax on APL arrays. Much later, Arthur Whitney had lot's of success (currently) by using an APL kind of syntax with Lisp's style lists with K/Kdb+/Q What I see in those attempts is the power of expression behind well structures data and powerful operators (verb/adverb/conjunction) to operate on that well structured data. The indexing power of K/Kdb+ over list like structures is a succinct example of what I mean. Paul Gauthier APL Software Developer - Senior [EMAIL PROTECTED] Phone: 312-739-3467 Fax: 312-739-3496 CheckFree. The Company that Powers Payment on the WebSM. http://www.checkfree.com/paybillsonline "Terrence Brannon" <[EMAIL PROTECTED]> Sent by: [EMAIL PROTECTED] 04/06/2007 09:46 AM Please respond to General forum <[email protected]> To "General forum" <[email protected]> cc Subject [Jgeneral] Executive Overview of J - Arrays as the most viable data structure I was sitting here in front of an Excel spreadsheet, thinking, "you know this is an array" ... not too long ago I was looking at a database table and thinking the same thing. HOWEVER. isn't a tree the most general data structure? You can make lists out of trees and make arrays out of lists. Therefore the most fundamental and broadly applicable data structure is a tree and not an array. Any feedback on why J is an array processing language and how it might handle tree/hierarchical data is appreciated. And how good is J with infinite data structures/streams? ---------------------------------------------------------------------- For information about J forums see http://www.jsoftware.com/forums.htm ---------------------------------------------------------------------- For information about J forums see http://www.jsoftware.com/forums.htm
