Menu
▾
▴
lang5-general — Mailing list for general questions and discussions about 5
You can subscribe to this list here.
| 2010 |
Jan
|
Feb
|
Mar
(2) |
Apr
(1) |
May
(3) |
Jun
|
Jul
|
Aug
(1) |
Sep
|
Oct
|
Nov
|
Dec
|
|---|
|
From: <ul...@va...> - 2010-08-07 13:35:53
|
Hello all -
there is a (rather) new release of 5 available for download. This new release
includes the following two main changes:
+ It is now possible to apply a binary operator to a scalar and an array (prior
to this only the other way around worked), so you can now write
1 [1 2 3] + .
to get [2 3 4] as a result.
+ Using NYTProf, Thomas and I sped up the overall execution of the interpreter
by roughly a factor of three! Calculating all perfect numbers between 1 and
500 by
: p{u}
dup dup 1 - iota 1 + dup rot swap
% not select '+ reduce ==
;
500 iota 1 + dup p select .
runs in 1.2 seconds on my MACbook Air instead of way more than 5 seconds
before. The same speedup holds true for all other test programs we used.
+ The documentation directory now contains the slides for my YAPC::Europe 2010
talk that I gave yesterday.
Have fun with the improved interpreter - all the best - Bernd. :-)
|
|
From: <ul...@va...> - 2010-05-31 11:52:35
|
A new release of 5 is now available at https://sourceforge.net/projects/lang5/files This release incorporates the following changes and extensions: + subscript can now handle even complex coordinate vectors and is not restricted to selecting elements along the first dimension only, as the following example shows: 64 iota [4 4 4]B rho [1 [1 2]B [1 2 3]]B subscript . + Added a function "copy" which copies successive elements from a deeply nested structure, controlled by a two element coordinate vector which contains the coordinates of the upper left and lower right corner of an n-dimensional sub-cube of the basic nested structure. The following example shows the behaviour of copy quite well: 64 iota [4 4 4] rho [[1 1 1]B [2 2 2]] copy . + Added a function "help" which prints the description of builtin functions and operators. Try '+ help + The output generated by specifying the statistics option -s now contains the maximum stack depth encountered during a program run (this value is surprisingly small). Have fun with 5 and give us, the developers, some feedback. All the best - Bernd. :-) |
|
From: Terrence B. <sch...@gm...> - 2010-05-13 14:16:28
|
I dont know if this recent module is of interest - http://search.cpan.org/~jjore/Judy-0.22/lib/Judy.pod |
|
From: <ul...@va...> - 2010-05-02 13:58:48
|
Version 0.1 of 5 is now available at https://sourceforge.net/projects/lang5/files This version includes functions like "dim", "rho" and "collapse" that greatly facilitate the handling of deeply nested structures. In addition to this a number of bugs have been fixed and all feature requests have been satisfied. The documentation directory now contains the first version of an introductory text which is up to date and reflects this latest version of 5. Have fun with 5 - best regards - Bernd. :-) |
|
From: Terrence B. <sch...@gm...> - 2010-04-12 18:22:17
|
Fabrice/Owen: Regarding your (Math|Parse)::RPN CPAN modules, I wanted to make you aware of a similar and highly ambitious Perl-based project - the "5" language: http://lang5.sourceforge.net/ There were some slides on the 5 language available, but I cant seem to locate them on the net anymore. |
|
From: <ul...@va...> - 2010-03-28 13:00:24
|
Hello Terrence - thank you very much for your mail (sorry for the late reply but yesterday was a rather busy day). As far as I know, APL has no distinct rank concept - J introduced rank but the only thing in APL which can be used to apply functions in an element wise fashion to the elements of nested structures is the so called component operator (two dots in a row like the dots in a German "Umlaut" character). Using this component operator you can implicitly iterate over nested structures in APL. The re-implementation of 5 which Thomas currently undertakes will extend the interpreter so that it will be possible to supply additional information during a word definition which will allow words to be recognized by the interpreter as being unary or binary. Such words will then be applied in an element wise fashion to all elements of one or two corresponding nested structures. If one wants to avoid this element wise application, it is just necessary to leave out the unary/binary distinction from the word definition - in this case the interpreter will apply the word to the array as a whole (relying on the fact that built-in operators which are unary or binary will be applied element wise). Concerning a source code repository: We are already using the SVN supplied by SourceForge, so we should all rely on this as the central repository: https://sourceforge.net/scm/?type=svn&group_id=299543 Currently we have no branches at all and the re-implementation is done in a separate subdirectory in the main trunk. Have a great day - sincerely, Bernd. |
|
From: Terrence B. <sch...@gm...> - 2010-03-27 13:06:02
|
Hello all, just a few questions On Thu, Mar 25, 2010 at 6:03 AM, <ul...@va...> wrote: > > Top among the things we will change is that we will give up > the distinction between > operators, functions and words. I'm familiar with J (a language evolved from APL). I'm wondering if APL has the concept of "rank" for it's functions, meaning that they will automatically decompose their array argument into pieces. If so, I wonder how APL functions will cooperate with forth and lisp functions, which dont have rank. > Instead one can specify during word > definition how many stack > elements will be consumed and how many will be written back to the > stack. I've always wondered how languages with fixed amounts of arguments deal with optional arguments. > Apart from this we are currently breaking up the very > monolithic interpreter design > - tomorrow is our next Hackathon :-) to continue this work. I went ahead and uploaded the original source to github ( http://github.com/metaperl/L5 ) ... it seems that you are working without a publicly available source repository? Are there any plans to upload this to CPAN? If so, it probably would be packaged as Language::5. The problem with that is that "5" does not start with a letter and I am not sure if that is allowed, it is certainly unusual. |