bear8642

Although frustratingly loosing support with the new open xlc compiler!

Yep, or even apply inline as {+⌿⍤2(∘.≤)⍤1⍨⍵}cardMatrix

Sure - idea is you've got a 6×30 matrix of the 6 card attributes for each of the 30 cards, and want to know for each attribute how many other cards they'd beat.

  {+⌿⍤2(∘.≤)⍤1⍨⍵}

  {            ⍵} ⍝ single argument (monadic) function with argument ⍵
  {           ⍨⍵} ⍝ "selfie" - ⍵ f ⍵ where f is (∘.≤)⍤1
  {         ⍤1⍨⍵} ⍝ on each row (1 dimensional element)
  {    (∘. )⍤1⍨⍵} ⍝ cartesian (outer) product of each row with itself
  {    (∘.≤)⍤1⍨⍵} ⍝ ≤ comparison of those elements - produces 6 30×30 boolean matrices
  {  ⍤2(∘.≤)⍤1⍨⍵} ⍝ on each of those matricies (2 dimensional element)
  {+⌿⍤2(∘.≤)⍤1⍨⍵} ⍝ sum the columns

leading to: {+⌿⍤2(∘.≤)⍤1⍨⍵} ⍝ compare each row (⍤1) to itself (⍨) and count (+⌿) how many cards that beats

That make sense?

> "learn an array language, they're easy to write on paper" everyone would think they were insane... but there is something to it, in certain cases.

Indeed, and sometimes not needing a computer to quickly splash out an idea you're thinking/talking about is extremely useful!

Over Christmas, I showed my brother {+⌿⍤2(∘.≤)⍤1⍨⍵} as a small expression to explore attribute to pick playing Top-Trumps admist a discussion. Not something you'd be able to do in many other languages!

>programmers that keep banks like this running are an enormously underestimated "bus factor" for many of the world's economies, and what kind of back-up plans they have for such a scenario.

Hmm, makes me wonder about potential similar situation with APL programmers - a language I know quite a few large companies use.

>maybe pascal syntax was also parsing friendly..

Yep, designed to be single pass, recursive descent friendly

> tenK←'^........k.$' ⎕S '&' ⊢ words ⍝ regex filter

Is tenK←{(10=≢⍵)∧⍵[9]='k'}¨words better?

Feel that better matches the problem spec, although requires the each

> words wordlist | filter -:(len == 10 and .8 == "k")

This feels very similar to an APL or K solution.

Are those languages you're aware of?

Just because something's old doesn't mean it's not relevant, yes might not've been the best language to suggest - the more modern BQN, Uiua and Singeli exist too - but it's still a fairly niche paradigm. Ideas tend to come in cycles too - look at the 1980s ideas of the transputer or connection machine.

I wanted to point towards a programming paradigm that's approach enables you to take advantage of the parallel execution possible within chips today due to the notation being both precise in intent yet vague in execution. Take summing an array (`+/vector`) or selecting values given a boolean mask (`mask/values`) - both these very simple expressions are expressible directly in SIMD instructions, as there's no for loop index enforcing an order.

> So there must be others out there

Indeed, quite frightening at times seeing the value of firms using Dyalog APL.

Array languages, such as APL and others, tend to be easily parallisable given primitives tend to focus on intent and how to transform data rather than imperative operations.

Some of the SIMD operations feel very reminicent of APL primitives

oh, didn't realise you could do that - I've tended to use `... |awk '{print $NF, $0}'` to add line numbers to something

If screenshots are whole code we can type it out.

> * (the core) the lisp metacircular evaluator

Which leads to the funny footnote in section 4.1.1 when discussing implementing conditionals

6 [...] Contemplation of the meaning of true? here yields expansion of consciousness without the abuse of substance.

Yet to watch video, but does visual studio support macros in immediate or watch windows?

That so far has been my frustration when not remote debugging linux vm, where it becomes a gdb front-end

Could you expand?

I have a limited understanding of continuations and never used them myself.

They're different enough that you can't goto a case or default label.

Though think they might be accepted if using pre-ansi standard. Remember reading that in the changes list in my 2nd edition copy of k&r

> may I suggest cmForth[6] Hmm, not a forth I've come across before - enjoyed reading JonesForth though.

Are these meant to just be incomprehensible, or is there some translation possible?

Haven't heard the song for awhile.

>> Can live processes be moved into or out of a jail?

>No: jails are VM-like in functionality.

Could this be implemented though if moving between sufficiently similar operating systems?

Seems like might be useful to imprison a suspicious acting process or to release once seen to be safe.

> There's no notable advantage...

Potentially one if a large customer's paying you for it.

At work, I'm helping a client upgrade from a decade old version (v12) of our product and having to copy over the switches to keep the even older (v11 and previous) behaviours

Can't remember what the book version's called but found <folklore.org> good about the early macintosh development good fun!

> bunch of set of instantly recognizable "chunks"

Indeed! Much of APL programming is using idioms (≠⊆⊢ for example as split on delimiters)

https://aplcart.info has a good selection too

Which might then change the semantics of your grammar - remember this being pointed out in 3rd year compilers course

Feel APL similar in-crowd member too, though perhaps even more niche

Good, I'll explore them then. I'm a competent programmer, just new to various simd and other x86 optimizations.

Does anyone have good recommendation for beginner friendly optimisation material? Agner's website starts saying "Note that these manuals are not for beginners. "

Jones Forth[0] is a good literate programming implementation that explains the internals as he goes.

[0]https://github.com/nornagon/jonesforth/blob/master/jonesfort...