An idea to simplify the software layers involved between command line and display.
Found on the 9fans mailing list https://9fans.topicbox.com/groups/9fans/T4f1a2098b1e1c854-M474a043f6f18ee4e660a427b/next-generation-acme
See https://github.com/letoram/arcan/wiki for a wiki about Arcan. https://www.divergent-desktop.org/blog/2020/08/10/principles-overview/ seems to be a good start.

Found on the Spritely institute forum https://community.spritely.institute/t/step-one-identity/615/3

Documentation for the S7 scheme interpreter, which can be found on https://ccrma.stanford.edu/software/snd/snd/s7.html

Shell scripts from Rob Pike to show operator precedence in C and Go.

"Both engineers and computational scientists alike will benefit greatly from having a standard test set for Initial Value Problems (IVPs) which includes documentation of the test problems, experimental results from a number of proven solvers, and Fortran subroutines providing a common interface to the defining problem functions. Engineers will be able to see at a glance which methods will be most effective for their class of problems. Researchers will be able to compare their new methods with the results of existing ones without incurring additional programming workload; they will have a reference with which their colleagues are familiar. This test set tries to fulfill these demands and tries to set a standard for IVP solver testing."
Found on John Butcher's page https://www.jcbutcher.com/rkclub

Tools to inspect certificates, test APIs of A-Trust, the provider of signature services such as "Handysignatur" and "ID Austria".

Run the 9front variant of the plan9 operating system in the browser. Mentioned on the 9fans mailing list
https://marc.info/?l=9fans&m=173906659913041&w=2

The CM software implements the construction of ring class fields of imaginary quadratic number fields and of elliptic curves with complex multiplication via floating point approximations. Additionally it provides an implementation of the fastECPP algorithm for proving primality of integers. It consists of libraries that can be called from within a C program and of executable command line applications. For the implemented algorithms, see A. Enge, The complexity of class polynomial computation via floating point approximations, Mathematics of Computation 78 (266), 2009, pp. 1089–1107.
Found via https://matheplanet.at/matheplanet/nuke/html/viewtopic.php?topic=266257&post_id=1939590

See also https://www.multiprecision.org/paridroid/index.html for PariDroid, a port of PARI/GP to Android

Found on a discussion of version control systems on the TUHS mailing list https://www.tuhs.org/pipermail/tuhs/2024-December/031229.html
See also https://neugierig.org/software/blog/2024/12/jujutsu.html for an attempt on an explanation "high-level enough to read and think about, without providing so much detail that it washes over you."
https://ahal.ca/blog/2024/jujutsu-mercurial-haven/ is an article from a Mercurial users.

The statement "I've found that Aberth performs worse [than Weierstrass-Durand-Kerner] on most examples as its faster convergence is offset by the slower evaluation." is interesting.
Fredrik Johansson is the author of https://mpmath.org/, https://arblib.org/ and https://flintlib.org/ arbitrary-precision libraries and of the Mathematical Functions Grimoire https://fungrim.org/