bear8642

7 ms·

61.
by bear8642 3y ago
Although frustratingly loosing support with the new open xlc compiler!
62.
by bear8642 3y ago
https://web.archive.org/web/20240121212049/https://adrianco....
63.
by bear8642 3y ago
Yep, or even apply inline as {+⌿⍤2(∘.≤)⍤1⍨⍵}cardMatrix
64.
by bear8642 3y ago
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) fu
65.
by bear8642 3y ago
> "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 ide
66.
by bear8642 3y ago
>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 poten
67.
by bear8642 3y ago
>maybe pascal syntax was also parsing friendly.. Yep, designed to be single pass, recursive descent friendly
68.
by bear8642 3y ago
> tenK←'^........k.$' ⎕S '&' ⊢ words ⍝ regex filter Is tenK←{(10=≢⍵)∧⍵[9]='k'}¨words better? Feel that better matches the problem spec, although requires the each
69.
by bear8642 3y ago
> 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?
70.
by bear8642 3y ago
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
71.
by bear8642 3y ago
> So there must be others out there Indeed, quite frightening at times seeing the value of firms using Dyalog APL.
72.
by bear8642 3y ago
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
73.
by bear8642 3y ago
oh, didn't realise you could do that - I've tended to use `... |awk '{print $NF, $0}'` to add line numbers to something
74.
by bear8642 3y ago
If screenshots are whole code we can type it out.
75.
by bear8642 3y ago
> * (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
76.
by bear8642 3y ago
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
77.
by bear8642 3y ago
Could you expand? I have a limited understanding of continuations and never used them myself.
78.
by bear8642 3y ago
They're different enough that you can't goto a case or default label.
79.
by bear8642 3y ago
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
80.
by bear8642 3y ago
> may I suggest cmForth[6] Hmm, not a forth I've come across before - enjoyed reading JonesForth though.
81.
by bear8642 3y ago
Are these meant to just be incomprehensible, or is there some translation possible? Haven't heard the song for awhile.
82.
by bear8642 3y ago
>> 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 susp
83.
by bear8642 3y ago
> 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 t
84.
by bear8642 4y ago
Can't remember what the book version's called but found <folklore.org> good about the early macintosh development good fun!
85.
by bear8642 4y ago
> 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
86.
by bear8642 4y ago
Which might then change the semantics of your grammar - remember this being pointed out in 3rd year compilers course
87.
by bear8642 4y ago
Feel APL similar in-crowd member too, though perhaps even more niche
88.
by bear8642 4y ago
Good, I'll explore them then. I'm a competent programmer, just new to various simd and other x86 optimizations.
89.
by bear8642 4y ago
Does anyone have good recommendation for beginner friendly optimisation material? Agner's website starts saying "Note that these manuals are not for beginners. "
90.
by bear8642 4y ago
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...

More ›