Re: Lambda recursions on the example of generating permutations

2023-04-04 Thread Robin Haberkorn
Hello Jürgen, 04.04.23 17:58, Dr. Jürgen Sauermann пишет: ... A language does not necessarily get better as the number of its features grows (see PL/I or Ada). Totally agree. I am a language minimalist myself. Many languages suffer from what I call "feautureitis", ie. trying to stuff as many

Re: Lambda recursions on the example of generating permutations

2023-04-04 Thread Robin Haberkorn
Hello Jürgen, thank you. I can confirm that the fix works. Best regards, Robin 04.04.23 20:47, Dr. Jürgen Sauermann пишет: Hi Robin, yes it is. Fixed in *SVN 1675*. Windows files are rarely updated, for an up-to-date windows version: install cygwin, check out from SVN, then ./configure ; ma

Re: Lambda recursions on the example of generating permutations

2023-04-04 Thread Dr . Jürgen Sauermann
Hi Robin, yes it is. Fixed in *SVN 1675*. Windows files are rarely updated, for an up-to-date windows version: install cygwin, check out from SVN, then ./configure ; make ; sudo make install like in GNU/Linux. Best Regards, Jürgen On 4/4/23 14:20, Robin Haberkorn wrote: Perm ← {(X/⍨⍺=+/¨X←

Re: Lambda recursions on the example of generating permutations

2023-04-04 Thread Dr . Jürgen Sauermann
Hi Robert, I have quite a few thoughts when in comes to lambdas, in particular named lambdas and multi-line lambdas. The limitations that you see are primarily caused by concerns that otherwise APL would develop into a non-APL direction. A language does not necessarily get better as the numbe

Re: Lambda recursions on the example of generating permutations

2023-04-04 Thread Robin Haberkorn
Perm ← {(X/⍨⍺=+/¨X←(⊂2⍴⍨⍵)⊤¨⍳2*⍵) /¨ ⊂⍳⍵; X} Works on v1.8-1 (the Debian package), but NOT v1.8 for Windows (apl-1.8-windows.zip). Also it does not work on the SVN trunk! This version however works on the aforementioned versions: Perm ← {(X/⍨⍺=+/¨X←(⊂2⍴⍨⍵)⊤¨⍳2*⍵) {⍺/⍵}¨ ⊂⍳⍵; X} Which is clea