1 min read apl

APL Hacking: Project Euler Daily (#1)

This is the first of a series of posts as I go through Project Euler in APL to stretch my knowledge of APL. I hope to post one problem a day to this blog.

Problem #1:

∇R←PEONE;X;⎕IO
 ⎕IO←1

⍝ Find the sum of all the multiples of 3 or 5 below 1000.

X←⍳999

R←+/((0=3∣X)∨0=5∣X)/X

∇

You might also like...

Jul
16
Source Code Readability, Elegance, and Complexity

Source Code Readability, Elegance, and Complexity

I was recently discussing my thoughts on this article: https://mathspp.com/blog/pydonts/does-elegance-matter And I thought I would
7 min read
Dec
20
Co-dfns support for very large arrays!

Co-dfns support for very large arrays!

Previously, Co-dfns could only support ranks <= 4. Now, the architecture supports arbitrarily large array sizes, though this is only
1 min read
Dec
15
Ken Iverson Centenary celebration, 17 Dec 2020, 19:00 EST

Ken Iverson Centenary celebration, 17 Dec 2020, 19:00 EST

https://www.eventbrite.co.uk/e/ken-iverson-centenary-tickets-132578131761 Stephen Taylor of the Iverson College is putting together a celebration of the
1 min read
Jul
22
Dyalog Tooling Resources List (LambdaConf Talk 2020)

Dyalog Tooling Resources List (LambdaConf Talk 2020)

Here is a list of tooling resources that I mentioned in my recent LambdaConf 2020 talk, with links to documentation
1 min read
Apr
23
Is APL Dead?

Is APL Dead?

Is APL dead? Not anymore. Changes in modern hardware, business needs, development methods, and our understanding of programming makes APL in its modern state perhaps more relevant and viable than ever before.
8 min read