Lev and Dex

General APL language issues

Lev and Dex

Postby JohnS|Dyalog on Sun Dec 20, 2009 8:45 am

There has been some debate in the Yahoo group about the proposed implementation of Lev and Dex .

Dex is, I think, uncontentious: it will be a marginally quicker and shorter alias of {⍵}, which ignores its left argument (if there is one) and returns its right argument as an explicit result.

Lev is also straightforward as long as a left argument is present: it is an alias of {⍺}, which ignores its right argument and returns its left argument.

However, what should Lev do if called monadically (without a left argument)?

A number of suggestions have been proposed:

Code: Select all
    levJ ← {×⎕nc'⍺':⍺ ⋄ ⍵        }      ⍝ return ⍵. Same as J's "[".
    lev0 ← {×⎕nc'⍺':⍺ ⋄ 0 0⍴0    }      ⍝ return non-displaying null.
    lev2 ← {×⎕nc'⍺':⍺ ⋄ ⎕signal 2}      ⍝ signal SYNTAX ERROR
    lev_ ← {×⎕nc'⍺':⍺            }      ⍝ return "void" (don't return a result).
    lev6 ← {×⎕nc'⍺':⍺ ⋄ ⎕signal 6}      ⍝ signal VALUE ERROR (same as {⍺}).

If we take each of these definitions for a (monadic) spin, this is what we find:

Code: Select all
      levJ 456         ⍝ return right arg
456
      10 × levJ 456    ⍝ 10 × right arg
4560

Code: Select all
      lev0 456         ⍝ return null matrix
      10 × lev0 456    ⍝ 10 × null matrix


Code: Select all
      lev2 456         ⍝ no left arg for dyadic fn (cf: =⍵)
SYNTAX ERROR
      10 × lev2 456    ⍝ ditto
SYNTAX ERROR

Code: Select all
      lev_ 456         ⍝ calling context doesn't require result: OK.
      10×lev_ 456      ⍝ calling context requires missing result.
VALUE ERROR

Code: Select all
      lev6 456         ⍝ no left arg
VALUE ERROR
      10×lev6 456      ⍝ ditto
VALUE ERROR

Any thoughts?
JohnS|Dyalog
 

Re: Lev and Dex

Postby giangiquario on Sun Dec 20, 2009 10:47 am

my preference: do not implement the LEV primitive.

In case that we need to use it, we can write
Code: Select all
 ⊢⍨

that is both monadic and diadic

Probably my opinion has a minor share and LEV shall have an implementation: please let it be a scalar (monadic and diadic) function
User avatar
giangiquario
 
Posts: 46
Joined: Thu Nov 26, 2009 8:55 am
Location: Milano, Italia

Re: Lev and Dex

Postby Phil Last on Sun Dec 20, 2009 11:31 am

I don't know if this is quite what Gianluigi means but I've always harboured a wish that lev and dex were scalar functions rather than, as Ken defined them, having infinite rank. The repercussions would be interesting at least:

Code: Select all
      1 ⊣ 2
1
      1 ⊣ 2 3
1 1
      DISPLAY 1 7 9 ⊣ ⊂2 1⍴'Hello' 'world
┌→────────────────────────────────────────────────┐
│ ┌→────────────┐ ┌→────────────┐ ┌→────────────┐ │
│ ↓ ┌→──────┐   │ ↓ ┌→──────┐   │ ↓ ┌→──────┐   │ │
│ │ │1 1 1 1│   │ │ │7 7 7 7│   │ │ │9 9 9 9│   │ │
│ │ └~──────┘   │ │ └~──────┘   │ │ └~──────┘   │ │
│ │ ┌→────────┐ │ │ ┌→────────┐ │ │ ┌→────────┐ │ │
│ │ │1 1 1 1 1│ │ │ │7 7 7 7 7│ │ │ │9 9 9 9 9│ │ │
│ │ └~────────┘ │ │ └~────────┘ │ │ └~────────┘ │ │
│ └∊────────────┘ └∊────────────┘ └∊────────────┘ │
└∊────────────────────────────────────────────────┘

Of course as Dan said in dyalogusers, with the rank operator we can do this (more or less) anyway.
User avatar
Phil Last
 
Posts: 628
Joined: Thu Jun 18, 2009 6:29 pm
Location: Wessex

Re: Lev and Dex

Postby JohnS|Dyalog on Sun Dec 20, 2009 11:59 am

FYI: I think that Gianluigi's proposal:

Code: Select all
    lev ← ⊢⍨

gives us the same functionality as levJ from above.
JohnS|Dyalog
 

Re: Lev and Dex

Postby Phil Last on Sun Dec 20, 2009 12:07 pm

Yes. This is the equivalent I use {⍵}⍨ to allow function/array ambivalence in operators.
User avatar
Phil Last
 
Posts: 628
Joined: Thu Jun 18, 2009 6:29 pm
Location: Wessex

Re: Lev and Dex

Postby JohnS|Dyalog on Sun Dec 20, 2009 12:30 pm

... and Giangi's scalar lev idea, if I understand it, would make:

Code: Select all
      0⊣⍵

a nippy alternative to

Code: Select all
      (⍴⍵)⍴0

for simple ⍵.
JohnS|Dyalog
 

Re: Lev and Dex

Postby Dick Bowman on Mon Dec 21, 2009 7:51 am

My view (as of today - it may change in the future)...

[0] Please call the dyadic cases "Left" and "Right".
[1] My Iverson APL Reference manual (page 5-44) offers an interesting alternative verbalisation for "Left", as in
n*2 ⊣ n←3 ("n to the power 2 where n is 3")
[2] I don't see any real utility in the monadic(s), but if they were defined I'd prefer the J definition (and naming - call it/them "Same")
Visit http://apl.dickbowman.com to read more from Dick Bowman
User avatar
Dick Bowman
 
Posts: 235
Joined: Thu Jun 18, 2009 4:55 pm

Re: Lev and Dex

Postby DanB|Dyalog on Mon Dec 21, 2009 1:54 pm

Careful not to confuse rank with pervasiveness. With rank only the example
Code: Select all
      DISPLAY 1 7 9 ⊣ ⊂2 1⍴'Hello' 'world'

would be
1 7 9
regardless of rank setting (0 or infinite)
My vote for default rank would be infinite. Otherwise you would have to set 'rank 99' (there is no infinite in Dyalog) everytime you want to discard the right arg, e.g.
Code: Select all
     year←2009 ⊣ name←'danb'

/D

Phil Last wrote:I don't know if this is quite what Gianluigi means but I've always harboured a wish that lev and dex were scalar functions rather than, as Ken defined them, having infinite rank. The repercussions would be interesting at least:

Code: Select all
      1 ⊣ 2
1
      1 ⊣ 2 3
1 1
      DISPLAY 1 7 9 ⊣ ⊂2 1⍴'Hello' 'world
┌→────────────────────────────────────────────────┐
│ ┌→────────────┐ ┌→────────────┐ ┌→────────────┐ │
│ ↓ ┌→──────┐   │ ↓ ┌→──────┐   │ ↓ ┌→──────┐   │ │
│ │ │1 1 1 1│   │ │ │7 7 7 7│   │ │ │9 9 9 9│   │ │
│ │ └~──────┘   │ │ └~──────┘   │ │ └~──────┘   │ │
│ │ ┌→────────┐ │ │ ┌→────────┐ │ │ ┌→────────┐ │ │
│ │ │1 1 1 1 1│ │ │ │7 7 7 7 7│ │ │ │9 9 9 9 9│ │ │
│ │ └~────────┘ │ │ └~────────┘ │ │ └~────────┘ │ │
│ └∊────────────┘ └∊────────────┘ └∊────────────┘ │
└∊────────────────────────────────────────────────┘

Of course as Dan said in dyalogusers, with the rank operator we can do this (more or less) anyway.
DanB|Dyalog
 

Re: Lev and Dex

Postby giangiquario on Mon Dec 21, 2009 2:40 pm

My proposal is:
DEX primitive must be pervasive (scalar function, i.e. rank 0 function). In this way we have a new usefull dyadic function which maintains a kind of link between left and right argument.

If we want a dull "DISCARD" function (rank 99 function), we can continue to use {⍵} or {⍵}⍨
User avatar
giangiquario
 
Posts: 46
Joined: Thu Nov 26, 2009 8:55 am
Location: Milano, Italia

Re: Lev and Dex

Postby Phil Last on Tue Dec 22, 2009 12:35 am

DanB|Dyalog wrote:Careful not to confuse rank with pervasiveness. With rank only the example
. . . DISPLAY 1 7 9 ⊣ ⊂2 1⍴'Hello' 'world'
would be
1 7 9
regardless of rank setting (0 or infinite)

I knew someone would notice. The concept of scalar function everywhere but in Sharp APL and J automatically goes hand-in-hand with pervasiveness as we have only the numeric scalar functions as examples. So when I mentioned infinite rank I was careful to contrast it with "scalar" rather than "rank zero".

Interesting to note that scalar (pervasive) "right" and "left" are easy to emulate for numbers:
. . . right←{⍵+⍺≠⍺} ⋄ left←{⍺+⍵≠⍵}
or
. . . right←+∘(≠⍨)⍨ ⋄ left←+∘(≠⍨)⍨⍨
but not so for other domains.
We can use these with any domain for the "other" argument, as = and ≠ are applicable to any domain, but not for the argument to be returned.
User avatar
Phil Last
 
Posts: 628
Joined: Thu Jun 18, 2009 6:29 pm
Location: Wessex

Next

Return to Language

Who is online

Users browsing this forum: No registered users and 1 guest