Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]

Groups > comp.lang.forth > #46237 > unrolled thread

4th.CoSy : Is your head small enough ?

Back to article view | Back to comp.lang.forth

Contents

  4th.CoSy : Is your head small enough ? Bob Armstrong <bob@cosy.com> - 2016-03-27 14:30 -0700
    Re: 4th.CoSy : Is your head small enough ? hughaguilar96@gmail.com - 2016-03-27 15:03 -0700
      Re: 4th.CoSy : Is your head small enough ? "WJ" <w_a_x_man@yahoo.com> - 2016-03-28 04:20 +0000
      Re: 4th.CoSy : Is your head small enough ? Bob Armstrong <bob@cosy.com> - 2016-03-28 12:50 -0700
        Re: 4th.CoSy : Is your head small enough ? hughaguilar96@gmail.com - 2016-03-28 13:53 -0700
          Re: 4th.CoSy : Is your head small enough ? foxaudioresearch@gmail.com - 2016-03-28 18:32 -0700
            Re: 4th.CoSy : Is your head small enough ? hughaguilar96@gmail.com - 2016-03-28 21:40 -0700
            Re: 4th.CoSy : Is your head small enough ? Bob Armstrong <bob@cosy.com> - 2016-03-29 10:47 -0700
      Re: 4th.CoSy : Is your head small enough ? "Ala'a" <amalawi@gmail.com> - 2016-03-28 14:00 -0700
        Re: 4th.CoSy : Is your head small enough ? Bob Armstrong <bob@cosy.com> - 2016-03-29 09:47 -0700
    Re: 4th.CoSy : Is your head small enough ? "WJ" <w_a_x_man@yahoo.com> - 2016-03-28 04:44 +0000
      Re: 4th.CoSy : Is your head small enough ? "WJ" <w_a_x_man@yahoo.com> - 2016-03-28 04:54 +0000
        Re: 4th.CoSy : Is your head small enough ? Bob Armstrong <bob@cosy.com> - 2016-03-28 14:03 -0700
          Re: 4th.CoSy : Is your head small enough ? hughaguilar96@gmail.com - 2016-03-28 14:46 -0700
            Re: 4th.CoSy : Is your head small enough ? Bob Armstrong <bob@cosy.com> - 2016-03-29 10:34 -0700
          Re: 4th.CoSy : Is your head small enough ? Ron Aaron <rambamist@gmail.com> - 2016-03-30 18:18 +0300
        Re: 4th.CoSy : Is your head small enough ? "WJ" <w_a_x_man@yahoo.com> - 2016-03-28 21:37 +0000
      Re: 4th.CoSy : Is your head small enough ? "WJ" <w_a_x_man@yahoo.com> - 2016-03-30 09:44 +0000
    Re: 4th.CoSy : Is your head small enough ? hughaguilar96@gmail.com - 2016-03-28 11:34 -0700
      Re: 4th.CoSy : Is your head small enough ? Bob Armstrong <bob@cosy.com> - 2016-03-28 13:48 -0700
      Re: 4th.CoSy : Is your head small enough ? Ron Aaron <rambamist@gmail.com> - 2016-03-29 06:56 +0300
        Re: 4th.CoSy : Is your head small enough ? hughaguilar96@gmail.com - 2016-03-28 21:53 -0700
          Re: 4th.CoSy : Is your head small enough ? Ron Aaron <rambamist@gmail.com> - 2016-03-29 08:27 +0300
            Re: 4th.CoSy : Is your head small enough ? hughaguilar96@gmail.com - 2016-04-02 00:25 -0700
              Re: 4th.CoSy : Is your head small enough ? Ron Aaron <rambamist@gmail.com> - 2016-04-03 06:54 +0300
                Re: 4th.CoSy : Is your head small enough ? hughaguilar96@gmail.com - 2016-04-02 21:59 -0700
                  Re: 4th.CoSy : Is your head small enough ? Ron Aaron <rambamist@gmail.com> - 2016-04-03 12:25 +0300
                    Re: 4th.CoSy : Is your head small enough ? hughaguilar96@gmail.com - 2016-04-04 01:51 -0700
                      Hugh, you are an asshat Ron Aaron <rambamist@gmail.com> - 2016-04-04 13:07 +0300
                        Re: Hugh, you are an asshat hughaguilar96@gmail.com - 2016-04-04 14:08 -0700
                          Re: Hugh, you are an asshat Ron Aaron <rambamist@gmail.com> - 2016-04-05 07:31 +0300
                            Re: Hugh, you are an asshat Bill Cummins <billc@cummins.net> - 2016-04-05 05:55 +0000
                              Re: Hugh, you are an asshat Ron Aaron <rambamist@gmail.com> - 2016-04-05 11:12 +0300
                                Re: Hugh, you are an asshat hughaguilar96@gmail.com - 2016-04-05 01:24 -0700
                      Re: 4th.CoSy : Is your head small enough ? Albert van der Horst <albert@spenarnc.xs4all.nl> - 2016-04-04 10:16 +0000
                        Re: 4th.CoSy : Is your head small enough ? hughaguilar96@gmail.com - 2016-04-04 04:26 -0700
          OT: Hugh changed to Israel and religion, was [Re: 4th.CoSy : Is your head small enough ?] Rod Pemberton <NoHaveNotOne@bcczxcfre.cmm> - 2016-04-02 12:03 -0400

Page 1 of 2  [1] 2  Next page →

#46237 — 4th.CoSy : Is your head small enough ?

I'd just like to let everybody know that I feel 4th.CoSy , http://www.cosy.com/CoSy/ , is past the bushwhacking stage and provides a solid foundation for APL level vocabulary on reference counted lists of lists  in an open x86 FORTH . I gave a demo last Forth Day at Stanford , https://youtu.be/0u2_jKfo0A8?t=2h48m30s .

If minimal but everyday practical attracts you , check out my

 "Seeking Alphas" , http://cosy.com/y16/CoSy201601.html

Download a 0 cost copy ; see if it works for you ;
comment and question on the Disqus blog on any relevant page ( and subscribe ) , or contact me by email .  Let me know of any tasks where 4th.CoSy may more than fill the gap between user and machine left by traditional APLs .

[toc] | [next] | [standalone]

#46239

On Sunday, March 27, 2016 at 2:30:26 PM UTC-7, Bob Armstrong wrote:
> I'd just like to let everybody know that I feel 4th.CoSy , http://www.cosy.com/CoSy/ , is past the bushwhacking stage and provides a solid foundation for APL level vocabulary on reference counted lists of lists  in an open x86 FORTH . I gave a demo last Forth Day at Stanford , https://youtu.be/0u2_jKfo0A8?t=2h48m30s .
> 
> If minimal but everyday practical attracts you , check out my
> 
>  "Seeking Alphas" , http://cosy.com/y16/CoSy201601.html
> 
> Download a 0 cost copy ; see if it works for you ;
> comment and question on the Disqus blog on any relevant page ( and subscribe ) , or contact me by email .  Let me know of any tasks where 4th.CoSy may more than fill the gap between user and machine left by traditional APLs .

I'll download it and try it out later today.

Right now, let me ask a question: By APL are you referring to "A Programming Language," the math-oriented language with all the funky chars that was used in the 1960s and 1970s?

Can you give a brief description of what kind of programs your language would be used for?

[toc] | [prev] | [next] | [standalone]

#46240

hughaguilar96@gmail.com wrote:

> Right now, let me ask a question: By APL are you
> referring to "A Programming Language," the
> math-oriented language with all the funky chars that
> was used in the 1960s and 1970s?

The answer is yes.  J and K (also Q) are descended from APL.

-- 
The report card by the American Society of Civil Engineers showed the national
infrastructure a single grade above failure, a step from declining to the point
where everyday things simply stop working the way people expect them to. ---
washingtonpost.com/local/trafficandcommuting/us-infrastructure-gets-d-in-annual-report/2013/03/19/c48cb010-900b-11e2-9cfd-36d6c9b5d7ad_story.html

[toc] | [prev] | [next] | [standalone]

#46258

On Sunday, March 27, 2016 at 4:03:20 PM UTC-6, hughag...@gmail.com wrote:
> On Sunday, March 27, 2016 at 2:30:26 PM UTC-7, Bob Armstrong wrote:
> > I'd just like to let everybody know that I feel 4th.CoSy , http://www.cosy.com/CoSy/ , is past the bushwhacking stage and provides a solid foundation for APL level vocabulary on reference counted lists of lists  in an open x86 FORTH . I gave a demo last Forth Day at Stanford , https://youtu.be/0u2_jKfo0A8?t=2h48m30s .
> > 
> > If minimal but everyday practical attracts you , check out my
> > 
> >  "Seeking Alphas" , http://cosy.com/y16/CoSy201601.html
> > 
> > Download a 0 cost copy ; see if it works for you ;
> > comment and question on the Disqus blog on any relevant page ( and subscribe ) , or contact me by email .  Let me know of any tasks where 4th.CoSy may more than fill the gap between user and machine left by traditional APLs .
> 
> I'll download it and try it out later today.
> 
> Right now, let me ask a question: By APL are you referring to "A Programming Language," the math-oriented language with all the funky chars that was used in the 1960s and 1970s?
> 
> Can you give a brief description of what kind of programs your language would be used for?

APL is forever . As is FORTH . 

APL's market tends to be complex financial applications . Arthur Whitney's K in which legacy K.CoSy is written and , until a grid interface is interfaced to 4th.CoSy , I will continue to maintain all my various family accounts , is mainly used in Big Data and High Frequency Algorithmic Trading .

See the Forth day demo .

Since in 2006 I managed to complete the loop with the machine allowing me to keep timestamped notes mixed with executable expressions and reliably store and save them in the R , root , dictionary , my ambient use is taking and making contemporaneous notes . Trivial as that may seem , it counts in court .

But , since its all simple text , you can search for anything over years on the basis of any fragment you can remember . Enhancing the vocabulary to operate on text lists is among the things I'm working on . For synchronizing diaries in multiple instances of CoSy , I've been working on to implement a word I find particularly useful in K.CoSy :

  venn
  partition of lists x and y into their Venn parts : intersection and 2 disjoint sets
  { ( x _dvl y ; in[ x ; y ] ; y _dvl x ) }

Also , simply keeping a ` ref list around of passwords , etc , I find quite useful .

[toc] | [prev] | [next] | [standalone]

#46261

On Monday, March 28, 2016 at 12:50:53 PM UTC-7, Bob Armstrong wrote:
> But , since its all simple text , you can search for anything over years on the basis of any fragment you can remember. 

Does the text fragment have to be exact?

Google Translate matches text fragments to similar text in the past that has been translated by human translators --- this is how it translates between languages without actually knowing anything about the languages (it doesn't "know" what the text means that it is translating).

Also, Go programs (including AlphaGo that recently beat the great Lee Sedol) will match board configurations to similar board configurations in the past that a pro-dan played --- this is how it plays like a pro-dan without actually knowing Go at that level.

I am very interested in the aspect of AI that involves pattern-matching for the best match when there is no exact match.

[toc] | [prev] | [next] | [standalone]

#46266

On Monday, March 28, 2016 at 4:53:10 PM UTC-4, hughag...@gmail.com wrote:
> On Monday, March 28, 2016 at 12:50:53 PM UTC-7, Bob Armstrong wrote:
> > But , since its all simple text , you can search for anything over years on the basis of any fragment you can remember. 
> 
> Does the text fragment have to be exact?
> 
> Google Translate matches text fragments to similar text in the past that has been translated by human translators --- this is how it translates between languages without actually knowing anything about the languages (it doesn't "know" what the text means that it is translating).
> 
> Also, Go programs (including AlphaGo that recently beat the great Lee Sedol) will match board configurations to similar board configurations in the past that a pro-dan played --- this is how it plays like a pro-dan without actually knowing Go at that level.
> 
> I am very interested in the aspect of AI that involves pattern-matching for the best match when there is no exact match.

Kuzweil's premis is that the Neo-cortex of the human brain is a 7 to 9 layer
deep pattern matcher that may be recursive. If he is correct, your pattern matching code could replicate a mind someday.

I find it a no coincidence that the neo-cortex is 7 to 9 layers deep
and Psychology says we can only manipulate 7 to 9 complex inter-related
ideas simulatneously... and good Forth definitions are supposed to have 7 to 9
words in them.

Things that make you say hmmmm...

BF
replicate human intelligent too

[toc] | [prev] | [next] | [standalone]

#46270

On Monday, March 28, 2016 at 6:32:37 PM UTC-7, foxaudio...@gmail.com wrote:
> On Monday, March 28, 2016 at 4:53:10 PM UTC-4, hughag...@gmail.com wrote:
> > On Monday, March 28, 2016 at 12:50:53 PM UTC-7, Bob Armstrong wrote:
> > > But , since its all simple text , you can search for anything over years on the basis of any fragment you can remember. 
> > 
> > Does the text fragment have to be exact?
> > 
> > Google Translate matches text fragments to similar text in the past that has been translated by human translators --- this is how it translates between languages without actually knowing anything about the languages (it doesn't "know" what the text means that it is translating).
> > 
> > Also, Go programs (including AlphaGo that recently beat the great Lee Sedol) will match board configurations to similar board configurations in the past that a pro-dan played --- this is how it plays like a pro-dan without actually knowing Go at that level.
> > 
> > I am very interested in the aspect of AI that involves pattern-matching for the best match when there is no exact match.
> 
> Kuzweil's premis is that the Neo-cortex of the human brain is a 7 to 9 layer
> deep pattern matcher that may be recursive. If he is correct, your pattern matching code could replicate a mind someday.
> 
> I find it a no coincidence that the neo-cortex is 7 to 9 layers deep
> and Psychology says we can only manipulate 7 to 9 complex inter-related
> ideas simulatneously... and good Forth definitions are supposed to have 7 to 9
> words in them.
> 
> Things that make you say hmmmm...
> 
> BF
> replicate human intelligent too

Most of what I know about the brain comes from this book:
https://www.goodreads.com/book/show/27539.On_Intelligence

The following is my interpretation from this book and others, but I'm not really an expert on the subject, so I may be wrong.

The layers of the neo-cortex aren't like separate brains that each are thinking about a different idea, inter-related or not. The brain only thinks about one idea at a time. You have a conception of the world that you get from your senses. It starts at the outer layer and travels from one layer to the next getting modified each time (there are 6 layers total). At the inner layer you have an "idea" about the conception at the outer layer. This idea travels back through the layers again until it gets to the outer layer, where it is compared to the original conception. If they pretty much match, then the process is repeated. This continues until the match is adequate, at which time the brain determines that the idea at the inner layer describes the conception at the outer layer.

The way hypnosis works, is to flash some input at such a speed as to synchronize with the information going back and forth through the layers of the neo-cortex so that every time the conception reaches the outer layer the same information hits the senses and so it gets reinforced. Music is hypnotic because it is rhythmic and it syncs up with the flow of information back and forth through the new-cortex. In the olden days, mesmerists would swing a pendulum in front of the person and the frequency of it would sync up like this, but nowadays we have computers that can flash an image on the screen at this frequency (this is commonly done in video games to hypnotize the player). 

Epileptics go into seizures because a flashing light hypnotizes them and, for reasons unknown, their brains have some fault that prevents them from escaping and their brain just goes hay-wire.

Because the information flows in both directions, people are experiencing time flowing both forward and backward alternatively. The brain sorts this out so that the conscious mind only experiences time flowing forwards. People who are dyslexic however are getting messed up on this so that the subconscious mind sometimes experience time flowing backwards, which is why when reading they will get letters switched around because they were reading backwards for a little while. Stuttering is most likely also caused because the subconscious mind is experiencing time flowing backwards as well as forwards and the person backs up repeatedly and hits the same sound more than once. This is also why backwards speech is used in subliminal messages. The conscious mind can't understand the backwards speech because the conscious mind only experiences time flowing forward, but the subconscious mind experiences time flowing both forward and backward, so it can pick up on backwards-speech and the subliminal message can be learned by the subconscious without the conscious being aware of it.

BTW: I read about halfway through Kuzweil's book: "The Singularity is Near." I stopped reading because all that optimism was getting on my nerves. I don't think that any of this is true. Computers will never be like the brain. A computer may be able to translate one language into another using pattern-matching, but it will never "understand" the text, and it will never be creative. Similarly, AlphaGo may have beaten Lee Sedol, but this doesn't mean that AlphaGo "understands" Go. Computers can't think, and they never will. AlphaGo had a database of millions of games played by professional dans, so no matter what opening Lee used, the chances were high that this had either been played before or that it was a bad opening. Just because Lee is a 9-dan-pro doesn't mean that he knows significantly more than the 1-dan-pros about the opening; none of those guys are playing bad openings. Because of this, Lee wasn't able to get into an advantageous middle-game --- by the time of the middle-game though, good-old brute-force searching allowed AlphaGo to continue making good moves so it was able to hold onto its advantage. People actually do the same thing --- kyu players study dan games and will occasionally make dan-like moves in the opening because they recognize a board circumstance from a dan game --- we just aren't very good at the follow-up, so trying to play like a dan doesn't work very well when the opponent actually is a dan.

[toc] | [prev] | [next] | [standalone]

#46307

On Monday, March 28, 2016 at 7:32:37 PM UTC-6, foxaudio...@gmail.com wrote:
> On Monday, March 28, 2016 at 4:53:10 PM UTC-4, hughag...@gmail.com wrote:
> > On Monday, March 28, 2016 at 12:50:53 PM UTC-7, Bob Armstrong wrote:
> > > But , since its all simple text , you can search for anything over years on the basis of any fragment you can remember. 
> > 
> > Does the text fragment have to be exact?
> > 
> > Google Translate matches text fragments to similar text in the past that has been translated by human translators --- this is how it translates between languages without actually knowing anything about the languages (it doesn't "know" what the text means that it is translating).
> > 
> > Also, Go programs (including AlphaGo that recently beat the great Lee Sedol) will match board configurations to similar board configurations in the past that a pro-dan played --- this is how it plays like a pro-dan without actually knowing Go at that level.
> > 
> > I am very interested in the aspect of AI that involves pattern-matching for the best match when there is no exact match.
> 
> Kuzweil's premis is that the Neo-cortex of the human brain is a 7 to 9 layer
> deep pattern matcher that may be recursive. If he is correct, your pattern matching code could replicate a mind someday.
> 
> I find it a no coincidence that the neo-cortex is 7 to 9 layers deep
> and Psychology says we can only manipulate 7 to 9 complex inter-related
> ideas simulatneously... and good Forth definitions are supposed to have 7 to 9
> words in them.
> 
> Things that make you say hmmmm...
> 
> BF
> replicate human intelligent too

I spent the `70s in grad school at Northwestern in visual psychophysics trying to get an inkling of how brains work because I am the care giver of my older brother whose brain's got problems .  I learned APL when I realized only such a notation would allow one to think about the patterns on a quarter million optic fibers as succinctly as writing  " A * B " . You can browse around in CoSy.com for a lot of those roots .

[toc] | [prev] | [next] | [standalone]

#46262

> Can you give a brief description of what kind of programs your language would be used for?

Here are a couple of demos (plus a real application - a simulator) showing the interactivity, terseness and compactness of APL code/notation

Sudoku Solver in APL
https://www.youtube.com/watch?v=DmT80OseAGs

Conway's Game Of Life in APL
https://www.youtube.com/watch?v=a9xAKttWgP4

How about a Nice Game of Chess?
https://www.youtube.com/watch?v=GdG04m1IQ0A

Depth-first search in APL (this uses the search algo. to solve the n-queens problem)
https://www.youtube.com/watch?v=DsZdfnlh_d0

Stormwind Simulator (very interesting application developed using APL (Dyalog dialect)
https://www.youtube.com/watch?v=O63M3u0sDAg

You can also look at these interesting examples (Caesar Crypto, Letter Encoding and Word Path finder) from Gianfranco Alongi:
https://www.youtube.com/channel/UCNcgWEJ61u3-WECl64Z0Z2g/search?query=apl


By the way, I did not understand them at first, and did not expect myself to do so from the first sight (Who understands maths like so? unless he has some exposure). But I kept repeating it until I saw how compact code can be clear, intuitive and communicate in a way similar to mathematics. (note: while re-watching the video through several days, I was also learning the syntax, and other language related things).

Hope it helps.

Regards,

Ala'a

P.S: the following are added for fun

Dyalog '13: Social Skills for Programmers
  https://www.youtube.com/watch?v=3qGsCrkWT-4

Dyalog14: Distractions
  https://www.youtube.com/watch?v=pVrNT2lGUUo

A Plea for Simplicity
  https://www.youtube.com/watch?v=qSVR4Z3DA24

Dyalog '12: State-free Programming
  https://www.youtube.com/watch?v=L5rYVxPXV70

[toc] | [prev] | [next] | [standalone]

#46300

On Monday, March 28, 2016 at 3:00:47 PM UTC-6, Ala'a wrote:
> > Can you give a brief description of what kind of programs your language would be used for?
> 
> Here are a couple of demos (plus a real application - a simulator) showing the interactivity, terseness and compactness of APL code/notation
> 
> Sudoku Solver in APL
> https://www.youtube.com/watch?v=DmT80OseAGs
> 
> Conway's Game Of Life in APL
> https://www.youtube.com/watch?v=a9xAKttWgP4
> 
> How about a Nice Game of Chess?
> https://www.youtube.com/watch?v=GdG04m1IQ0A
> 
> Depth-first search in APL (this uses the search algo. to solve the n-queens problem)
> https://www.youtube.com/watch?v=DsZdfnlh_d0
> 
> Stormwind Simulator (very interesting application developed using APL (Dyalog dialect)
> https://www.youtube.com/watch?v=O63M3u0sDAg
> 
> You can also look at these interesting examples (Caesar Crypto, Letter Encoding and Word Path finder) from Gianfranco Alongi:
> https://www.youtube.com/channel/UCNcgWEJ61u3-WECl64Z0Z2g/search?query=apl
> 
> 
> By the way, I did not understand them at first, and did not expect myself to do so from the first sight (Who understands maths like so? unless he has some exposure). But I kept repeating it until I saw how compact code can be clear, intuitive and communicate in a way similar to mathematics. (note: while re-watching the video through several days, I was also learning the syntax, and other language related things).
> 
> Hope it helps.
> 
> Regards,
> 
> Ala'a
> 
> P.S: the following are added for fun
> 
> Dyalog '13: Social Skills for Programmers
>   https://www.youtube.com/watch?v=3qGsCrkWT-4
> 
> Dyalog14: Distractions
>   https://www.youtube.com/watch?v=pVrNT2lGUUo
> 
> A Plea for Simplicity
>   https://www.youtube.com/watch?v=qSVR4Z3DA24
> 
> Dyalog '12: State-free Programming
>   https://www.youtube.com/watch?v=L5rYVxPXV70

Ala'a

John Scholes demos you link are masterpieces . There is a great deal to be learned from his notational "aesthetics" .  Another link which gives a good overview of current "traditional" APL is Morten Kromberg's Google tech talk : https://www.youtube.com/watch?v=PlM9BXfu7UY .

In terms of design philosophy , there was a fork in the road when Ken Iverson with his implementer Roger Hui created J which went off in a very mathy direction , and Arthur Whitney created K which took a minimalist path . ( Both for practical reasons abandoned the APL font making them much harder to read , particularly given APL's penchant for overloading than the richer font allows . Moore's simple brilliance in making white space the prime delimiter and names being any sequence of visible characters alleviates much of the problem , but with UTF-8 , etc , I think it's a non issue . ) 

I followed the minimalist K route , with also it's transparent lists of lists structure .

Right now , 4th.CoSy is so raw , executing directly in Reva Forth , that entered integers and floats need to be explicitly converted to lists rather than being parsed directly to lists . 

But the first order of business is functionality and solidity .

[toc] | [prev] | [next] | [standalone]

#46241

Bob Armstrong wrote:

> I'd just like to let everybody know that I feel
> 4th.CoSy , http://www.cosy.com/CoSy/ , is past the
> bushwhacking stage and provides a solid foundation
> for APL level vocabulary on reference counted
> lists of lists  in an open x86 FORTH . I gave a
> demo last Forth Day at Stanford ,
> https://youtu.be/0u2_jKfo0A8?t=2h48m30s .
> 
> If minimal but everyday practical attracts you , check out my
> 
>  "Seeking Alphas" , http://cosy.com/y16/CoSy201601.html

That page shows:


>   s"  CoSy NEEDS MORE HEADS" >t0> rho  ( |>| 22 | ) 
>   t0 i( 7 23 )i take >t0>
>   t0 dup ' reverse 'm ' cL each 
>   R0 dup reverse cL
> ( 
>  s"  CoSy NEEDS MORE HEADS  SDAEH EROM SDEEN ySoC " 
>  s" CoSy NEEDS MORE HEADS CC SDAEH EROM SDEEN ySoC" 
>  s" oSy NEEDS MORE HEADS CooC SDAEH EROM SDEEN ySo" 
>  s" Sy NEEDS MORE HEADS CoSSoC SDAEH EROM SDEEN yS" 
>  s" y NEEDS MORE HEADS CoSyySoC SDAEH EROM SDEEN y" 
>  s"  NEEDS MORE HEADS CoSy  ySoC SDAEH EROM SDEEN " 
>  s" NEEDS MORE HEADS CoSy NN ySoC SDAEH EROM SDEEN" 
>  s" NEEDS MORE HEADS CoSy NN ySoC SDAEH EROM SDEEN" 
>  s"  NEEDS MORE HEADS CoSy  ySoC SDAEH EROM SDEEN " 
>  s" y NEEDS MORE HEADS CoSyySoC SDAEH EROM SDEEN y" 
>  s" Sy NEEDS MORE HEADS CoSSoC SDAEH EROM SDEEN yS" 
>  s" oSy NEEDS MORE HEADS CooC SDAEH EROM SDEEN ySo" 
>  s" CoSy NEEDS MORE HEADS CC SDAEH EROM SDEEN ySoC" 
>  s"  CoSy NEEDS MORE HEADS  SDAEH EROM SDEEN ySoC " 
>  )

That looked like an interesting challenge, so I
tried it in Ruby.

mirror=->(x){x+x.reverse}
s=" RUBY IS FUN ";puts mirror[(0..6).to_a].map{|i|
  mirror[s.chars.rotate i].join}

 RUBY IS FUN  NUF SI YBUR
RUBY IS FUN    NUF SI YBUR
UBY IS FUN  RR  NUF SI YBU
BY IS FUN  RUUR  NUF SI YB
Y IS FUN  RUBBUR  NUF SI Y
 IS FUN  RUBYYBUR  NUF SI
IS FUN  RUBY  YBUR  NUF SI
IS FUN  RUBY  YBUR  NUF SI
 IS FUN  RUBYYBUR  NUF SI
Y IS FUN  RUBBUR  NUF SI Y
BY IS FUN  RUUR  NUF SI YB
UBY IS FUN  RR  NUF SI YBU
RUBY IS FUN    NUF SI YBUR
 RUBY IS FUN  NUF SI YBUR


-- 
When the Israeli bombers and torpedo-planes were sent to attack and destroy the
ship, the Jewish commander, seeing that it was an American vessel, had
misgivings and reported to the High Command, which simply repeated the orders
to attack and sink the Liberty. www.revilo-oliver.com/rpo/Bit_of_Good_News.html

[toc] | [prev] | [next] | [standalone]

#46242

WJ wrote:

> Bob Armstrong wrote:
> 
> > I'd just like to let everybody know that I feel
> > 4th.CoSy , http://www.cosy.com/CoSy/ , is past the
> > bushwhacking stage and provides a solid foundation
> > for APL level vocabulary on reference counted
> > lists of lists  in an open x86 FORTH . I gave a
> > demo last Forth Day at Stanford ,
> > https://youtu.be/0u2_jKfo0A8?t=2h48m30s .
> > 
> > If minimal but everyday practical attracts you , check out my
> > 
> >  "Seeking Alphas" , http://cosy.com/y16/CoSy201601.html
> 
> That page shows:
> 
> 
> >   s"  CoSy NEEDS MORE HEADS" >t0> rho  ( |>| 22 | ) 
> >   t0 i( 7 23 )i take >t0>
> >   t0 dup ' reverse 'm ' cL each 
> >   R0 dup reverse cL
> > ( 
> >  s"  CoSy NEEDS MORE HEADS  SDAEH EROM SDEEN ySoC " 
> >  s" CoSy NEEDS MORE HEADS CC SDAEH EROM SDEEN ySoC" 
> >  s" oSy NEEDS MORE HEADS CooC SDAEH EROM SDEEN ySo" 
> >  s" Sy NEEDS MORE HEADS CoSSoC SDAEH EROM SDEEN yS" 
> >  s" y NEEDS MORE HEADS CoSyySoC SDAEH EROM SDEEN y" 
> >  s"  NEEDS MORE HEADS CoSy  ySoC SDAEH EROM SDEEN " 
> >  s" NEEDS MORE HEADS CoSy NN ySoC SDAEH EROM SDEEN" 
> >  s" NEEDS MORE HEADS CoSy NN ySoC SDAEH EROM SDEEN" 
> >  s"  NEEDS MORE HEADS CoSy  ySoC SDAEH EROM SDEEN " 
> >  s" y NEEDS MORE HEADS CoSyySoC SDAEH EROM SDEEN y" 
> >  s" Sy NEEDS MORE HEADS CoSSoC SDAEH EROM SDEEN yS" 
> >  s" oSy NEEDS MORE HEADS CooC SDAEH EROM SDEEN ySo" 
> >  s" CoSy NEEDS MORE HEADS CC SDAEH EROM SDEEN ySoC" 
> >  s"  CoSy NEEDS MORE HEADS  SDAEH EROM SDEEN ySoC " 
> >  )
> 
> That looked like an interesting challenge, so I
> tried it in Ruby.
> 
> mirror=->(x){x+x.reverse}
> s=" RUBY IS FUN ";puts mirror[(0..6).to_a].map{|i|
>   mirror[s.chars.rotate i].join}
> 
>  RUBY IS FUN  NUF SI YBUR
> RUBY IS FUN    NUF SI YBUR
> UBY IS FUN  RR  NUF SI YBU
> BY IS FUN  RUUR  NUF SI YB
> Y IS FUN  RUBBUR  NUF SI Y
>  IS FUN  RUBYYBUR  NUF SI
> IS FUN  RUBY  YBUR  NUF SI
> IS FUN  RUBY  YBUR  NUF SI
>  IS FUN  RUBYYBUR  NUF SI
> Y IS FUN  RUBBUR  NUF SI Y
> BY IS FUN  RUUR  NUF SI YB
> UBY IS FUN  RR  NUF SI YBU
> RUBY IS FUN    NUF SI YBUR
>  RUBY IS FUN  NUF SI YBUR

Shorter:

mirror=->(x){x+x.reverse}
puts mirror[(0..6).to_a].map{|i| mirror[" RUBY IS FUN ".chars.rotate i].join}

[toc] | [prev] | [next] | [standalone]

#46263

On Sunday, March 27, 2016 at 10:58:06 PM UTC-6, WJ wrote:
> WJ wrote:
> 
> > Bob Armstrong wrote:
> > 
> > > I'd just like to let everybody know that I feel
> > > 4th.CoSy , http://www.cosy.com/CoSy/ , is past the
> > > bushwhacking stage and provides a solid foundation
> > > for APL level vocabulary on reference counted
> > > lists of lists  in an open x86 FORTH . I gave a
> > > demo last Forth Day at Stanford ,
> > > https://youtu.be/0u2_jKfo0A8?t=2h48m30s .
> > > 
> > > If minimal but everyday practical attracts you , check out my
> > > 
> > >  "Seeking Alphas" , http://cosy.com/y16/CoSy201601.html
> > 
> > That page shows:
> > 
> > 
> > >   s"  CoSy NEEDS MORE HEADS" >t0> rho  ( |>| 22 | ) 
> > >   t0 i( 7 23 )i take >t0>
> > >   t0 dup ' reverse 'm ' cL each 
> > >   R0 dup reverse cL
> > > ( 
> > >  s"  CoSy NEEDS MORE HEADS  SDAEH EROM SDEEN ySoC " 
> > >  s" CoSy NEEDS MORE HEADS CC SDAEH EROM SDEEN ySoC" 
> > >  s" oSy NEEDS MORE HEADS CooC SDAEH EROM SDEEN ySo" 
> > >  s" Sy NEEDS MORE HEADS CoSSoC SDAEH EROM SDEEN yS" 
> > >  s" y NEEDS MORE HEADS CoSyySoC SDAEH EROM SDEEN y" 
> > >  s"  NEEDS MORE HEADS CoSy  ySoC SDAEH EROM SDEEN " 
> > >  s" NEEDS MORE HEADS CoSy NN ySoC SDAEH EROM SDEEN" 
> > >  s" NEEDS MORE HEADS CoSy NN ySoC SDAEH EROM SDEEN" 
> > >  s"  NEEDS MORE HEADS CoSy  ySoC SDAEH EROM SDEEN " 
> > >  s" y NEEDS MORE HEADS CoSyySoC SDAEH EROM SDEEN y" 
> > >  s" Sy NEEDS MORE HEADS CoSSoC SDAEH EROM SDEEN yS" 
> > >  s" oSy NEEDS MORE HEADS CooC SDAEH EROM SDEEN ySo" 
> > >  s" CoSy NEEDS MORE HEADS CC SDAEH EROM SDEEN ySoC" 
> > >  s"  CoSy NEEDS MORE HEADS  SDAEH EROM SDEEN ySoC " 
> > >  )
> > 
> > That looked like an interesting challenge, so I
> > tried it in Ruby.
> > 
> > mirror=->(x){x+x.reverse}
> > s=" RUBY IS FUN ";puts mirror[(0..6).to_a].map{|i|
> >   mirror[s.chars.rotate i].join}
> > 
> >  RUBY IS FUN  NUF SI YBUR
> > RUBY IS FUN    NUF SI YBUR
> > UBY IS FUN  RR  NUF SI YBU
> > BY IS FUN  RUUR  NUF SI YB
> > Y IS FUN  RUBBUR  NUF SI Y
> >  IS FUN  RUBYYBUR  NUF SI
> > IS FUN  RUBY  YBUR  NUF SI
> > IS FUN  RUBY  YBUR  NUF SI
> >  IS FUN  RUBYYBUR  NUF SI
> > Y IS FUN  RUBBUR  NUF SI Y
> > BY IS FUN  RUUR  NUF SI YB
> > UBY IS FUN  RR  NUF SI YBU
> > RUBY IS FUN    NUF SI YBUR
> >  RUBY IS FUN  NUF SI YBUR
> 
> Shorter:
> 
> mirror=->(x){x+x.reverse}
> puts mirror[(0..6).to_a].map{|i| mirror[" RUBY IS FUN ".chars.rotate i].join}

Realize that in my demo I split each step into separate lines so the result of each operation would be displayed .

Here's a version of the demo in K which is by far the major direct influence on 4th.CoSy :

  demo
   Try eg : demo "THANK YOU ! "  .  Showed it to Vidal Sasson ~ `82 
  { t0 , | t0 :  x ,' |:' x : 11 37 # x }

Note that K ( and 4th.CoSy ) being essentially functional , the expression above only outputs the result matrix if not assigned to something . E.g :
  Q : demo "THANK YOU ! "
  ^ Q
22 74 

Over the decades there has been a lot of borrowing of concepts from APL and a lot of convergent evolution .

Is there any Ruby written in Forth ?

[toc] | [prev] | [next] | [standalone]

#46265

On Monday, March 28, 2016 at 2:03:07 PM UTC-7, Bob Armstrong wrote:
> On Sunday, March 27, 2016 at 10:58:06 PM UTC-6, WJ wrote:
> > WJ wrote:
> > > That looked like an interesting challenge, so I
> > > tried it in Ruby.

WJ is always promoting some non-Forth language on comp.lang.forth --- these are always dynamic-OOP languages that offer convenience but are quite slow --- this is spam that has nothing to do with Forth, so I just tag WJ's posts as abuse.

> Is there any Ruby written in Forth ?

It would be possible to write a dynamic-OOP interpreter in Forth. Most of them, such as Python, are written in C, and I don't know of any reason why Forth could be used instead. 

If you want a Forth-like dynamic-OOP language though, then I would recommend Factor or oForth.

[toc] | [prev] | [next] | [standalone]

#46303

On Monday, March 28, 2016 at 3:46:16 PM UTC-6, hughag...@gmail.com wrote:
> On Monday, March 28, 2016 at 2:03:07 PM UTC-7, Bob Armstrong wrote:
> > On Sunday, March 27, 2016 at 10:58:06 PM UTC-6, WJ wrote:
> > > WJ wrote:
> > > > That looked like an interesting challenge, so I
> > > > tried it in Ruby.
> 
> WJ is always promoting some non-Forth language on comp.lang.forth --- these are always dynamic-OOP languages that offer convenience but are quite slow --- this is spam that has nothing to do with Forth, so I just tag WJ's posts as abuse.
> 
> > Is there any Ruby written in Forth ?
> 
> It would be possible to write a dynamic-OOP interpreter in Forth. Most of them, such as Python, are written in C, and I don't know of any reason why Forth could be used instead. 
> 
> If you want a Forth-like dynamic-OOP language though, then I would recommend Factor or oForth.

Actually the creation of a solid vocabulary for reference counted dynamic lists of lists is the core , and perhaps most valuable "contribution" of 4th.CoSy .

It expands the domain of Forth to arbitrarily complex interactive problems .

  text> >t0> rho  |>| 73641 
  t0 vm rho |>| 1753 

 ' text>   returns the text in the note window I'm working in as a string . 
 ' vm      splits it on new lines into a list of 1753 strings ( char lists )
which all are freed as soon as the count is extracted by  ' rho . ( The greek letter rho is the traditional symbol for "count" or "shape" of an APL object . )

I consider Slava Pestov a great programmer . I use his early creation jEdit as my code editor and will until similar functionality is created within 4th.CoSy . I took a hard look at Factor determining whether I might better just switch to building CoSy in it rather than continuing to build directly from the Forth up : http://cosy.com/CoSy/CoSy/ReCoSy20101200.html .

I don't see much point in writing a Forth in some higher level language except for uses like Brad Nelson's Forth Haiku in JavaScript : http://forthsalon.appspot.com/ .

All APLs that I am aware of are written in C ( That may even include IBM's . ) 

[toc] | [prev] | [next] | [standalone]

#46336

On 29/03/2016 00:03, Bob Armstrong wrote:

>>>>   s"  CoSy NEEDS MORE HEADS" >t0> rho  ( |>| 22 | ) 
>>>>   t0 i( 7 23 )i take >t0>
>>>>   t0 dup ' reverse 'm ' cL each 
>>>>   R0 dup reverse cL
>>>> ( 
>>>>  s"  CoSy NEEDS MORE HEADS  SDAEH EROM SDEEN ySoC " 
>>>>  s" CoSy NEEDS MORE HEADS CC SDAEH EROM SDEEN ySoC" 
>>>>  s" oSy NEEDS MORE HEADS CooC SDAEH EROM SDEEN ySo" 
>>>>  s" Sy NEEDS MORE HEADS CoSSoC SDAEH EROM SDEEN yS" 
>>>>  s" y NEEDS MORE HEADS CoSyySoC SDAEH EROM SDEEN y" 
>>>>  s"  NEEDS MORE HEADS CoSy  ySoC SDAEH EROM SDEEN " 
>>>>  s" NEEDS MORE HEADS CoSy NN ySoC SDAEH EROM SDEEN" 
>>>>  s" NEEDS MORE HEADS CoSy NN ySoC SDAEH EROM SDEEN" 
>>>>  s"  NEEDS MORE HEADS CoSy  ySoC SDAEH EROM SDEEN " 
>>>>  s" y NEEDS MORE HEADS CoSyySoC SDAEH EROM SDEEN y" 
>>>>  s" Sy NEEDS MORE HEADS CoSSoC SDAEH EROM SDEEN yS" 
>>>>  s" oSy NEEDS MORE HEADS CooC SDAEH EROM SDEEN ySo" 
>>>>  s" CoSy NEEDS MORE HEADS CC SDAEH EROM SDEEN ySoC" 
>>>>  s"  CoSy NEEDS MORE HEADS  SDAEH EROM SDEEN ySoC " 
>>>>  )

A version in 8th (not as concise as your 4th.CoSy version):

http://8th-dev.com/forum/index.php/topic,889.0.html

[toc] | [prev] | [next] | [standalone]

#46264

WJ wrote:

> WJ wrote:
> 
> > Bob Armstrong wrote:
> > 
> > > I'd just like to let everybody know that I feel
> > > 4th.CoSy , http://www.cosy.com/CoSy/ , is past the
> > > bushwhacking stage and provides a solid foundation
> > > for APL level vocabulary on reference counted
> > > lists of lists  in an open x86 FORTH . I gave a
> > > demo last Forth Day at Stanford ,
> > > https://youtu.be/0u2_jKfo0A8?t=2h48m30s .
> > > 
> > > If minimal but everyday practical attracts you , check out my
> > > 
> > >  "Seeking Alphas" , http://cosy.com/y16/CoSy201601.html
> > 
> > That page shows:
> > 
> > 
> > >   s"  CoSy NEEDS MORE HEADS" >t0> rho  ( |>| 22 | ) 
> > >   t0 i( 7 23 )i take >t0>
> > >   t0 dup ' reverse 'm ' cL each 
> > >   R0 dup reverse cL
> > > ( 
> > >  s"  CoSy NEEDS MORE HEADS  SDAEH EROM SDEEN ySoC " 
> > >  s" CoSy NEEDS MORE HEADS CC SDAEH EROM SDEEN ySoC" 
> > >  s" oSy NEEDS MORE HEADS CooC SDAEH EROM SDEEN ySo" 
> > >  s" Sy NEEDS MORE HEADS CoSSoC SDAEH EROM SDEEN yS" 
> > >  s" y NEEDS MORE HEADS CoSyySoC SDAEH EROM SDEEN y" 
> > >  s"  NEEDS MORE HEADS CoSy  ySoC SDAEH EROM SDEEN " 
> > >  s" NEEDS MORE HEADS CoSy NN ySoC SDAEH EROM SDEEN" 
> > >  s" NEEDS MORE HEADS CoSy NN ySoC SDAEH EROM SDEEN" 
> > >  s"  NEEDS MORE HEADS CoSy  ySoC SDAEH EROM SDEEN " 
> > >  s" y NEEDS MORE HEADS CoSyySoC SDAEH EROM SDEEN y" 
> > >  s" Sy NEEDS MORE HEADS CoSSoC SDAEH EROM SDEEN yS" 
> > >  s" oSy NEEDS MORE HEADS CooC SDAEH EROM SDEEN ySo" 
> > >  s" CoSy NEEDS MORE HEADS CC SDAEH EROM SDEEN ySoC" 
> > >  s"  CoSy NEEDS MORE HEADS  SDAEH EROM SDEEN ySoC " 
> > >  )
> > 
> > That looked like an interesting challenge, so I
> > tried it in Ruby.
> > 
> > mirror=->(x){x+x.reverse}
> > s=" RUBY IS FUN ";puts mirror[(0..6).to_a].map{|i|
> >   mirror[s.chars.rotate i].join}
> > 
> >  RUBY IS FUN  NUF SI YBUR
> > RUBY IS FUN    NUF SI YBUR
> > UBY IS FUN  RR  NUF SI YBU
> > BY IS FUN  RUUR  NUF SI YB
> > Y IS FUN  RUBBUR  NUF SI Y
> >  IS FUN  RUBYYBUR  NUF SI
> > IS FUN  RUBY  YBUR  NUF SI
> > IS FUN  RUBY  YBUR  NUF SI
> >  IS FUN  RUBYYBUR  NUF SI
> > Y IS FUN  RUBBUR  NUF SI Y
> > BY IS FUN  RUUR  NUF SI YB
> > UBY IS FUN  RR  NUF SI YBU
> > RUBY IS FUN    NUF SI YBUR
> >  RUBY IS FUN  NUF SI YBUR
> 
> Shorter:
> 
> mirror=->(x){x+x.reverse}
> puts mirror[(0..6).to_a].map{|i| mirror[" RUBY IS FUN ".chars.rotate i].join}

Shorter yet:

mirror=->x{x+x.reverse}
puts mirror[(0..6).to_a].map{|i|mirror[" RUBY IS FUN ".chars.rotate i].join}

[toc] | [prev] | [next] | [standalone]

#46320

WJ wrote:

> Bob Armstrong wrote:
> 
> > I'd just like to let everybody know that I feel
> > 4th.CoSy , http://www.cosy.com/CoSy/ , is past the
> > bushwhacking stage and provides a solid foundation
> > for APL level vocabulary on reference counted
> > lists of lists  in an open x86 FORTH . I gave a
> > demo last Forth Day at Stanford ,
> > https://youtu.be/0u2_jKfo0A8?t=2h48m30s .
> > 
> > If minimal but everyday practical attracts you , check out my
> > 
> >  "Seeking Alphas" , http://cosy.com/y16/CoSy201601.html
> 
> That page shows:
> 
> 
> >   s"  CoSy NEEDS MORE HEADS" >t0> rho  ( |>| 22 | ) 
> >   t0 i( 7 23 )i take >t0>
> >   t0 dup ' reverse 'm ' cL each 
> >   R0 dup reverse cL
> > ( 
> >  s"  CoSy NEEDS MORE HEADS  SDAEH EROM SDEEN ySoC " 
> >  s" CoSy NEEDS MORE HEADS CC SDAEH EROM SDEEN ySoC" 
> >  s" oSy NEEDS MORE HEADS CooC SDAEH EROM SDEEN ySo" 
> >  s" Sy NEEDS MORE HEADS CoSSoC SDAEH EROM SDEEN yS" 
> >  s" y NEEDS MORE HEADS CoSyySoC SDAEH EROM SDEEN y" 
> >  s"  NEEDS MORE HEADS CoSy  ySoC SDAEH EROM SDEEN " 
> >  s" NEEDS MORE HEADS CoSy NN ySoC SDAEH EROM SDEEN" 
> >  s" NEEDS MORE HEADS CoSy NN ySoC SDAEH EROM SDEEN" 
> >  s"  NEEDS MORE HEADS CoSy  ySoC SDAEH EROM SDEEN " 
> >  s" y NEEDS MORE HEADS CoSyySoC SDAEH EROM SDEEN y" 
> >  s" Sy NEEDS MORE HEADS CoSSoC SDAEH EROM SDEEN yS" 
> >  s" oSy NEEDS MORE HEADS CooC SDAEH EROM SDEEN ySo" 
> >  s" CoSy NEEDS MORE HEADS CC SDAEH EROM SDEEN ySoC" 
> >  s"  CoSy NEEDS MORE HEADS  SDAEH EROM SDEEN ySoC " 
> >  )
> 

OCaml:

open String ;;

(*  Make list of integers from a to b.  *)
let rec (--) a b = if a>b then [] else a::(a+1)--b ;;

let explode str = Stream.npeek (length str) (Stream.of_string str);;

let implode ch_list =
  List.fold_left (fun str chr -> str ^ (make 1 chr)) "" ch_list ;;

let mirror list = list @ (List.rev list) ;;

let rotate str n = sub str n ((length str) - n) ^ sub str 0 n ;;

List.map
  (fun i -> implode (mirror (explode (rotate " OCAML IS FUN " i))))
  (mirror (0--7)) ;;

[" OCAML IS FUN  NUF SI LMACO ";
 "OCAML IS FUN    NUF SI LMACO";
 "CAML IS FUN  OO  NUF SI LMAC";
 "AML IS FUN  OCCO  NUF SI LMA";
 "ML IS FUN  OCAACO  NUF SI LM";
 "L IS FUN  OCAMMACO  NUF SI L";
 " IS FUN  OCAMLLMACO  NUF SI ";
 "IS FUN  OCAML  LMACO  NUF SI";
 "IS FUN  OCAML  LMACO  NUF SI";
 " IS FUN  OCAMLLMACO  NUF SI ";
 "L IS FUN  OCAMMACO  NUF SI L";
 "ML IS FUN  OCAACO  NUF SI LM";
 "AML IS FUN  OCCO  NUF SI LMA";
 "CAML IS FUN  OO  NUF SI LMAC";
 "OCAML IS FUN    NUF SI LMACO";
 " OCAML IS FUN  NUF SI LMACO "]

-- 
I would hesitate to describe America as a nation at all in 1997, because it is
something very different: a polyethnic federation administered by a single
ruling class....  [T]he accumulated rot in America has now reached a point
where the pillars of society itself are failing.  --- Ambrose Evans-Pritchard

[toc] | [prev] | [next] | [standalone]

#46249

On Sunday, March 27, 2016 at 2:30:26 PM UTC-7, Bob Armstrong wrote:
> I'd just like to let everybody know that I feel 4th.CoSy , http://www.cosy.com/CoSy/ , is past the bushwhacking stage and provides a solid foundation for APL level vocabulary on reference counted lists of lists  in an open x86 FORTH . I gave a demo last Forth Day at Stanford , https://youtu.be/0u2_jKfo0A8?t=2h48m30s .
> 
> If minimal but everyday practical attracts you , check out my
> 
>  "Seeking Alphas" , http://cosy.com/y16/CoSy201601.html
> 
> Download a 0 cost copy ; see if it works for you ;
> comment and question on the Disqus blog on any relevant page ( and subscribe ) , or contact me by email .  Let me know of any tasks where 4th.CoSy may more than fill the gap between user and machine left by traditional APLs .

Okay, I've read through your website and found that you do mean APL the math language.

Does you language have anything to do with manipulating sets, as in Hilbert Space?

Is your language written in ANS-Forth? Can it be compiled under VFX or any Forth system other than Reva? I don't want to run Reva on my computer because it comes from Israel and hence may have viruses --- I don't trust Israel any more than I would trust Nigeria or Russia or any other country that has a history of espionage and/or cyber-attacks against America.

[toc] | [prev] | [next] | [standalone]

#46260

On Monday, March 28, 2016 at 12:34:58 PM UTC-6, hughag...@gmail.com wrote:
> On Sunday, March 27, 2016 at 2:30:26 PM UTC-7, Bob Armstrong wrote:
> > I'd just like to let everybody know that I feel 4th.CoSy , http://www.cosy.com/CoSy/ , is past the bushwhacking stage and provides a solid foundation for APL level vocabulary on reference counted lists of lists  in an open x86 FORTH . I gave a demo last Forth Day at Stanford , https://youtu.be/0u2_jKfo0A8?t=2h48m30s .
> > 
> > If minimal but everyday practical attracts you , check out my
> > 
> >  "Seeking Alphas" , http://cosy.com/y16/CoSy201601.html
> > 
> > Download a 0 cost copy ; see if it works for you ;
> > comment and question on the Disqus blog on any relevant page ( and subscribe ) , or contact me by email .  Let me know of any tasks where 4th.CoSy may more than fill the gap between user and machine left by traditional APLs .
> 
> Okay, I've read through your website and found that you do mean APL the math language.
> 
> Does you language have anything to do with manipulating sets, as in Hilbert Space?
> 
> Is your language written in ANS-Forth? Can it be compiled under VFX or any Forth system other than Reva? I don't want to run Reva on my computer because it comes from Israel and hence may have viruses --- I don't trust Israel any more than I would trust Nigeria or Russia or any other country that has a history of espionage and/or cyber-attacks against America.

APLs have always been about operations on finite data . In 4th.CoSy that reduces to operations on lists of lists .

[toc] | [prev] | [next] | [standalone]

Page 1 of 2  [1] 2  Next page →

Back to top | Article view | comp.lang.forth

csiph-web