oecumena

4 ms·

1.
A (necessarily) brief history of the remainder of mathematics(cofault.com)
1 points by oecumena 14d ago|0 comments
2.
by oecumena 9mo ago
'The Lobster Programming Language (strlen.com)' is duplicated.
3.
C++: Zero-cost static initialization(cofault.com)
84 points by oecumena 1y ago|58 comments
4.
by oecumena 1y ago
Analytical series for data types.
5.
Formal verification of the long division algorithm(cofault.com)
2 points by oecumena 2y ago|1 comments
6.
by oecumena 2y ago
Manual derivation of Hoare-triples for the long division algorithm verification.
7.
by oecumena 2y ago
Still won't work. The Standard explicitly specifies that FILE type includes all stream attributes, including position indicator: ISO/IEC 9899:TC3 7.19.1 FILE which is an object type capable of recording all the info
8.
by oecumena 2y ago
Sizes of stdio FILE streams are still limited, because of ftell: the standard requires that file position (as measured from the beginning of the file) is representable as long or off_t. You can advance an argument that even though each stre
9.
by oecumena 2y ago
For any C program there is a number N, that depends on the program, compiler, architecture, etc., but does not depend on the program input, such that the program won't be able to access more than N bits of state at any moment in any of
10.
by oecumena 2y ago
C is definitely not Turing complete. The standard library provides no escape, because file sizes are also limited (due to ftell (3)), and there is no chdir in the C standard library, so the total number of files is also limited. I have
11.
by oecumena 2y ago
I did another one back in 2001: https://ldoor.sourceforge.net/ .
12.
Don't lose your file (descriptors): escrow library(github.com)
1 points by oecumena 2y ago|1 comments
13.
by oecumena 2y ago
File descriptor escrow library: provides an interface to send process file descriptors to a separate process ("escrow daemon", "escrowd"). The descriptors can be retrieved later by the sender or another process.
14.
by oecumena 3y ago
So that's where I put them!
15.
by oecumena 4y ago
What is really funny is that eventually our understanding circled back and now the rest mass of particles is attributed to their interaction with the Higgs field, by effectively the same basic mechanism that Poincare-Lorentz-Abraham invente
16.
by oecumena 4y ago
Newton explicitly checks in Principia that the orbital parameters of the moons of Jupiter are consistent with the "empty space" hypothesis.
17.
by oecumena 4y ago
I agree that the direct hand-off that Solaris shuttles provide is more efficient than general wakeup, but it is less efficient than switching MM context of the client thread. The latter results in twice fewer threads, twice fewer scheduler
18.
by oecumena 4y ago
Original Solaris doors use server thread pools: https://github.com/illumos/illumos-gate/blob/master/usr/src/...
19.
by oecumena 4y ago
I made a similar doors api implementation for Linux in 2001 ( https://ldoor.sourceforge.net/ ). It eliminated the cost of having a thread pool and context switches by re-using client thread and replacing its MM context with t
20.
by oecumena 4y ago
A simple experimental implementation of coroutines alternative to well-known "stackless" and "stackful" methods.
21.
3-Lisp: an infinite tower of meta-circular interpreters(cofault.com)
4 points by oecumena 4y ago|1 comments
22.
by oecumena 4y ago
A 3-lisp program is executed by an interpreter written in 3-lisp that is itself executed by an interpreter written in 3-lisp and so on ad infinitum.
23.
by oecumena 4y ago
If there are no pointers from "old" to "new" objects, then there are no cycles and (compiler-assisted) reference counting will handle it.
24.
by oecumena 4y ago
Variable size objects are addressed at the very end of the post: "Support for variable-sized objects requires a separate cyclic list for each size...".
25.
by oecumena 4y ago
That's true, the worst case is bad. But if mutator locality of reference is reasonable, the scanner will preserve it. After all, Baker rejected his earlier copying design for a reason.
26.
by oecumena 4y ago
I guess it is not more widely used, because more complex generational collectors are often more efficient.
27.
by oecumena 4y ago
The Scheme-79 chip ( https://dspace.mit.edu/handle/1721.1/6334 ) was doing GC in microcode. According to Steel & Sussman it typically spent 80% of time collecting. :-) RMS invented "phantom stacks" to
28.
by oecumena 4y ago
Double-linked list (Baker calls it "Knuth's double-linked list") allows O(1) insertions and deletions (hence moving) without actually moving objects and without additional indirection. Each object has a header that contains p
29.
by oecumena 4y ago
Treadmill is a "real-time" in-place garbage collection algorithm designed by H. Baker. It is simple, elegant, efficient and surprisingly little known.
30.
Treadmill garbage collector by H. Baker(cofault.com)
163 points by oecumena 4y ago|59 comments

More ›