Latest release of Iosevka has full BQN support! Preview here, least confusing download here.

The ordinary monospace version renders some characters like arrows much too large, so the Term width is best.

cool

@Marshall A bit odd that in your table, the first row has font names above the sample, while in the centre and bottom rows, the name is below.

@Marshall does it work with APL as well?

praise B5invis

doublestrucks look weird in iosevka's condensed family

@Adám I meant to ask if there was a way to override whatever was in that line already, not to add to the current line.

@RGS Doesn't my code do that?

@Adám damn!

if i only knew about it before

this code looks really clean

why isn't monadic dot product supported by the interpreter?

CMC: is input a prime tower: codegolf.stackexchange.com/a/210173

for this cmc, however, you can choose which one to be truthy

@user41805 went funner than i thought

@KamilaSzewczyk Not enough call for it, I presume.

three keystroke matrix determinant is awesome

@M4X_ Welcome. You've found the right place to hang out, then. I think J lacks in suggestivity as it doesn't have APL's glyphs. E.g. flip-upside-down and transpose and mirror ar ⊖ and ⍉ and ⌽ in APL, while they are |. and |: and |."1 in J.

@user41805 you can also output with error code

@M4X_ Similarly, APL uses traditional mathematical symbols for ≤ ≠ ≥ where J uses <. ~: >. and × ÷ where J uses * %. Maybe the worst break with suggestivity is J's (ab)using [ ] { } as individual built-ins, not as grouping devices.

{ and } are not even of the same syntactic class in J.

@M4X_ ASCII is very limited. J was planned as a rationalised APL, and the implementers went with ASCII, despite its severe limitations, due to the technological hurdles traditionally involved in enabling APL's glyphs. This was in '90. Ironically, Unicode, which finally provided a solution to APL's encoding problems, was launched in 1991.

@M4X_ But yes, syntactically, J and APL are very alike, so the ability to form ad-hoc DSLs is the same.

@Adám This clarified my doubts. thanks

i never understood what this talk of dsls is about. if anything, apljk actively prevent you from making ad-hoc dsls - they don't allow the user to extend the meaning of the squiggles/digraphs or define new ones.

@Adám It does, don't mind me -.-

@ngn i wouldn't say so

i made a thing which does exactly that yesterday, in 6 lines of APL

@KamilaSzewczyk does what?

extends the meaning of functions / allows you to define new glyphs with a functionality

or to remove glyphs

@KamilaSzewczyk in your own impl of apl?

Dyalog

@KamilaSzewczyk something to do with the getter/setter overriding thing that morten showed recently? are you going to show it?

 dx←{
     ns←⎕NS ⍬
     ns._Neg←{0=⍵}
     h←{k v←↓⍉2(⊢⍴⍨÷⍨∘≢,⊣)⍺ ⋄ {⍵∊k:⊃v[k⍳⍵] ⋄ ⍵}¨⍵}
     t←'~' '_Neg'
     g←⍺⍺ ⋄ c←↓⎕CR'g'
     s←{{⍵/⍨2∨/0,' '≠⍵}⍵/⍨~+\⍵='⍝'}¨c
     b←↑,/'⋄',⍨¨{⍵/⍨0≠{≢⍵}¨⍵}s
     f←{'}',⍨⍵/⍨1=+\1 ¯1 0['{}'⍳⍵]}b
     e←ns⍎(∊' '(1↓∘,,⍤0){t h ⍵}¨60⌶f)
     0=⎕NC'⍺':e ⍵ ⋄ ⍺ e ⍵
 }

      ({~⍵} dx) 2 3 1 3 0
0 0 0 0 1

doesn't work with tradfns, but tradfns suck either way.

can be easily modified to support trains and execute

@Adám is that^ what you mean by "dsl"?

@KamilaSzewczyk this is an operator that replaces occurences of ~ in the source code.of its operand. i wouldn't say it redefines or extends the ~ primitive.

it quacks like a duck..

@KamilaSzewczyk quacks only if you put dx after it

yes?

i can't see how is this invalidating my solution

@ngn yes, we need a homoiconic apl

@KamilaSzewczyk ok, let's assume this is a valid dsl. but you can parse the syntax of any programming language in any other (turing-complete) programming language or just do string replacement like you did, so what's apl's advantage with respect to dsls?

@user41805 we have k

i should learn k

@ngn No.

@Adám what's your definition and how is aplj better at it than other languages?

@ngn in APL this was just a few lines

and in JavaScript, you need to first pull a library which parses JS

and then do replacements on the AST

also, my APL repl segfaulted randomly again

but i forgot how to enable aplcore dumping so i guess i don't have much left at that point

@KamilaSzewczyk do you? js has .replace() too, even if js is a less concise language than apl

@ngn well, yes, but that won't work

because you need to parse an expression, like a + b

and then swap it out to myAdd(a, b)

do you see the problem now

@KamilaSzewczyk the problem is that you have to parse?

the problem is that JS makes it much harder.

@ngn Allowing defining arrays, functions, and operators such that one can write somewhat natural-looking sentences without noisy syntax. E.g.

        except ← ~
           for ← ⊢
            in ← ⊢
multiplication ← ×
         table ← {⍵∘.⍺⍺ ⍵}
         those ← ⊢
         until ← ⊣,↓∘⍳
      (2 until 20) except those in multiplication table for 2 until 20
2 3 5 7 11 13 17 19

@Adám that's obviously exaggerated and will never work in practice though

@dzaima Dumbed down example to show what I mean.

@KamilaSzewczyk if a language is well-suited for dsls it wouldn't force you to write parsers in the first place. js (since we've already picked it as an example) allows you to extend the prototypes even of built-in objects. (though it doesn't let you redifine ~ of course)

@ngn yes, that's why I personally consider Lisp a good language for DSLs, but I think APL will do too.

@ngn but APL with find&replace allows you to trivially define every kind of callable object. in k you can't define custom verbs or adverbs, just as you can't define ~ in JS

@KamilaSzewczyk looks like you need 1≤ in place of 1= in f←for {~{⍵}⍵}

@KamilaSzewczyk yes, lisp is a perfect example. apl isn't even homoiconic.

thinking of a homoiconic APL dialect feels weird

@user41805 possibly

@dzaima yes, valid point (i don't think k should be advertised as a dsl-building language)

I wouldn't say that APL is good for DSLs, but it's better than many other languages

@Adám is there any difference between "dsl" and "library" then?

I don't know. I think of a library more as a packaged collection that serves to enable a certain type of functionality to the APL programmer, while a DSL would be for the end user, who might not even know anything about APL or programming.

@Adám you definitely still have to know how APL is evaluated regardless of what DSL is in front of you (assuming you don't have a custom parser, in which case APL isn't any better than any other language)

True, but you might not know of it as "APL", just as the DSL your specific system uses.

that might make it "domain-specific", but what you showed still obeys the syntax and semantics of apl. i would say it is not a separate language.

css is an example of a dsl. it has its own syntax. it serves a specific purpose.

well

there's SystemC

which is considered a DSL and built using macros/templates

yeah, languages with macro systems (like c, even though its preprocessor is dumb) and/or good metaprogramming capabilities are better building material for dsls

i wouldn't say the C preprocessor is dumb

yes, it's horrible, and it should be erased from the surface of earth, but you can do cool stuff with it

@ngn isn't the C preprocessor magic the same thing i did with dx before?

@KamilaSzewczyk "dumb" is my technical term for not supporting recursion and hygienic macros

@KamilaSzewczyk if you use the preprocessor, you don't have to do the parsing yourself

@ngn then how do you extend the domain of + :)?

@KamilaSzewczyk in c you can't. in c++ something like operator +(..)

well, that i know

but we were talking of preprocessor, right?

@KamilaSzewczyk it's too dumb for that :)

yes

github.com/mcinglis/macrofun

@ngn not supporting recursion is ambiguous

due to:

> if any nested replacements encounter the name of the macro being replaced, it is not replaced

@KamilaSzewczyk if i understand correctly, that relies on bugs non-standard behaviour?

"please don't use it" :)

@ngn ah it has quote, when you guys say k is a lispy apl i used to think it referred to both being prefix-y, i didn't realise this

@user41805 when you say "quote", do you mean ' or ` or (quote ..)?

' is "each" (like ¨ in apl). `sym is a symbol (a scalar string, like atoms in lisp). i don't think there's an equivalent to lisp's (quote ..).

i kind of mean all of them, so ' or (quote ...) in lisp having ` as its equivalent in k

@user41805 yeah, if you're quoting only a lisp atom

by k not having (quote ...), do you mean you can't do `{function} in k? (yeah i noticed it not behaving as expected in your k)

i mean there's no k equivalent to lisp's quote in general

in k the ` is part of the symbol token, so `sym is perceived as a unit

so more like lisp ' then?

yeah

`{function} would mean you're applying ` (the empty symbol) to a function object, which happens to mean "serialize" (at least in k9)

ah i see, so there's no way to 'dissect' a function as in lisp? (been a while, but i recall being able to perform list functions on a quoted function (forget the term))

@user41805 "dissect" as in "get the ast"?

yes, and manipulate it, like in lisp (looks like i remembered correctly tio.run/…)

@user41805 this varies between k versions - it could be .{func} or !{func}. it returns a list of a few things; among them should be the original src code, the ast, and the bytecode.

@user41805 functions are first-class, so you don't have to do anything special to put them in lists and apply to them the usual primitives

what are the two hex numbers? and what's (::)

@rak1507 it's (src;bytecode;srcmap;localsyms;constants)

cool

ah yeah bc my function was so small the bytecode was 8 bytes, so I thought it was a pointer to something

@rak1507 :: is the identity function (verb number 0). i put it there only as a placeholder to prevent the list from squeezing (e.g. if you put only ints in it, it would shrink, and i would no longer be able to assume it's a list of pointers)

Ah ok

@ngn oops, i lied there. there's no ast at that stage.

but you can still build it with `p@srcstring ("parse")

@ngn i meant like the lisp example in the tio link, so like (cdr '(lambda(x)(+ x x)))

@ngn didn't know about them, but doesn't seem ! and . give a structure that i can manipulate like the above

@user41805 well, there's no such thing as quoted function in k. it's just.. a function.

@user41805 which k do you use?

your webasm one

right, so to build an ast, use `p@"source code". currently that returns some more junk, but it should be obvious where the ast is.

i misspoke earlier when i said the ast should be in .{func}

at the stage when . is called, the compiler has already produced bytecode and thrown away the ast

but as the src code is preserved, you can get it with ${func}, drop the leading { and trailing }, and parse it again with `p@

like so

@ngn thanks, that's better

k evangelists should lead with homoiconicity (at least to aplers), i didn't know what i was missing

k is a non-proselytizing monotheistic religion :)

not too sure about non-proselytizing but if you say so

how do I enable boxing by default I can't find it in configuration

@rak1507 RIDE or windows IDE? OS?

windows IDE (and on windows)

then i don't know. Generally you want to turn it on, and then save the session to the default .dse; @Adám

@rak1507 not windows, but may be of help chat.stackexchange.com/transcript/52405?m=37138608#37138608

also

sure I didn't do that before but I will do that

thanks

@Adám any reason {2⎕NQ⎕SE'FileWrite'⊣⎕SE⎕WS'File'⍵}'/opt/mdyalog/18.0/64/unicode/default.dse' just annoyingly quitely fails, instead of saying something about not being able to write the file in that directory?

what's the simplest way to make a dfn where it does two completely different things depending on arity?

something like {⍺←value ⋄ ⍺≡value:... ⋄ ...} feels like a hack (and fails if you actually pass value dyadically)

@rak1507 {0=⎕NC'⍺':'monadic'⋄'dyadic'}

thanks

{0::'monadic'⋄'dyadic'⊣⍺} :D

lol

when does ⎕NC return a vector with more than 1 element?

@rak1507 when given an argument of vectors of strings (e.g. ⎕nc,¨'⍺⍺')

ah

though imo it should return a scalar when given a simple vector. ¯\_(ツ)_/¯

yeah

oh, also a←4 ⋄ ⎕nc⍪'ab'

yeah

spotted that

<10b anyone? chat.stackexchange.com/transcript/message/57195086#57195086

wait the term is prime power, not tower, i always get that mixed up

extended: 1≡≢∪⍭⎕

0=1|⊢⍟⍨2⊃∘⍸0=⍳|⊢

@rak1507 domain error

⎕IO←1

yes

uh

what input?

2,3,4.. (separately)

works for me

what part domain errors?

try 1⍟2

that doesn't happen though

ah! lol

i missed the edit

oh right yeah I changed it because it worked better with ⎕IO←1

not a sin in golfing. ends justify means :)

can't think of a way to get under 10 bytes

1≡∘≢∘∪2÷/∘∪⍳∨⊢

@rak1507 does it have to be a train?

no

1≡≢∪2÷/∪∨∘⍳⍨⎕

that as a full program + dfn were both 14 bytes too

oh clever

still not under 10...

@rak1507 you can choose to use erroring as submission result

no idea how that helps

@rak1507 12: 1≠∨/1↓∪∨∘⍳⍨⎕

that's nice

@Razetime codegolf.stackexchange.com/a/218684/95516 50 rep please

@user41805 are we allowed to choose values for true and false? can one of them be fixed and the other arbitrary?

in other words, can i remove the 1≠ :)

@ngn sure, go ahead

∨/∨∘⍳⍨~≢ returns 1 for not prime power, and another integer otherwise

can you get lower?

this is some hardcore golfing right here!

@dzaima It is shy.

@Adám ..why

i'd expect an error, no less, but a shy 1?

@dzaima Most ⎕NQs are for their side effect, so the function was made shy (not that I like shyness).

@dzaima 0 for success, 1 for failure. POSIX ftw.

@ngn were you able to find the 7-byter?

@user41805 i tried but no

Hi all, this may be a silly question, but does anyone know where the full list of experimental features are for Dyalog 18? I thought the multiline one in Conor Hoekstra's latest video was nifty :)

@LukasHermann Depends what you consider experimental.

@LukasHermann Maybe look at the release notes?

@Adám Thanks!!