Yuva;
Hopefully Roger will answer this more fully, but I saw an extensive set of
test scripts when I read "An Implementation of J" These scripts preceded the
whole XP/TDD memes by at least half a decade.
Symbolic computation, to me at least, seems almost an exercise for the
reader:
'a' solvefor 'a+10=20' NB. given a+10=20, solve for a.
'x' solvefor 'x^2+y^2=25';'y=3'
------------------------------------------------------------------------
|\/| Randy A MacDonald | APL: If you can say it, it's done.. (ram)
|/\| [EMAIL PROTECTED] |
|\ | |If you cannot describe what you are doing
BSc(Math) UNBF'83 |as a process, you don't know what you're doing.
Sapere Aude | - W. E. Deming
Natural Born APL'er | Demo website: http://156.34.79.70/
-----------------------------------------------------(INTP)----{ gnat }-
----- Original Message -----
From: "Yuvaraj Athur Raghuvir" <[EMAIL PROTECTED]>
To: "General forum" <[email protected]>
Sent: Sunday, September 24, 2006 10:20 PM
Subject: [Jgeneral] Intrigued by the Interpreter....
Hello,
As I am starting on J, I would like to know:
1) How is the J interpreter tested to verify & validate the properties of
the various symbols of the language?
I am particularly interested in knowing about how the rank semantics is
validated.
2) Is it possible to introduce symbolic computation in functional
languages,
particularly J?
Thanks,
Yuva
----------------------------------------------------------------------
For information about J forums see http://www.jsoftware.com/forums.htm
----------------------------------------------------------------------
For information about J forums see http://www.jsoftware.com/forums.htm
