I think these are all valuable extensions, the one that is hardest to see the benefit of at first is
(a v) y => (v y) a y another example than L:v not being implemented is (n :) v , and so custom definition processing such as http://www.jsoftware.com/jwiki/action/userprefs/PascalJasmin/Multiline%20tacit%20expressions%20with%20macros is made a little wordier than it could be. Overall, the extension simplifies conjunction definition when the caller can get around any lacking definition for n without v easily. ----- Original Message ----- From: Jose Mario Quintana <jose.mario.quint...@gmail.com> To: Programming forum <programm...@jsoftware.com> Cc: Sent: Wednesday, March 5, 2014 11:35:39 AM Subject: Re: [Jprogramming] Tacit recursion without $: I had not realized that the following replies to Linda and Don were skipped because of the 100 KB limit: _____________________________________________________________________________________________ From: Jose Mario Quintana <jose.mario.quint...@gmail.com> Date: Sun, Feb 23, 2014 at 9:12 PM Subject: Re: [Jprogramming] Tacit recursion without $: To: Programming forum <programm...@jsoftware.com> It is an extension; descriptions are found in [0] and [1]. See also http://www.2bestsystems.com/foundation/j I hope it helps. On Sun, Feb 23, 2014 at 9:03 PM, Don Guinn <dongu...@gmail.com> wrote: What's 103!:0 ? Not in help. [Long trailing text trimmed] _____________________________________________________________________________________________ From: Jose Mario Quintana <jose.mario.quint...@gmail.com> Date: Mon, Feb 24, 2014 at 10:53 AM Subject: Re: [Jprogramming] Tacit recursion without $: To: Programming forum <programm...@jsoftware.com> Thanks Linda, I also "worry" about that kind of things sometimes; see for example, http://rosettacode.org/wiki/Continued_fraction/Arithmetic/Construct_from_rational_number#Tacit_version By the way, the adjacent entry shows how to calculate some constants using continued fractions, http://rosettacode.org/wiki/Continued_fraction#J PHI=. cfrac 1000$1x 50 dec PHI 1.61803398874989484820458683436563811772030917980576 This seems to match what you guys have been doing. I enjoy meta-programming and sometimes allows to solve "concrete" problems that otherwise would be difficult to program and solve in J; see for example, the calculation of the 4 2 entry of the Ackermann function, http://rosettacode.org/wiki/Ackermann_function#J Anyway, Dan asked if somebody else could show some meta-programming tools and that is what I am (sort of) doing. On Mon, Feb 24, 2014 at 5:55 AM, Linda Alvord <lindaalv...@verizon.net> wrote: I'm glad there are people like you who are worried about all this. I'm quite content to use J as a powerful calculator which has provided 50 digits of the Golden Ratio. Unless I hear otherwise, I will continue to trust it is providing correct answers. I wish you all the best as you work to make J even faster and more powerful. Linda [Long trailing text trimmed] ---------------------------------------------------------------------- For information about J forums see http://www.jsoftware.com/forums.htm ---------------------------------------------------------------------- For information about J forums see http://www.jsoftware.com/forums.htm
