i'm glad i found this

What is the name of the program or compiler you use to use alp?

Where can I find info?

facinating, much very cool.

Good to see that APL is being taught at the university. I try to use it in my courses (as a teacher), but these attemps are not always successful :)

For all the info on the APL Forge (and to enter the 2025 round!): forge.dyalog.com/

For all the info on the APL Forge (and to enter the 2025 round!): forge.dyalog.com/

Excellent beginner guide. I'm definitely going to be checking out more APL

12:00 sex party

Maybe an example of a simple web server implantation in APL would help... to drbunk the bs.

On 'functions' vs 'algorithms' I'd say: 'function' denotes the abstract concept that a value follows from other values and 'algorithm' is a description of how to get the dependent value given the values it depends on. The description could be expressed in natural language or in some (pseudo) programming language. As a consequence, the complexity of the description (algorithm) depends on the expressivity of the language used to describe.

Does anyone able to share the titles of some of Roger Hui's papers that Stefan refers to about half way through the talk?

Thank you a lot for these explanations!

Although my first and primary spoken language is US English, the bias to English words in most programming languages bothers me so much that I decided for the PL I am designing that it will have no reserved keywords at all, of any spoken language; only symbols.

amazing

I really 😢 missed the APL seeds meeting

Hello Code report, from your KZbin videos like solving Leet code problems with different programming languages, i found that APL language, it was very new to me. currently, I'm started to APL programming languages.

Nice!

Thanks for putting on a great event! I had a blast.

This is the second time I've watched this talk! :-) So I write an absolute ton of JavaScript, and JS provides an in-built reduce on lists. You can do some pretty APL-like things in JS. APL (talks like this one and others) are what got me interested in learning about reduce. Diving into APL is on my list of things to accomplish. Here is an example of one solution to the all_equal function in JS, using just native JS. [1,1,1,1,1].reduce((a,v,i,arr)=>a && arr[0] === v, true) Definitely not as pretty as APL.... lol. I really want to learn it, but there just isn't but one of me. We'll get to it eventually. Thanks for sharing your video. It was bad-to-the-bone.

this is seriously awesome, hope you guys can make some tutorial videos for this package

in raku you can use the [==] or [eq] operators == for numeric eq for strings which is the equivalent of reduce &infix:<==> or reduce &infix:<eq> you can create a list in variable or apply it to a list directly reduce &infix:<==> , 1,3,3,4 > False reduce &infix:<==> , (1,3,3,4) > False my @list = (1,3,3,4) ; reduce &infix:<==> , @list > False

The FinnAPL was completely new thing to me as a finn, thanks for that. These cult like encapsulated knowledge vaults just don't come up unless someone from the "inside" hints at it. Looked up the pdf and it's interesting how old-timey the linguistic expressions are, it has some benefit from mathematics being so old that it has established vocabulary, but particularly computer science has always had difficulties where you think everything sounds odd in finnish and has a wrong translation when you learn the english original words. Like until very recently it was still common to refer to a function as "subprogram" in finnish which is not wrong but feels weird. And the object-oriented programming is a word that nobody understands when they are taught it in finnish, it is like "creature based programming" and nobody even learns classes until way into it so they have no concept (the finnish words for the creature based programming term are just somewhat uncommon in common spoken language, and their combination doesn't even connect with the meaning of the words because of the pronunciation). That being said, the pdf was really well written, I wish all programming languages had that kind of introductory booklet where you're introduced to the style, "vocabulary" of the language and just very practical examples. It's funny how they use some well known tongue twisters as example inputs.

I always learn something from Martin's presentations. Watching this a 2nd time I will probably learn something.

Brilliant talk Love to see the direction codfns is taking APL in

This is an excellent talk to get a glimpse into how the interpreter is responsible for the memory footprint in Dyalog APL, and the general responsibilities it has.

well, let's say I'm not very sober, and had this crazy idea that there's a possibility people make web servers in APL, and yes it's awesome

I think it's a good idea to post for every video a link to your website. Also in your youtube channel's "About" section. Most people like to just click a link instead of googling your website.

What exactly is a namespace in APL? And what do variables and values in namespaces? Is it like classes or structs, or more like namespaces or packages or modules in other languages like C++ or Java?

This gets my vote immediately :)

I understand this would require a new "paradigm" (for lack of a better word) in Dyalog APL, but it would be nice to be able to get in the APL process the data output-ed to stdout (for instance) of a long running process. In other words: I spawn from Dyalog APL an external process that logs stuff into stdout, and the APL side can get the stuff that is being put into stdout not at the end in one huge array once the external process terminates, but as it is generated "in real time" (as it is flushed, really). This would make possible "monitoring" external "server" processes of the verbose kind which log what they are doing to stdout (and stderr). The data should appear as readable streams on the APL side. "Readable how" not immediately clear. And also, how would the waiting on the external not block the interpreter not clear (probably a thread switch point?). Anyway: this would be useful and certainly consistent with the "Unix" way of doing things.

'Would do APL for free.' Check

This was an old presentation but I was wondering is there an APL IDE on ios/android at the moment?

40:55 paradigm conference, ppl looking languages of various paradigms wow

30:02 under or dual operator "preprocess then postprocess with inverse"

18:37 yeah, i faced this problem while trying to pair 1,2 with two vectors A, B to be able to then apply rotate over each obtained pair to compute cross product

15:17 takes a bitter mouth to bite into depth edit: bigger*

11:16 11:24 Grades: some cutoffs & bounds & interval index ohwww, so Grades refers specifically to that. i thought grades & percentages were same-ish thing. It kinda is, when applied only once at the very end to the grand total... but applied 2 times (one to each subject's totals, and second to spbjects total so obtained) it definitely obscures things.

5:13 TIL term: "balanced parens"

Even as an hobbyist learner of APL, I appreciate your presentation. I do not have a well founded opinion on the subject, but your presentation also shed light on the current facilities and how they relate together. Thanks.

great job rodrigo!

The ability to do desk debugging, aka here "blackboard" workouts, is key. The mind is trained in thinking (easily because of the sparse notation and generality) about the attack on a problem. Today, since Computer Science's dumbing down in stylistic fads and decortative tack-ons like exception handling, type constraints, silly things like avoiding go-to's -- too many to mention all intensly stupefying, mind use wise -- all coding is spagettti against the wall, twiddling nonsense. Fortunately Iverson PREDATED Computer Science as it became circa 1980, to pick a year thereabout. Formal proofs are not the nugget, albeit it was a driver for Iverson's work, rather the scope of a notepad sheet is it. Proof of how the thing works in a few lines, BUT in the MIND! Perl and regexs, C to an extent do some of this, but not anywhere near as well as APL. And it WAS NOT an array handling only development: A Programming Language included powerful Tree operators, imo at that time, back in 1972 or so. It is a language to precisely and succintly describe any programming that might be done, vz the IBM 360 work, and do so elegantly in HUMAN terms. Modern code bases are such utter JUNK. Hooray for APL! What a joy to still have it, may it be reborn.

I learned APL in 1972 from Ken Iverson's book, in a class way over my head one would think, in "Non-numberical Methods in Computer Progamming". It was the first computer language I learned. There was then NO computer science department. Richard Orgass was the professor, an IBM Fellow. We spent the first semester and a month or so writing programs in long-hand on paper. All "desk debugged". Fortunately we could use TREES, which no implementation yet I think has proferred. My mind wrapped around the language, it was like thought itself. Towards the end of the year an IBM version we could use on the Selectric typewriter terminals came out, with the extraordinary typeball. Although I was the faster coder in the class, I nigh failed it because I wrote to zero origin in code, and given my many jobs then, I didn't have much clock time or lab time (the terminals were on a schedule) to dawn it out. Just before the transcript grades got locked in, a month into the summer, something popped in my mind, and I understood the drag force grounding my term assignment. I was able to quickly rewrite it, fat fingered it in at a terminal in Princeton, not many lines at all, and drove it , the Selecttic typeball printed on computer paper, at high rpm to New Brunswick and handed it to the good Professor. From failure to A in sixty seconds. The next year I was forced into Fortran for a Numerical Methods, so despiriting. dozens, hundreds of lines of painful coding to do the same thing as 3 lines of APL. Watfor. The language name said it all. Really. Waterloo Fortran 4. I did the more interesting assignments in APL for the joy of it, but had to drag them into Fortran to hand in. When in those next few years Computer Science got so big, big and arrogant, and I saw how it destroyed the joy of programming. Python today has some of it back, but the Dijkstras in so many powerful field fluxes won the day for this epoch with idiocies like C++ and Java (whereas C and early C++ are grand and mighty, modren C++ and C#) are all decorations enforced like Cobol's input and output sections, et all. Decorations obsfuscate code, beyond the sordids of spagetti go-to-ism. People who do NOT understand code well used goto's badly, I understand the lament about them. But the replacements are in fact worse, that being my own fact seen from observation of many millions of lines of modern code. Talk about optimizing the weighted graph -- the modern code of the big weak three C++, Java and C# (and Pascal prior) incredibly increase the nodes applications use by bad and middling, no-account minds coding, a node being here a process point, things needed to be done, not added by fancy decorations, They are weighted graphs but all so deoptimized by the predominate coding languages (holding off Python and Javascript, which do work in way like APL) that don't utitlize humanity's greatest tool: the mind well. So many nuisance nodes arising from chaos and ignorance, loss of focus on the goal that really needs be done. Sorry for the lenghy discourse. It is so frustrating, here fifty years later.

Thanks for uploading APL content especially this channel. APL will remain my favourite futuristic language.

Nice job, cuz!❤

Nice video, thank you (:

Looking for the podcast on which Conor previously gave a top 5 favorite languages list.. Anyone have an episode link?

Please do keep sharing about APL and vector programming... super fascinating! Here's a solution in Prolog: ```prolog all_equal([X|Xs]) :- maplist(==(X), Xs). ```

6 and a half years have passed since the video was published, has there been anymore progress on being able to translate APL to code that can run on GPUs or even normal computers?