Isognoviastoma

> curried functions often don't compose nicely

Same for imperative languages with "parameter list" style. In python, with

def f(a, b): return c, d

def g(k, l): return m, n

you can't do

f(g(1,2))

but have to use

f(*g(1,2))

what is analogical to uncurry, but operate on value rather than function.

TBH I can't name a language where such f(g(1,2)) would work.

Current social consensus is that copyright exists and one can only use software on conditions stated in license. Thus, proprietary and copyleft have same protection.

Another possible consensus would be that copyright don't exist, and anyone can copy proprietary or copyleft work and improve it. Nobody would be harmed in such situation, original author still have its copy. I would have no problem with such state - but it must be same for everyone, not just FOSS.

Copyleft is copyright held in smart way. Nobody can take code under GPL and make its _copy_ proprietary because it would be violation of copyright.

In the other thread you argued that AI output is not copyrighted.

Do you think I can take proprietary code and lauder through AI to get a non-copyrighted copy of it, then modify to my needs? How can I obtain the proprietary code legally in the first place?

Most of FOSS is not a free gift, but asks for some form of repay.

MIT asks for credit. GPL asks or credit and GPL'ing of things built atop. Unlicense is a free gift, but it is a minority.

AI reproduces code while removing credit and copyleft from it and this is the problem.

Easy to check: try to speak with someone talking foreign language you don't know and estimate what percentage of what they said you understood from tone of voice etc. I would guess it's less than 80%.

It's impressing that browser can display many levels of recursive iframe.

√2 with floating point is obviously closest representable number. With fixed point it is obviously closest representable number as well. With rationals, you need to arbitrarily limit precision, and the point of using rational was to use exact values.

- after few operations denominator exceeds 64-bit range, so you either need bigint, or make fractions approximate, what is in affect fixed point

- often you use decimal fraction on output and input anyway

- it's slower, even slower with bigint

- no square root, sin, and so on with rationals

Thanks for sharing! A bit of css, and it's possible to read mastodon posts with a web browser!

    head {display:block; background:Canvas; color:CanvasText;}
    meta[content] {display:block; padding-bottom:1em;}
    meta[content]::after{content:attr(content); display:block;}

Was nvidia driver foss or proprietary?

With proprietary software, how many times a producer did fix breakage or add missing feature for you because you bought a licence (subscription)? How fast was it?

Keycap displays could be used to shuffle letters, thus prevent touch typing and force neck moves.

Chronosort is closer to radix sort, as both are O(n) if values are bounded. Queue-sort (aka heapsort) is O(n log n).

There are two commands that do work in shebang: /bin/sh and /usr/bin/env. Everything else will break sooner or later: BSDs, Nix, Linux distros with separate /bin and /usr/bin and so on.