From Newsgroup: comp.lang.c

Hi,

If only the fucking moron Chris M. Thomasson would
stop spamming his nonsense, he doesn't listen at
all. Problem, he cannot read, he knows nothing.

Its very common that compute shaders can block,
when they are used for General Purpose computation
on GPUs (GPGPU). If only he would pull out his

finger from his asshole, and stop thinking in his
WebGL legacy code stash nonsense. Even the
Cerebras Waver has blocking:

"Cerebras Software Language (CSL), send_color
and recv_color are parameters passed to tile
programs to manage data routing and virtual
channels (called colors) across processing
elements (PEs) on the wafer

Yes, both send and receive operations can block
on a Cerebras Processing Element (PE), primarily
due to the system's hardware-enforced backpressure
mechanism. Because the Cerebras Wafer-Scale Engine
(WSE) relies on a fine-grained,

dataflow-driven architecture, blocking prevents
data loss when hardware resources are
fully saturated."

Blocking and Unblocking https://sdk.cerebras.ai/computing-with-cerebras#blocking-and-unblocking

Chris M. Thomasson is an annoyance and an idiot.
He is a total waste of time. And represents those
people who cannot use their brain.

Bye

Chris M. Thomasson schrieb:

On 8/1/2026 5:47 PM, Mild Shock wrote:

Hi,

Chris M. Thomasson can ask 100 more questions.
I will happily answer them. But maybe I should
make a Wiki to explain the ever same things:

But, I still don't know what you main goal is?

The goal is "Prolog inferencing"

It has textures to work with in the pipeline.

I don't need textures for "Prolog inferencing"

98 more questions to go, don't give up!

[...]

Fwiw, I have several compute shaders that do what I want. Mainly

building vector fields, etc.... And yes I use textures for some input
and output, uniforms mainly for the settings, etc. Just, make sure to
code things up to a point where your compute shader never needs to wait
for something... Think of striving for wait-free algorithms.

For instance, this is 100% wait free.

void add_hit(ct_plane2d plane, vec2 p, vec3 weight)
{
vec2 uv = ct_plane2d_unproject(plane, p);
ivec2 px = ivec2(uv * u_resolution);

if (px.x >= 0 && px.x < int(u_resolution.x) &&
px.y >= 0 && px.y < int(u_resolution.y))
{
imageAtomicAdd(accum_r, px, weight.r);
imageAtomicAdd(accum_g, px, weight.g);
imageAtomicAdd(accum_b, px, weight.b);
imageAtomicAdd(accum_hits, px, 1.0f);
}
}

Notice how I separated my accumulation buffer into different textures?

layout(binding = 0, r32f) uniform coherent image2D accum_r;
layout(binding = 1, r32f) uniform coherent image2D accum_g;
layout(binding = 2, r32f) uniform coherent image2D accum_b;
layout(binding = 3, r32f) uniform coherent image2D accum_hits; //

alpha / hit counter

Works great and runs really fast.

Chris M. Thomasson schrieb:

On 7/29/2026 2:21 AM, Johann 'Myrkraverk' Oskarsson wrote:

On 29/07/2026 5:15 PM, Mild Shock wrote:

Hi,

Confused rossy boy is confused. We are
not building a stupid web server, where
a listener thread spawns service threads,

and to avoid malloc and free, reuses
a pool, or some shitty fork join framework.
The producer and consumer example I posted

elsewhere archived a dataflow without
malloc and free of threads. You are miles
away from what we are doing here.

Why not?-a Isn't this comp.lang.c?-a And isn't that exactly how
CivetWeb works internally?

Have you never built your own web
sever in C?-a Not even with CivetWeb?-a It's really easy!-a You
only need to implement a callback or two.

Implementing a callback or two in a preexisting system is not creating
one from scratch.

--- Synchronet 3.22a-Linux NewsLink 1.2

From Newsgroup: comp.lang.c

On 8/2/2026 2:37 PM, Mild Shock wrote:

Hi,

If only the fucking moron Chris M. Thomasson would
stop spamming his nonsense, he doesn't listen at
all. Problem, he cannot read, he knows nothing.

Its very common that compute shaders can block,
when they are used for General Purpose computation
on GPUs (GPGPU). If only he would pull out his

finger from his asshole, and stop thinking in his
WebGL legacy code stash nonsense. Even the
Cerebras Waver has blocking:

"Cerebras Software Language (CSL), send_color
and recv_color are parameters passed to tile
programs to manage data routing and virtual
channels (called colors) across processing
elements (PEs) on the wafer

Yes, both send and receive operations can block
on a Cerebras Processing Element (PE), primarily
due to the system's hardware-enforced backpressure
mechanism. Because the Cerebras Wafer-Scale Engine
(WSE) relies on a fine-grained,

dataflow-driven architecture, blocking prevents
data loss when hardware resources are
fully saturated."

Blocking and Unblocking https://sdk.cerebras.ai/computing-with-cerebras#blocking-and-unblocking

Strive to never make a compute shader wait on something, like an empty condition of a queue, stack.

Chris M. Thomasson is an annoyance and an idiot.
He is a total waste of time. And represents those
people who cannot use their brain.

I don't think you have coded compute shaders before? If so, cool, but wow.

[...]
--- Synchronet 3.22a-Linux NewsLink 1.2

From Newsgroup: comp.lang.c

On 8/2/2026 2:40 PM, Chris M. Thomasson wrote:

On 8/2/2026 2:37 PM, Mild Shock wrote:

[...]

I don't think you have coded compute shaders before? If so, cool, but wow.

[...]

If so, in GLSL, HLSL? Vulkan, Metal, Directx12, modern opengl?
--- Synchronet 3.22a-Linux NewsLink 1.2

From Newsgroup: comp.lang.c

Hi,

You are a moron. In WebGPU computer sharers
are tasks not hardware kernels. Forget your
WebGL nonsense cookbooks.

WebGPU is much more elastic.

You are just a moron.

Bye

P.S.: Take this example, I don't have 4096 kernels:

1.4 Giga Lips with a Budget Laptop https://github.com/Jean-Luc-Picard-2021/gigabudget

Still it runs, how is this done? The Ryzen has
only around 512 kernels. Newer Ryzen havae 1024
kernels. This is till below 4096 logical threads.

So how is it done?

Chris M. Thomasson schrieb:

On 8/2/2026 2:37 PM, Mild Shock wrote:

Hi,

If only the fucking moron Chris M. Thomasson would
stop spamming his nonsense, he doesn't listen at
all. Problem, he cannot read, he knows nothing.

Its very common that compute shaders can block,
when they are used for General Purpose computation
on GPUs (GPGPU). If only he would pull out his

finger from his asshole, and stop thinking in his
WebGL legacy code stash nonsense. Even the
Cerebras Waver has blocking:

"Cerebras Software Language (CSL), send_color
and recv_color are parameters passed to tile
programs to manage data routing and virtual
channels (called colors) across processing
elements (PEs) on the wafer

Yes, both send and receive operations can block
on a Cerebras Processing Element (PE), primarily
due to the system's hardware-enforced backpressure
mechanism. Because the Cerebras Wafer-Scale Engine
(WSE) relies on a fine-grained,

dataflow-driven architecture, blocking prevents
data loss when hardware resources are
fully saturated."

Blocking and Unblocking
https://sdk.cerebras.ai/computing-with-cerebras#blocking-and-unblocking

Strive to never make a compute shader wait on something, like an empty condition of a queue, stack.

Chris M. Thomasson is an annoyance and an idiot.
He is a total waste of time. And represents those
people who cannot use their brain.

I don't think you have coded compute shaders before? If so, cool, but wow.

[...]

--- Synchronet 3.22a-Linux NewsLink 1.2

From Newsgroup: comp.lang.c

Hi,

You are a moron. In WebGPU computer sharers
are tasks not hardware kernels. Forget your
WebGL nonsense cookbooks.

WebGPU is much more elastic.

You are just a moron.

Bye

P.S.: Take this example, I don't have 4096 kernels:

11.4 Giga Lips with a Budget Laptop https://github.com/Jean-Luc-Picard-2021/gigabudget

Still it runs, how is this done? The Ryzen has
only around 512 kernels. Newer Ryzen havae 1024
kernels. This is till below 4096 logical threads.

So how is it done?


Chris M. Thomasson schrieb:

On 8/2/2026 2:37 PM, Mild Shock wrote:

Hi,

If only the fucking moron Chris M. Thomasson would
stop spamming his nonsense, he doesn't listen at
all. Problem, he cannot read, he knows nothing.

Its very common that compute shaders can block,
when they are used for General Purpose computation
on GPUs (GPGPU). If only he would pull out his

finger from his asshole, and stop thinking in his
WebGL legacy code stash nonsense. Even the
Cerebras Waver has blocking:

"Cerebras Software Language (CSL), send_color
and recv_color are parameters passed to tile
programs to manage data routing and virtual
channels (called colors) across processing
elements (PEs) on the wafer

Yes, both send and receive operations can block
on a Cerebras Processing Element (PE), primarily
due to the system's hardware-enforced backpressure
mechanism. Because the Cerebras Wafer-Scale Engine
(WSE) relies on a fine-grained,

dataflow-driven architecture, blocking prevents
data loss when hardware resources are
fully saturated."

Blocking and Unblocking
https://sdk.cerebras.ai/computing-with-cerebras#blocking-and-unblocking

Strive to never make a compute shader wait on something, like an empty condition of a queue, stack.

Chris M. Thomasson is an annoyance and an idiot.
He is a total waste of time. And represents those
people who cannot use their brain.

I don't think you have coded compute shaders before? If so, cool, but wow.

[...]

--- Synchronet 3.22a-Linux NewsLink 1.2

From Newsgroup: comp.lang.c

Hi,

This was archived on Jul 9, 2026:

11.4 Giga Lips with a Budget Laptop https://github.com/Jean-Luc-Picard-2021/gigabudget

Still today on Aug 03, 2026, the usenet
community still struggles with the experiment,
doesn't know the meaning and implications,

especially clueless about 4096 shaders and
modern GPU elasticity. Woa! Thats impressive.
Especially Chris M. Thomasson has a still ongoing

hard time with this little WebGPU experiment.

Bye

Mild Shock schrieb:

Hi,

You are a moron. In WebGPU computer sharers
are tasks not hardware kernels. Forget your
WebGL nonsense cookbooks.

WebGPU is much more elastic.

You are just a moron.

Bye

P.S.: Take this example, I don't have 4096 kernels:

11.4 Giga Lips with a Budget Laptop https://github.com/Jean-Luc-Picard-2021/gigabudget

Still it runs, how is this done? The Ryzen has
only around 512 kernels. Newer Ryzen havae 1024
kernels. This is till below 4096 logical threads.

So how is it done?

Chris M. Thomasson schrieb:

On 8/2/2026 2:37 PM, Mild Shock wrote:

Hi,

If only the fucking moron Chris M. Thomasson would
stop spamming his nonsense, he doesn't listen at
all. Problem, he cannot read, he knows nothing.

Its very common that compute shaders can block,
when they are used for General Purpose computation
on GPUs (GPGPU). If only he would pull out his

finger from his asshole, and stop thinking in his
WebGL legacy code stash nonsense. Even the
Cerebras Waver has blocking:

"Cerebras Software Language (CSL), send_color
and recv_color are parameters passed to tile
programs to manage data routing and virtual
channels (called colors) across processing
elements (PEs) on the wafer

Yes, both send and receive operations can block
on a Cerebras Processing Element (PE), primarily
due to the system's hardware-enforced backpressure
mechanism. Because the Cerebras Wafer-Scale Engine
(WSE) relies on a fine-grained,

dataflow-driven architecture, blocking prevents
data loss when hardware resources are
fully saturated."

Blocking and Unblocking
https://sdk.cerebras.ai/computing-with-cerebras#blocking-and-unblocking

Strive to never make a compute shader wait on something, like an empty
condition of a queue, stack.

Chris M. Thomasson is an annoyance and an idiot.
He is a total waste of time. And represents those
people who cannot use their brain.

I don't think you have coded compute shaders before? If so, cool, but
wow.

[...]

--- Synchronet 3.22a-Linux NewsLink 1.2

From Newsgroup: comp.lang.c

Hi,

Now that the debate with Chris M. Thomasson
has culminated in questions of elasticity,
I suggest this homework:

- Game Engine in WebGPU
It will support the life cycle of sprites,
like sprites comming out of nowhere,
and being destroyed by arms,
just like in Space invader.

This would be surely a fantastic exercise,
to see what a GPU can do and cannot do,
in respect of life cycle of threads, especially

modern GPUs that sell the CUDA dream.

Have Fun!

Become a nosomatic AI chirurgeon.

Bye

Mild Shock schrieb:

Hi,

A nosomatic AI chirurgeon is a halfling student
of sickness, and a master of the ebb and flow of
the energies of life and death of data packets.

He is a air bender, water bender and earth bender
in one person, using OpenVINO to juggle with
CPU, GPU and NPU.

Last but not least he can freely switch between
symbolic and neural representation of knowledge
forms, there is no abyss for him.

Bye

Mild Shock schrieb:

Hi,

This was archived on Jul 9, 2026:

11.4 Giga Lips with a Budget Laptop https://github.com/Jean-Luc-Picard-2021/gigabudget

Still today on Aug 03, 2026, the usenet
community still struggles with the experiment,
doesn't know the meaning and implications,

especially clueless about 4096 shaders and
modern GPU elasticity. Woa! Thats impressive.
Especially Chris M. Thomasson has a still ongoing

hard time with this little WebGPU experiment.

Bye

Mild Shock schrieb:

Hi,

You are a moron. In WebGPU computer sharers
are tasks not hardware kernels. Forget your
WebGL nonsense cookbooks.

WebGPU is much more elastic.

You are just a moron.

Bye

P.S.: Take this example, I don't have 4096 kernels:

11.4 Giga Lips with a Budget Laptop
https://github.com/Jean-Luc-Picard-2021/gigabudget

Still it runs, how is this done? The Ryzen has
only around 512 kernels. Newer Ryzen havae 1024
kernels. This is till below 4096 logical threads.

So how is it done?


Chris M. Thomasson schrieb:

On 8/2/2026 2:37 PM, Mild Shock wrote:

Hi,

If only the fucking moron Chris M. Thomasson would
stop spamming his nonsense, he doesn't listen at
all. Problem, he cannot read, he knows nothing.

Its very common that compute shaders can block,
when they are used for General Purpose computation
on GPUs (GPGPU). If only he would pull out his

finger from his asshole, and stop thinking in his
WebGL legacy code stash nonsense. Even the
Cerebras Waver has blocking:

"Cerebras Software Language (CSL), send_color
and recv_color are parameters passed to tile
programs to manage data routing and virtual
channels (called colors) across processing
elements (PEs) on the wafer

Yes, both send and receive operations can block
on a Cerebras Processing Element (PE), primarily
due to the system's hardware-enforced backpressure
mechanism. Because the Cerebras Wafer-Scale Engine
(WSE) relies on a fine-grained,

dataflow-driven architecture, blocking prevents
data loss when hardware resources are
fully saturated."

Blocking and Unblocking
https://sdk.cerebras.ai/computing-with-cerebras#blocking-and-unblocking >>>

Strive to never make a compute shader wait on something, like an
empty condition of a queue, stack.

Chris M. Thomasson is an annoyance and an idiot.
He is a total waste of time. And represents those
people who cannot use their brain.

I don't think you have coded compute shaders before? If so, cool, but
wow.

[...]

--- Synchronet 3.22a-Linux NewsLink 1.2

From Newsgroup: comp.lang.c

Hi,

I even don't remember exactly why I landed
in comp.theory. A yes, because Rossy Boy,
was hooked on SIMD and didn't understand Hack.

But the Hack work, rather belongs to my
Alma Mater Zurich and my personal heros, Gutnecht
and Wirth, who wrote a one pass Modula

compiler during some christmas holidays,
back then when I was student. Not sure
whether the Ljubljana School can do that,

when I read this here:

Finite Algebraic Effects as dicts and such https://www.philipzucker.com/bdd_term_alg_effects/

I only find gibberish like:
- rCLDatarCY is somehow less mysterious to me
than rCLcomputationrCY. [..] I donrCOt even
know what rCLcomputationrCY really is

- In temporal logic, there is a logic CTL
which talks about computation trees.

- Algerbaic (LoL) effects is almost a complete
hackery abuse of the notion of arity
and thatrCOs neat.

- Then there are 10^10 etc vectors which
show up if you discretize 3d/4d space. [..]
or reinforcement learning.

- Etc..

WTF is this guy smoking? I mean he even
doesn't uses math notation, only posts
Python code fragments |a go go,

possibly a Python brain damage.

But still less sever than Rossy Boys.

Bye

Ross Finlayson schrieb:

Hello, here I'll post some design notes and a panel discussion with some chat-bots about making some sense of the "vector-wide scalar word"
and "character machines", on commodity hardware about ubiquitous
operations.

It's considered at least tangentially relevant to comp.lang.c and comp.lang.c++ because for example text is ubiquitous and the targets
would be low-level, while the higher-level languages would have a
same sort of patternry, and for example that libc and cstdlib are
standard, and as with regards to POSIX and Unicode and so on.

Please feel free to excuse or ignore, or comment as freely.

Thanks for reading.

--- Synchronet 3.22a-Linux NewsLink 1.2

From Newsgroup: comp.lang.c

On 04/08/2026 2:14 AM, Mild Shock wrote:

Hi,

I even don't remember exactly why I landed
in comp.theory. A yes, because Rossy Boy,
was hooked on SIMD and didn't understand Hack.

But the Hack work, rather belongs to my
Alma Mater Zurich and my personal heros, Gutnecht
and Wirth, who wrote a one pass Modula

That's interesting. Have you read /Software Engineering
with Modula-2 and Ada/ (1984) by Richard Wiener and Richard
Sincovec? I have it on my shelf, and haven't gotten to read
it yet.

compiler during some christmas holidays,
back then when I was student. Not sure
whether the Ljubljana School can do that,

when I read this here:

Finite Algebraic Effects as dicts and such https://www.philipzucker.com/bdd_term_alg_effects/

I only find gibberish like:
- rCLDatarCY is somehow less mysterious to me
-a than rCLcomputationrCY.-a [..] I donrCOt even
-a know what rCLcomputationrCY really is

Computation is at the core just a calculation. Humans
used to do this, and there's a good documentary about it
titled /Hidden Figures/. I assume everyone here has seen
it.

- In temporal logic, there is a logic CTL
-a which talks about computation trees.

- Algerbaic (LoL) effects is almost a complete
-a hackery abuse of the notion of arity
-a and thatrCOs neat.

Are you using /algebraic effects/ when playing League
of Legends? I tried it once, but discovered it's a
gameplay that doesn't appeal to me. I didn't think to
use /algebraic effects/ in it.

- Then there are 10^10 etc vectors which
-a show up if you discretize 3d/4d space. [..]
-a or reinforcement learning.

I don't know why you have that many vectors visiting,
but please treat them with hospitality according to
Zeus' laws.

- Etc..

WTF is this guy smoking? I mean he even
doesn't uses math notation, only posts
Python code fragments |a go go,

possibly a Python brain damage.

Or he just works in the ministry of silly walks?


Enjoy!
--
Johann | email: invalid -> com | http://www.myrkraverk.com/blog/
I'm not from the Internet, I just work there. | via Easynews.com https://bsky.app/profile/myrkraverk.bsky.social
--- Synchronet 3.22a-Linux NewsLink 1.2

From Newsgroup: comp.lang.c

Hi,

I found that this here:

public final static class RendezVous {
private final Semaphore head = new Semaphore(0);
private final Semaphore tail = new Semaphore(1);
private Object data;

public void put(Object data) throws InterruptedException {
tail.acquire();
this.data = data;
head.release();
}

public Object take() throws InterruptedException {
Object res;
head.acquire();
res = data;
tail.release();
return res;
}
}

Is almost as fast as ArrayBlockingQueue(4),
in a producer worker consumer scenario.

So I considering using the above for the
pi-WAM channels. It would be also closer

to pi-calculus by Robin Milner.

Bye

Johann 'Myrkraverk' Oskarsson schrieb:

On 04/08/2026 2:14 AM, Mild Shock wrote:

Hi,

I even don't remember exactly why I landed
in comp.theory. A yes, because Rossy Boy,
was hooked on SIMD and didn't understand Hack.

But the Hack work, rather belongs to my
Alma Mater Zurich and my personal heros, Gutnecht
and Wirth, who wrote a one pass Modula

That's interesting.-a Have you read /Software Engineering
with Modula-2 and Ada/ (1984) by Richard Wiener and Richard
Sincovec?-a I have it on my shelf, and haven't gotten to read
it yet.

compiler during some christmas holidays,
back then when I was student. Not sure
whether the Ljubljana School can do that,

when I read this here:

Finite Algebraic Effects as dicts and such
https://www.philipzucker.com/bdd_term_alg_effects/

I only find gibberish like:
- rCLDatarCY is somehow less mysterious to me
-a-a than rCLcomputationrCY.-a [..] I donrCOt even
-a-a know what rCLcomputationrCY really is

Computation is at the core just a calculation.-a Humans
used to do this, and there's a good documentary about it
titled /Hidden Figures/.-a I assume everyone here has seen
it.

- In temporal logic, there is a logic CTL
-a-a which talks about computation trees.

- Algerbaic (LoL) effects is almost a complete
-a-a hackery abuse of the notion of arity
-a-a and thatrCOs neat.

Are you using /algebraic effects/ when playing League
of Legends?-a I tried it once, but discovered it's a
gameplay that doesn't appeal to me.-a I didn't think to
use /algebraic effects/ in it.

- Then there are 10^10 etc vectors which
-a-a show up if you discretize 3d/4d space. [..]
-a-a or reinforcement learning.

I don't know why you have that many vectors visiting,
but please treat them with hospitality according to
Zeus' laws.

- Etc..

WTF is this guy smoking? I mean he even
doesn't uses math notation, only posts
Python code fragments |a go go,

possibly a Python brain damage.

Or he just works in the ministry of silly walks?

Enjoy!

--- Synchronet 3.22a-Linux NewsLink 1.2

From Newsgroup: comp.lang.c

Hi,

I have nevertheless to thank the Ljubljana
School, especially this blog post:

Verifying Nand2Tetris Assembly
https://www.philipzucker.com/nand2tetris-chc/

Which raised my interest in Hack. Meanwhile
I could produce this toy eample:

"We try to find 0xCAFFEE in enumerating 4
6-bit digits and the baseline is Dogelog
Player VM in a browser. The CPU backend
with 64 logical threads is already 20
times faster, partly due to its 32-bit
specialization. The GPU backend with
4096 logical threads boosts a further
factor of 7 times."

GPU Backend: Find 0xCAFFEE with -C-WAM
https://medium.com/2989/8890efd3503c

LoL

Bye

Mild Shock schrieb:

Hi,

I even don't remember exactly why I landed
in comp.theory. A yes, because Rossy Boy,
was hooked on SIMD and didn't understand Hack.

But the Hack work, rather belongs to my
Alma Mater Zurich and my personal heros, Gutnecht
and Wirth, who wrote a one pass Modula

compiler during some christmas holidays,
back then when I was student. Not sure
whether the Ljubljana School can do that,

when I read this here:

Finite Algebraic Effects as dicts and such https://www.philipzucker.com/bdd_term_alg_effects/

I only find gibberish like:
- rCLDatarCY is somehow less mysterious to me
-a than rCLcomputationrCY.-a [..] I donrCOt even
-a know what rCLcomputationrCY really is

- In temporal logic, there is a logic CTL
-a which talks about computation trees.

- Algerbaic (LoL) effects is almost a complete
-a hackery abuse of the notion of arity
-a and thatrCOs neat.

- Then there are 10^10 etc vectors which
-a show up if you discretize 3d/4d space. [..]
-a or reinforcement learning.

- Etc..

WTF is this guy smoking? I mean he even
doesn't uses math notation, only posts
Python code fragments |a go go,

possibly a Python brain damage.

But still less sever than Rossy Boys.

Bye

Ross Finlayson schrieb:

Hello, here I'll post some design notes and a panel discussion with some
chat-bots about making some sense of the "vector-wide scalar word"
and "character machines", on commodity hardware about ubiquitous
operations.


It's considered at least tangentially relevant to comp.lang.c and
comp.lang.c++ because for example text is ubiquitous and the targets
would be low-level, while the higher-level languages would have a
same sort of patternry, and for example that libc and cstdlib are
standard, and as with regards to POSIX and Unicode and so on.

Please feel free to excuse or ignore, or comment as freely.

Thanks for reading.

--- Synchronet 3.22a-Linux NewsLink 1.2

From Newsgroup: comp.lang.c

On 8/2/2026 5:08 PM, Mild Shock wrote:
[...]

I don't think you have coded compute shaders before? If so, cool,
but wow.

Never mind. You are too hostile. Not worth it. Sorry. Plonk.
--- Synchronet 3.22a-Linux NewsLink 1.2

From Newsgroup: comp.lang.c

Hi,

But because I do a grouping of logical threads
before I go on physical threads, a spinlock
rewrite will be necessary.

I did already a spinlock rewrite, using
a class Spinlock instead of the class Semaphore.
But ultimately I would switch from put() to

an offer() API, that returns a boolean, and
this can be used to skip instructions or otherwise
react in the Hack VM. Same for take() would

need to replace by poll() with repercussions
to Hack VM again. This is much to the dismay
of Chris M. Thomasson, who thinks spinning

is strictly forbidden. But I will sing the song:

I'm a spinner, I'm a sinner
I spin on CAS loops for my dinner
Some call it busy-wait, I call it fate
When the queue is empty, I just rotate

Bye

Mild Shock schrieb:

Hi,

I found that this here:

-a-a-a public final static class RendezVous {
-a-a-a-a-a-a-a private final Semaphore head = new Semaphore(0);
-a-a-a-a-a-a-a private final Semaphore tail = new Semaphore(1);
-a-a-a-a-a-a-a private Object data;

-a-a-a-a-a-a-a public void put(Object data) throws InterruptedException {
-a-a-a-a-a-a-a-a-a-a-a tail.acquire();
-a-a-a-a-a-a-a-a-a-a-a this.data = data;
-a-a-a-a-a-a-a-a-a-a-a head.release();
-a-a-a-a-a-a-a }

-a-a-a-a-a-a-a public Object take() throws InterruptedException {
-a-a-a-a-a-a-a-a-a-a-a Object res;
-a-a-a-a-a-a-a-a-a-a-a head.acquire();
-a-a-a-a-a-a-a-a-a-a-a res = data;
-a-a-a-a-a-a-a-a-a-a-a tail.release();
-a-a-a-a-a-a-a-a-a-a-a return res;
-a-a-a-a-a-a-a }
-a-a-a }

Is almost as fast as ArrayBlockingQueue(4),
in a producer worker consumer scenario.

So I considering using the above for the
pi-WAM channels. It would be also closer

to pi-calculus by Robin Milner.

Bye

Johann 'Myrkraverk' Oskarsson schrieb:

On 04/08/2026 2:14 AM, Mild Shock wrote:

Hi,

I even don't remember exactly why I landed
in comp.theory. A yes, because Rossy Boy,
was hooked on SIMD and didn't understand Hack.

But the Hack work, rather belongs to my
Alma Mater Zurich and my personal heros, Gutnecht
and Wirth, who wrote a one pass Modula

That's interesting.-a Have you read /Software Engineering
with Modula-2 and Ada/ (1984) by Richard Wiener and Richard
Sincovec?-a I have it on my shelf, and haven't gotten to read
it yet.

compiler during some christmas holidays,
back then when I was student. Not sure
whether the Ljubljana School can do that,

when I read this here:

Finite Algebraic Effects as dicts and such
https://www.philipzucker.com/bdd_term_alg_effects/

I only find gibberish like:
- rCLDatarCY is somehow less mysterious to me
-a-a than rCLcomputationrCY.-a [..] I donrCOt even
-a-a know what rCLcomputationrCY really is

Computation is at the core just a calculation.-a Humans
used to do this, and there's a good documentary about it
titled /Hidden Figures/.-a I assume everyone here has seen
it.

- In temporal logic, there is a logic CTL
-a-a which talks about computation trees.

- Algerbaic (LoL) effects is almost a complete
-a-a hackery abuse of the notion of arity
-a-a and thatrCOs neat.

Are you using /algebraic effects/ when playing League
of Legends?-a I tried it once, but discovered it's a
gameplay that doesn't appeal to me.-a I didn't think to
use /algebraic effects/ in it.

- Then there are 10^10 etc vectors which
-a-a show up if you discretize 3d/4d space. [..]
-a-a or reinforcement learning.

I don't know why you have that many vectors visiting,
but please treat them with hospitality according to
Zeus' laws.

- Etc..

WTF is this guy smoking? I mean he even
doesn't uses math notation, only posts
Python code fragments |a go go,

possibly a Python brain damage.

Or he just works in the ministry of silly walks?


Enjoy!

--- Synchronet 3.22a-Linux NewsLink 1.2

From Newsgroup: comp.lang.c

Hi,

You are not correctly thinking.
I am not using WebGL. I use WebGPU.
Spinning is perfectly fine. I will

soon give proof. Meanwhile enjoy
this use case, so that you understand
the goal of Prolog "inferencing" for

a simple example:

"We try to find 0xCAFFEE in enumerating 4
6-bit digits and the baseline is Dogelog
Player VM in a browser. The CPU backend
with 64 logical threads is already 20
times faster, partly due to its 32-bit
specialization. The GPU backend with
4096 logical threads boosts a further
factor of 7 times."

GPU Backend: Find 0xCAFFEE with -C-WAM
https://medium.com/2989/8890efd3503c

If you don't understand the goal, and
the benefits of the goal, all your
thinking will anyways be incorrect.

Bye

Chris M. Thomasson schrieb:

On 8/2/2026 5:08 PM, Mild Shock wrote:
[...]

***I don't think** you have coded compute
shaders before? If so, cool, but wow.

Never mind. You are too hostile. Not worth it. Sorry. Plonk.

--- Synchronet 3.22a-Linux NewsLink 1.2

From Newsgroup: comp.lang.c

On 8/3/2026 12:04 PM, Mild Shock wrote:

Hi,

You are not correctly thinking.
I am not using WebGL. I use WebGPU.
Spinning is perfectly fine. I will

Wait... Before I totally plonk... Spinning is fine in a compute shader? Really? If so my FIFO queue fetch-add-only tweak from Dimity's would
work fine. Also, Dmitry's CAS based one is good as well. My tweak
version of his have different tradeoffs... I personally would not want
to use any of them in a compute shader, never spin and/or wait! Strive
for it, really hard, first... But, well, does your system have "waiting primitives" so you don't have to spin? Also, if you do spin you need
some sort of backoff, right? Aka PAUSE on x86, etc... Or notice in my
FIFO one can take the ticket and spin on it later as in a backoff is
doing other real work.

Akin to my special mutex pattern that can be found here in this group.
Iirc the thread is entitled:

fun with a mutex...



So, I am using dirextc12 and modern opengl for my compute shaders right
now. GLSL as my lang. I need to provide some state for them to work
with. Aka, textures and uniforms.

soon give proof. Meanwhile enjoy
this use case, so that you understand
the goal of Prolog "inferencing" for

a simple example:

"We try to find 0xCAFFEE in enumerating 4
6-bit digits and the baseline is Dogelog
Player VM in a browser. The CPU backend
with 64 logical threads is already 20
times faster, partly due to its 32-bit
specialization. The GPU backend with
4096 logical threads boosts a further
factor of 7 times."

GPU Backend: Find 0xCAFFEE with -C-WAM
https://medium.com/2989/8890efd3503c

If you don't understand the goal, and
the benefits of the goal, all your
thinking will anyways be incorrect.

Bye

Chris M. Thomasson schrieb:

On 8/2/2026 5:08 PM, Mild Shock wrote:
[...]

***I don't think** you have coded compute shaders before? If so,
cool, but wow.

Never mind. You are too hostile. Not worth it. Sorry. Plonk.

Fun with a mutex:


(read all...)
____________________________________
// A Fun Mutex Pattern? Or, a Nightmare? Humm...
// By: Chris M. Thomasson
//___________________________________________________


#include <iostream>
#include <random>
#include <numeric>
#include <algorithm>
#include <thread>
#include <atomic>
#include <mutex>


#define CT_WORKERS (42)
#define CT_ITERS (996699)
#define CT_BACKOFFS (42)
#define CT_RAND_MAX (20)
#define CT_RAND_THRESHOLD (5)


struct ct_shared
{
std::mutex m_fun_mutex;
std::atomic<unsigned long> m_other_work = { 0 };
int m_test_count0 = 0;

void
sanity_check_dump() const
{
std::cout << "(ct_shared:" << this << ")->" <<
"m_test_count0 = " << m_test_count0 << ", " <<
"m_other_work = " << m_other_work.load(std::memory_order_relaxed) << "\n";
}

bool
sanity_check_validate() const
{
return (m_test_count0 == CT_ITERS * CT_WORKERS);
}
};



void
ct_worker_entry(
ct_shared& shared
) {
//std::cout << "ct_worker_entry" << std::endl; // testing thread
race for sure...

// Thread Local...
std::random_device rnd_seed = { };
std::mt19937 rnd_gen(rnd_seed());
std::uniform_int_distribution<unsigned long> rnd_dist(0, CT_RAND_MAX);

for (unsigned long i = 0; i < CT_ITERS; ++i)
{
// Lock logic...
{
unsigned long backoff = 0;

while (! shared.m_fun_mutex.try_lock())
{
unsigned long rnd0 = rnd_dist(rnd_gen);

if (rnd0 > CT_RAND_THRESHOLD || backoff > CT_BACKOFFS)
{
shared.m_fun_mutex.lock();
break;
}

// do other work... :^)
shared.m_other_work.fetch_add(1,
std::memory_order_relaxed);

// but not too much work... ;^o
++backoff;
}
}

// Critical Section...
{
shared.m_test_count0 = shared.m_test_count0 + 1;
}

// Unlock
{
shared.m_fun_mutex.unlock();
}
}
}


int main()
{
// Hello... :^)
{
std::cout << "Hello ct_fun_mutex... lol? ;^) ver:(0.0.0)\n";
std::cout << "By: Chris M. Thomasson\n";
std::cout << "____________________________________________________\n";
std::cout.flush();
}

// Create our fun things... ;^)
ct_shared shared = { };
std::thread workers[CT_WORKERS] = { };

// Lanuch...
{
std::cout << "Launching Threads...\n";
std::cout.flush();

for (unsigned long i = 0; i < CT_WORKERS; ++i)
{
workers[i] = std::thread(ct_worker_entry, std::ref(shared));
}
}

// Join...
{
std::cout << "Joining Threads... (computing :^)\n";
std::cout.flush();
for (unsigned long i = 0; i < CT_WORKERS; ++i)
{
workers[i].join();
}
}

// Sanity Check...
{
shared.sanity_check_dump();

if (! shared.sanity_check_validate())
{
std::cout << "\n\n**** Pardon my French, but FUCK!!!!!
****\n" << std::endl;
}

else
{
std::cout << "\nWe are Sane!\n\n";
std::cout << "We completed " <<
shared.m_other_work.load(std::memory_order_relaxed) <<
" work items while waiting for the mutex..." << std::endl;
}
}

// Fin...
{
std::cout << "____________________________________________________\n";
std::cout << "Fin... :^)\n" << std::endl;
}

return 0;
}
____________________________________

Any luck? Its fun to see how many work items were completed when the
mutex was contended...
--- Synchronet 3.22a-Linux NewsLink 1.2

From Newsgroup: comp.lang.c

Hi,

Why do you even open your mouth if you
don't use WebGPU / WGSL? This beyond my
comprehension. OpenGL was phased out by

Apple years ago. It only lives on some
linux boxes. Also you probably don't use
an AI Laptop. Just make a simple calculation,

if you have 512 Kernels, and oversubscribe
4096 logical threads. Then each Kernel runs
4 logical threads. If one of these 4 logical

threads spins, how much performance is lost?
25% of this single kernel. And there are
still 511 Kernels. Spinning is totally fine,

thats why WGSL provides CAS, and not some
waitlists. The kernels are the wait lists itself
doing the following when spinning:

NOP
NOP
NOP
Etc..

Until the a condition is met. You even don't
need backoff, because you cannot pause. The
only pause you can do is a barrier.

But if the condition is not met while the
barrier is met, what will you do?

Bye

Chris M. Thomasson schrieb:

So, I am using dirextc12 and modern opengl for my
compute shaders right now. GLSL as my lang. I need
to provide some state for them to work
with. Aka, textures and uniforms.

--- Synchronet 3.22a-Linux NewsLink 1.2

From Newsgroup: comp.lang.c

Hi,

I you use atomicAdd() you have the same friction
as if you use Queue put() or take(). There is
no difference. The only difference is unbounded

versus bounded. I tried to explain that like
100-times already. Your comment here:

Any luck? Its fun to see how many work
items were completed when the mutex was contended...

Says to me you don't understand queues. They
are not mutexes. Because you don't understand
queues, you also don't understand OpenMP

parallelism and patterns such as producer,
workers, consumer. Contention is usually minimal,
the workers just fetch work items from the

producer, and then do some workload. And
then hand the result to the consumer. If
you use atomicAdd() you have the same friction

as if you use Queue put() or take(). There
is no difference. The only difference is unbounded
versus bounded. I tried to explain that

like 100-times already.

Bye

Mild Shock schrieb:

Hi,

Why do you even open your mouth if you
don't use WebGPU / WGSL? This beyond my
comprehension. OpenGL was phased out by

Apple years ago. It only lives on some
linux boxes. Also you probably don't use
an AI Laptop. Just make a simple calculation,

if you have 512 Kernels, and oversubscribe
4096 logical threads. Then each Kernel runs
4 logical threads. If one of these 4 logical

threads spins, how much performance is lost?
25% of this single kernel. And there are
still 511 Kernels. Spinning is totally fine,

thats why WGSL provides CAS, and not some
waitlists. The kernels are the wait lists itself
doing the following when spinning:

NOP
NOP
NOP
Etc..

Until the a condition is met. You even don't
need backoff, because you cannot pause. The
only pause you can do is a barrier.

But if the condition is not met while the
barrier is met, what will you do?

Bye

Chris M. Thomasson schrieb:

So, I am using dirextc12 and modern opengl for my compute shaders
right-a now. GLSL as my lang. I need to provide some state for them to
work with. Aka, textures and uniforms.

--- Synchronet 3.22a-Linux NewsLink 1.2

From Newsgroup: comp.lang.c

On 8/3/2026 1:37 PM, Mild Shock wrote:

Hi,

I you use atomicAdd() you have the same friction
as if you use Queue put() or take(). There is
no difference. The only difference is unbounded

versus bounded. I tried to explain that like
100-times already. Your comment here:

Any luck? Its fun to see how many work
items were completed when the mutex was contended...

Says to me you don't understand queues. They
are not mutexes. Because you don't understand
queues, you also don't understand OpenMP

parallelism and patterns such as producer,
workers, consumer. Contention is usually minimal,
the workers just fetch work items from the

producer, and then do some workload. And
then hand the result to the consumer. If
you use atomicAdd() you have the same friction

as if you use Queue put() or take(). There
is no difference. The only difference is unbounded
versus bounded. I tried to explain that[...]

lol. I forgot to add you to my killfile. Damn it! Anyway, I know all
about them. Sigh. Peace be with you.
--- Synchronet 3.22a-Linux NewsLink 1.2

From Newsgroup: comp.lang.c

Hi,

Know nothing and forget what you posted
day before. You are the most unfocused
idiotic liar and spammer I have ever met.

Maybe produce some results or shut up!

Bye

Chris M. Thomasson schrieb:

On 8/3/2026 1:37 PM, Mild Shock wrote:

Hi,

I you use atomicAdd() you have the same friction
as if you use Queue put() or take(). There is
no difference. The only difference is unbounded

versus bounded. I tried to explain that like
100-times already. Your comment here:

Any luck? Its fun to see how many work
items were completed when the mutex was contended...

Says to me you don't understand queues. They
are not mutexes. Because you don't understand
queues, you also don't understand OpenMP

parallelism and patterns such as producer,
workers, consumer. Contention is usually minimal,
the workers just fetch work items from the

producer, and then do some workload. And
then hand the result to the consumer. If
you use atomicAdd() you have the same friction

as if you use Queue put() or take(). There
is no difference. The only difference is unbounded
versus bounded. I tried to explain that[...]

lol. I forgot to add you to my killfile. Damn it! Anyway, I know all
about them. Sigh. Peace be with you.

--- Synchronet 3.22a-Linux NewsLink 1.2

From Newsgroup: comp.lang.c

Hi,

Or do a YouTube video about:

Standing on the shoulders of giants https://en.wikipedia.org/wiki/Standing_on_the_shoulders_of_giants

Calling people who build software "thieves",
is probably the most philosopher syphilis brain

thing I ever heard in 2026. You should really
jump from a bridge Rossy Boy. I think its over

for you, the lamps have already gone out...

Bye

Mild Shock schrieb:

Hi,

Do a YouTube video about it:

Topic: Tit for Tat, or how I messed up
with an innocent poster, and learnt about FAFO:

#fuckaroundandfindout
https://www.youtube.com/shorts/6ALRRksc72M

You were provable the first idiot, posting
stupid comments into my posts, besides of

course Micro Penis, who is a paid troll.

Have Fun!

Bye

Ross Finlayson schrieb:

For dummies, ....

Mild Shock schrieb:

Hi,

I don't use Rust, you are crazy. First of
all the parallel simulator is 100% written
in Prolog, should also run in ISO Prolog,

enhanced by a library(lists). Second I only
mentioned that WebGPU / WGSL, the language
there has a Rust inspired language.

Its not Rust. Whats wrong with you? Why do
you adress your weariness of life to me.
I am neither thief, nor can I help you

with your frustration, and histeric outbursts.
Maybe just be a man and jump off a bridge, idiot.
Or tame your frustration, usenet is not for

you alone, your stupid asshole.

Bye

Ross Finlayson schrieb:

https://www.theregister.com/databases/2026/07/29/after-rewriting-sqlite-in-rust-turso-turns-its-sights-on-postgres/5279835

I don't much care about Rust.

.. gibberish ..

Thief.

--- Synchronet 3.22a-Linux NewsLink 1.2

From Newsgroup: comp.lang.c

Hi,

Ross Finlayson schrieb:

of various approaches to Szemeredi, and about the independence
of various approaches of entropy, or Aristotle and Leibniz

You horrible horrible Person and Thief.
Balantly stealing from Szemeredi, Aristotle,
Leibniz, etc..

Ross Finlayson schrieb:

wrote Newton's method, where of course Kepler wrote
the System of the World's universal gravitation, that

And poor Newton and Kepler get also exploited,
from shameless Rossy Boy. Thats not very original,
shame on you!

I guess this is the final verdict for you. As a
person without original thought, you need
to do as a big favor,

and jump from a bridge.

Bye

Mild Shock schrieb:

Hi,

Or do a YouTube video about:

Standing on the shoulders of giants https://en.wikipedia.org/wiki/Standing_on_the_shoulders_of_giants

Calling people who build software "thieves",
is probably the most philosopher syphilis brain

thing I ever heard in 2026. You should really
jump from a bridge Rossy Boy. I think its over

for you, the lamps have already gone out...

Bye

Mild Shock schrieb:

Hi,

Do a YouTube video about it:

Topic: Tit for Tat, or how I messed up
with an innocent poster, and learnt about FAFO:

#fuckaroundandfindout
https://www.youtube.com/shorts/6ALRRksc72M

You were provable the first idiot, posting
stupid comments into my posts, besides of

course Micro Penis, who is a paid troll.

Have Fun!

Bye

Ross Finlayson schrieb:

For dummies, ....

Mild Shock schrieb:

Hi,

I don't use Rust, you are crazy. First of
all the parallel simulator is 100% written
in Prolog, should also run in ISO Prolog,

enhanced by a library(lists). Second I only
mentioned that WebGPU / WGSL, the language
there has a Rust inspired language.

Its not Rust. Whats wrong with you? Why do
you adress your weariness of life to me.
I am neither thief, nor can I help you

with your frustration, and histeric outbursts.
Maybe just be a man and jump off a bridge, idiot.
Or tame your frustration, usenet is not for

you alone, your stupid asshole.

Bye

Ross Finlayson schrieb:

https://www.theregister.com/databases/2026/07/29/after-rewriting-sqlite-in-rust-turso-turns-its-sights-on-postgres/5279835

I don't much care about Rust.

.. gibberish ..

Thief.

--- Synchronet 3.22a-Linux NewsLink 1.2

From Newsgroup: comp.lang.c

Hi,

Rossy Boy was a generative AI before
the term existed. All his postes are huge
piles of copy pasta slop.

Not a single original thought, or even
some understanding what he writes. Nowadays
he uses Kimi to produce his copy pasta

slop. One result from his paper mill,
Even a bibliograph cannot help here.

RF rCo transcript received and read. The session closed well. What we
mapped out across these rounds is, to my mind, a credible foundation:
two matcher normal forms (AND for properties, XOR for code-points), a validated SSE2 smearing sequence via Claude's S1/S2 sketch, a closed
calling convention with explicit ABI spill gates, and the SBC-less
design mantra as a gradient rather than a boolean. The open items rCo
stack tagging, AST wire format, bit-granular Viswath boundaries rCo are properly scoped for next time rather than lost.

"bit-granular Viswath boundaries" LoL

It probably refers to Rossy Boys "Wish he
knew What" he is talking about, Viswath is his
alter ego projection:

The unbounded gibber polymath.

Bye

Mild Shock schrieb:

Hi,

Ross Finlayson schrieb:

of various approaches to Szemeredi, and about the independence
of various approaches of entropy, or Aristotle and Leibniz

You horrible horrible Person and Thief.
Balantly stealing from Szemeredi, Aristotle,
Leibniz, etc..

Ross Finlayson schrieb:

wrote Newton's method, where of course Kepler wrote
the System of the World's universal gravitation, that

And poor Newton and Kepler get also exploited,
from shameless Rossy Boy. Thats not very original,
shame on you!

I guess this is the final verdict for you. As a
person without original thought, you need
to do as a big favor,

and jump from a bridge.

Bye

Mild Shock schrieb:

Hi,

Or do a YouTube video about:

Standing on the shoulders of giants
https://en.wikipedia.org/wiki/Standing_on_the_shoulders_of_giants

Calling people who build software "thieves",
is probably the most philosopher syphilis brain

thing I ever heard in 2026. You should really
jump from a bridge Rossy Boy. I think its over

for you, the lamps have already gone out...

Bye

Mild Shock schrieb:

Hi,

Do a YouTube video about it:

Topic: Tit for Tat, or how I messed up
with an innocent poster, and learnt about FAFO:

#fuckaroundandfindout
https://www.youtube.com/shorts/6ALRRksc72M

You were provable the first idiot, posting
stupid comments into my posts, besides of

course Micro Penis, who is a paid troll.

Have Fun!

Bye

Ross Finlayson schrieb:

For dummies, ....

Mild Shock schrieb:

Hi,

I don't use Rust, you are crazy. First of
all the parallel simulator is 100% written
in Prolog, should also run in ISO Prolog,

enhanced by a library(lists). Second I only
mentioned that WebGPU / WGSL, the language
there has a Rust inspired language.

Its not Rust. Whats wrong with you? Why do
you adress your weariness of life to me.
I am neither thief, nor can I help you

with your frustration, and histeric outbursts.
Maybe just be a man and jump off a bridge, idiot.
Or tame your frustration, usenet is not for

you alone, your stupid asshole.

Bye

Ross Finlayson schrieb:

https://www.theregister.com/databases/2026/07/29/after-rewriting-sqlite-in-rust-turso-turns-its-sights-on-postgres/5279835

I don't much care about Rust.

.. gibberish ..

Thief.

--- Synchronet 3.22a-Linux NewsLink 1.2

From Newsgroup: comp.lang.c

On 30/07/2026 10:24 PM, Ross Finlayson wrote:

On 07/30/2026 06:59 AM, Ross Finlayson wrote:

Decades ago when at the university I had a job working
for the biology department and what it was was making a graphical
front-end in Java to launch BLAST gene-sequence search on what
had as about 48 units / 96 cores Sun Silicon Grid Engine MPI cluster,
of Apple pizza boxes with PowerPC cores, then that also I wrote some
code for matching sequences with splitting the input and running the
cluster on the input files and chewing that up, sequences of human DNA
about 9 gigabytes, "seq-reader".

I made a simple dialog with making the command line arguments
for BLAST to launch, then added a features to increase or decrease
the font, that really blew their mind, these days it's often found
with "Shift-plus and Shift-minus".

Java's my main, if I know anything, that's what I know.

https://github.com/mailund/stralg

Mailund's string algorithm routines for FASTA files,
it's something to comprehend.

I did not look at this repository in detail, and will just con-
tinue to read the book /String Algorithms in C/ when I feel the
need.

Hold on, time for some more Pepsi before we continue.

More recently the data files were often the old COBOL
or mainframe output, line-data pipe-delimited, then
having a facility with mmap and then figuring out how
to chunk it up and detect lines and then make for
processing the chunks, for example sorting the rows
of a group according to composite keys, in-place,
these are usual sorts of accounts.

I've dealt with DBaseIII files recently. This format is still used
by commercial point of sale products, and is well worth understanding
when you find yourself working for /real business/ instead of some fake computer business.

The way I like to deal with columnar and tabular data
in text data files is as of a sort of "Tractable TSV",
since the data mostly never includes tab, the control
character and also horizontal whitespace, that TSV is
easier than CSV, then furthermore for nulls in the database
to emit at-sign, and for empty strings in the database to
emit tilde, since those are never the values to make for
"reserved characters" vis-a-vis "escape characters",
then Tractable-TSV or TSV is a nice simple ad-hoc format,
for text-data files on the order of gigabytes.

I tend to dump data into a database. If smol, then SQLite, if large,
then PostgreSQL, and if huge, TimescaleDB + Postgres with or without
sharding.

Then I let the SQL handle the /tabular data/ for me.

Which is as large as they get, ....

ETL workflows and so on.

It's remarkable that most all the data is ASCII,
or as about ISO 8859-15 <-> Microsoft CP-1252, being
ubiquitous, then as with regards to "UTF-8 everywhere",
that FASTA files have (mostly) four letters in their alphabet.

The commercial software I dealt with -- I forgot the name so there will
be no free advertisement for it -- exclusively exported CP-1252. Fortu- nately, it's still easy to find software willing to do this conversion
even if you don't rely on a Microsoft platform.

Writing a JSON and YAML parser is about the same thing,
and it's been done before, and a fast one, also.
XML is considered a bit more mature.

I've used Expat for parsing XML in C, and Jansson for the JSON. I don't particularly like Jansson, but it's not horrible and does the job.

Then, making for "composable grammars" or these days
I suppose they call them the "polyglot" parsers,
it's not unusual. Yet, the usual descriptions for
grammars, with all the usual guarantees about the
formal automata, has that there's a layer between
the syntactical and semantical as it were that's
permeable in the accounts of, for example, balanced
pairs of parentheses and the like, optional together,
that are syntactical.

I admit I've only used PEG in Lua with LPEG, and then Yacc, Reflex in
recent years when other people go for Bison and Flex. John Levine's
book about Flex & Bison is good enough for the basics, and those basics
still apply when using Yacc and Reflex.

On the other hand, if you wish to parse natural languages in C, my go-to
tool is /Link Grammars/, and this tool is sufficiently obscure that I'll
link to the original. You can also find a "continuation" of it inside
the Abiword sources, if you can find them; seems my bookmarks are no
longer current.

https://www.link.cs.cmu.edu/link/

I took out comp.lang.java as that language is no longer relevant, and
added comp.edu.languages.natural for the natural language parsing in C.


Best wishes, and happy linking your grammars!
--
Johann | email: invalid -> com | http://www.myrkraverk.com/blog/
I'm not from the Internet, I just work there. | via Easynews.com https://bsky.app/profile/myrkraverk.bsky.social
--- Synchronet 3.22a-Linux NewsLink 1.2

From Newsgroup: comp.lang.c

On 31/07/2026 12:23 AM, Ross Finlayson wrote:

One might suggest that the "Java Trails" tutorials and "Core Java"
and "Java in a Nutshell" would give an authentic introduction that
were new then and old now, and correct, if not "current", then and now.

https://docs.oracle.com/javase/tutorial/

Thank you. I've begun to create my own Java course, slightly based on
the material in the Java trail. I feel there's a lot to cover for
absolute beginners, so I'll take it slowly and write my own intro-
duction.

For something like C++, my first link would be
"https://cppreference.com", usually. Then after
the tutorials there is only API javadoc the API documentation,
which is also surfaced in the IDE's.

Well, my first inclination is to reach up to /Effective Modern C++/ by
Meyers, on my shelf; and then Stroustrup's 4th edition if I can be
bothered to read him again. I think I prefer the 3rd edition anyway.

Java11 and C++ 11 are probably appropriate baselines.

I've programmed in both Swing and Win32, more low-level than high-level, Java's worker threads and sychronization utilities
vis-a-vis Win32's message-pump and message-crackers and the user-defined pointer in the HWND's MSG, make for various
accounts then for things like OLE/OLE2/COM/DCOM/ActiveX
as about the .NET IL ASM CLR runtime with C#, VB.NET, F#,
C/C++, and so on.

Well, as you've no doubt noticed, I've added Turbo Vision to my reper-
toire of GUI toolkits recently. My personal go-to toolkit in C, is IUP.

That's also sufficiently obscure that I'll link the original.

https://iup.sourceforge.net/

Note that if you're using Open Watcom -- at least the 1.9 edition from openwatcom.org, you can just use the 32bit binaries for Visual Studio.

You don't have to compile your own. The C linkage hasn't changed, and
these two compilers are fairly compatible.

I offhand don't know about
Digital Mars, nor Pelle's C; but if you have 32bit editions of either,
it'll probably work. I have no idea, nor expectations that GCC and/or
clang will work with that build.

It'll be interesting to know if anyone here has experimented with this
build of IUP and the Borland 5.5 free command line compiler, and/or
a more recent build from Embarcadero.

I'll also be interested to know about even more obscure C compilers that
work on the Windows platform.


About runtimes, I'm still in the Java part of /Crafting Interpreters/,
it seems I forgot to continue that course, so thank you for reminding me
about it. I have the feeling the 2nd part in C will cover building my
own runtime. Well, for some value of "my own."


Have you ever built your own programming language environment with a new runtime in C?
--
Johann | email: invalid -> com | http://www.myrkraverk.com/blog/
I'm not from the Internet, I just work there. | via Easynews.com https://bsky.app/profile/myrkraverk.bsky.social
--- Synchronet 3.22a-Linux NewsLink 1.2

From Newsgroup: comp.lang.c

On 31/07/2026 11:36 PM, Ross Finlayson wrote:

On 07/31/2026 08:07 AM, Johann 'Myrkraverk' Oskarsson wrote:

On 31/07/2026 12:36 AM, Ross Finlayson wrote:

On 07/30/2026 09:23 AM, Ross Finlayson wrote:

On 07/30/2026 08:19 AM, Johann 'Myrkraverk' Oskarsson wrote:

On 30/07/2026 9:59 PM, Ross Finlayson wrote:

On 07/30/2026 06:20 AM, Johann 'Myrkraverk' Oskarsson wrote:

On 30/07/2026 4:47 AM, Ross Finlayson wrote:

Thanks for writing. Good luck with that.

Now, if we attain to some decorum, that would be refreshing.

Yes, that indeed would be refreshing.-a I'll refresh myself with some >>>>>>> Pepsi
before continuing this followup, hold on.

I "know" Java and am familiar with C/C++, and computer engineering. >>>>>>>

I just claim I know nothing, and do things anyway.-a I didn't know >>>>>>> how
to parse the Intel Hex file format, before I added a "binary" loader >>>>>>> to the Mars MIPS emulator.-a You know, the one written in Java.

It's not finished, but I have the basics down, and should be able to >>>>>>> load and run "binaries" with it soon.-a I'll probably post
screenshots
and they'll be hosted on Dropbox, so some of the other regulars >>>>>>> won't
look.-a That's on them.

Then, here the "Viswath & Charmaigne" is for the idea that there >>>>>>>> are generous, usual sorts of algorithms, here "findings" and
"matchings", that can be implemented vector-wise scalar-word,
then that for things like: libc, POSIX tools, parsers, and
so on, or as among "text-utils", and for character handling,
that much like many of the distributions like Linux, FreeBSD,
and so on, have developed and released and made in their tree
the vectorized versions of string functions, that, there are
abstract models of regular "text algos" that make sense for
all modern commodity architectures in their default configuration, >>>>>>>> for the system libraries and default toolset. For example, most >>>>>>>> all of "text-utils" involves "findings" and "matchings", in a >>>>>>>> sense,
then as with regards to "sorting" and "translation" or
"transformation",
which is not addressed.

So I gather you're interested in algorithms that "parallel" with >>>>>>> SIMD
and other vector machinery?-a And you mention "text-utils."-a Have you >>>>>>> read /String Algorithms in C/ by Mailund?-a He goes into the nitty >>>>>>> gritty
details of string matching -- and you can trivially translate the >>>>>>> code
to any other programming language as you learn from the book -- in >>>>>>> the
context of DNA matching.-a At least that's how I remember the book. >>>>>>> The
/about the author/ blurb at the start mentions he's a professor of >>>>>>> bio-
informatics so that seems like a true memory.-a I'll want to read the >>>>>>> book again soon.

In any case, there are algorithms, string search amongst them, that >>>>>>> seem
eminently serial, and I'm not quite sure SIMD and related extensions >>>>>>> are
immediately applicable.-a And now I'm sure there are people -- and >>>>>>> LLMs
-- just itching to "correct me" about that.-a Let them, they don't >>>>>>> bother
me.

The mentioned initialisms are, or were, awful sci.math trolls.

In the mean time, I've gathered a few names here in comp.lang.c that >>>>>>> I'll
probably never reply to ever again.-a They know who they are.

Thanks for the book reference, I'll look to it.


Decades ago when at the university I had a job working
for the biology department and what it was was making a graphical
front-end in Java to launch BLAST gene-sequence search on what
had as about 48 units / 96 cores Sun Silicon Grid Engine MPI cluster, >>>>>> of Apple pizza boxes with PowerPC cores, then that also I wrote some >>>>>> code for matching sequences with splitting the input and running the >>>>>> cluster on the input files and chewing that up, sequences of human >>>>>> DNA
about 9 gigabytes, "seq-reader".

I made a simple dialog with making the command line arguments
for BLAST to launch, then added a features to increase or decrease >>>>>> the font, that really blew their mind, these days it's often found >>>>>> with "Shift-plus and Shift-minus".

Java's my main, if I know anything, that's what I know.

Now I'm deep in Swing GUI.-a I had hoped to finish my Intel Hex loader >>>>> before replying, but as I uncommented more of my lines, I ran into
another null pointer exception.-a Turns out the GUI code expects to
find labels in the program, and in my binary there are no labels.

And to bother people bothered by cross postings, I'll continue.

I'm also working an a feature where the MIPS program can access a
"real" terminal.-a For now, and the convenience of people who don't
own a VT520,[1] I'm hooking it up to Putty.-a It turns out Java cannot >>>>> create a named pipe in Windows.-a So I did that part in C using
JNI.-a At
a guess, that's easier than using the /more modern/ Java foreign
function interface, since I don't have to #include <windows.h> in the >>>>> surrounding Java code.

Anyway, I'm now at the part where I have successfully sent and
received
a single byte from Putty, via named pipe hosted by the JVM.-a The next >>>>> part of the task is to use that code to make a Mars /tool/ that hooks >>>>> into the MIPS virtual machine and acts more or less like a physical
UART
with interrupts.

That's probably going to have to be with a reader and writer
background
threads, because Java doesn't have a concept of nonblocking reads nor >>>>> writes for RandomAccessFiles.-a Though full disclosure, I'm not too >>>>> sure
about that, because I've seen some people talking about channels and >>>>> checking if something is .available().-a That doesn't apply to me
anyway
because I'm using the raw Win32 ReadFile() and WriteFile() calls in
blocking mode.

And once that's done, I'll have to teach myself how to write MIPS
exception handlers.-a That'll be fun.

Now, on the other hand, since my gf is starting to learn Java too, do >>>>> you have any words of wisdom for newbies?-a I taught her "hello world," >>>>> then the Swing "hello world," and then showed her how she can skip all >>>>> that with the WindowBuilder in Eclipse.

What do you suggest as the next step, because she'll be looking for
employment in a few months when she's confident enough?



[1] Plus, I'm not sure mine will work without some sort of
maintenance.
-a-a-a-a It'll be a pleasant surprise if it works next time I turn it on. >>>>> --
Johann | email: invalid -> com | http://www.myrkraverk.com/blog/
I'm not from the Internet, I just work there. | via Easynews.com

One might suggest that the "Java Trails" tutorials and "Core Java"
and "Java in a Nutshell" would give an authentic introduction that
were new then and old now, and correct, if not "current", then and now. >>>>
https://docs.oracle.com/javase/tutorial/

I'll take a look at those.-a I didn't think of using those as a teaching
material before.-a I've just gone through some programs I've written
myself, sort of, so far.

For something like C++, my first link would be
"https://cppreference.com", usually. Then after
the tutorials there is only API javadoc the API documentation,
which is also surfaced in the IDE's.


Java11 and C++ 11 are probably appropriate baselines.

I tend to tell newbies to learn approximately C++98, then move on to a
project, and learn the rest on the go.-a Some people have a problem with
that advice, and think I'm telling people to stop learning after C++98.

They have a reading comprehension problem.

For the usual APIs written in C++, C++98 is sufficient anyway.

I've programmed in both Swing and Win32, more low-level than high-
level,
Java's worker threads and sychronization utilities
vis-a-vis Win32's message-pump and message-crackers and the user-
defined
pointer in the HWND's MSG, make for various
accounts then for things like OLE/OLE2/COM/DCOM/ActiveX
as about the .NET IL ASM CLR runtime with C#, VB.NET, F#,
C/C++, and so on.

I sometimes wonder if I should implement my own COM.-a I forgot about it
before, but I do have the /Inside COM/ book, for that purpose.

I leafed through all the Windows 7 sources before,
at work working on Windows, one task I had was to
implement highlighting "Find..." matches in the UI,
I added to highlight all the matches by using the font
metrics and some calculations and a palette, within a
few years it was part of the usual UI experience in
according to things like the "Win32 UI Guidelines/Principles",
similarly to how font-scaling later became ubiquitous,
simply because those are useful features. Before "ribbons",
or, "progressive affordance in UX/UI" and all that there were
common UI design outlines. Here there's a notion of a
"Light User Interface" experience or "LUI" that then happens
to have renderings in "HTML forms" and the like.


Yes, I also know "Angular/React and SPA frameworks,
in JavaScript and TypeScript".

That's interesting.-a I've almost never done user interfaces at a job.

I've mostly been a database, performance, backend, middleware and even
a kernel guy once.

I tried to debug a core dump of FreeBSD once, but the kernel that dumped
wasn't the most recent, and I didn't have the "budget" to build a custom
kernel from a few updates ago to get the debugging symbols, and gave up.

I've heard Microsoft behaved similarly, and overwrite their debugging
symbols.-a I hope it's been fixed, because I believe that was a "bug."

And I've mostly managed to avoid jobs and projects that involve
JavaScript.


Have a nice day!

No man is an island, and any language has its models.

Well, no. Hmm, I thought I had answered a JavaScript question on Stack Overflow in a way that suggested the JavaScript runtime environment was
buggy, and had been buggy ever since inception. And that any "Ecma-
Script Standard" had failed to correct it.

I don't remember the details very well; I'm not a JavaScript guy. I
just read a bit here and there, and based on /Principes d'Implantation
de Scheme et Lisp/, this shouldn't be able to happen unless the environ-
ment code in the runtime is buggy.

I don't know if that answer has been deleted by moderators, or is on
some sister site to Stack Overflow. In either case, I don't find it
in my list of my own answers.

There's a usual sense of the decorum and the etiquette
the "obligatory", abbreviated in some slang some decades
ago as the "ob", alike the "obquote" or otherwise "topicality",
with the idea being that threads are mostly their own space.

I'm not sure slang and decorum is the same thing. In any case, decorum
is about people having peaceful and informative discussions, such as
is currently happening between the two of us.

You mention things that educate me, and I hope to return the favour.

The joke about Rust and people saying "use Rust because it's
efficient and it's safe", then the "how's it efficient and
safe" then the "it's efficient by not being safe and safe by
not being efficient", reflects on "compromise" vis-a-vis
"decision", in tradeoffs. Then today's is about CISC and
RISC, and it's that CISC has complicated instructions and
RISC has reduced instruction, yet CISC has reduced operands
and RISC has complicated operands.

I believe I noticed this as early as 2016, that the Rust people
didn't understand what they were doing. They genuniely believed
that changing the textual representation of algorithms, namely
replace C with Rust, would make the world a better place.

I have found the annoying bugs that crop up every now and then in
Firefox because of the /Great Rust Rewrite/ to be a practical re-
minder of the opposite.

Then, making a deconstructive and reflective account, then
how that applies to C/C++, which I tend to club together,
since at some point a C++ program will rely on C linkage,
or the system libraries, is that C++ has a great account
of being efficient, while being safe.

I tend not to mix C and C++, because I practice -- well in this
case quite literally -- making the compilers. I just practice
slowly, and methodically, and am not in a hurry to learn how to
do this.

About C++ 03, since it has templates, traits,and RTTI,
then as with regards to allocator copy and move semantics, is
that it's a long time between C++03 and C++11, and there's
something to be said for move semantics yet besides what's
where C++03 was the standard, that though, C++98 was the
standard,

C++98 had templates, traits and RTTI, I believe. Though I'm not sure
about these /traits/, I forgot what it is.

Pre standard C++ had templates and RTTI if I'm not mistaken, as well.

yet then the finalizations of C99 about ILP
and the state of the 64-bit world, sort of results that
then Java8 and C++03 with at least parts of C99 is a sort
of reasonable profile of the language. Then the idea that
Java11 and C++11 and C11 all go together, more or less,
with the idea that C++ makes for some improved allocation,
references and pointers and ownership or copies and moves,
and so on, while Java11 is modern in the world of modules,
and C11 is because that's C's and the system's business,
then the syntactic sugar of later accounts like "triple
quotes" or all the various derivatives of the language
or "little languages" or "domain-specific languages",
these are considered not necessarily compelling then
as with regards to that I'm not the biggest fan of
"var" or "auto" since I see the code in front of me
and like to see its type. Then the account of "concepts"
in C++ with regards to type-safe compile-time interfaces
as a complement to "templates", I think that's a good idea,
about the commonalities in features of strongly-typed
languages like C++ and Java, where the theory of types
and type inference makes for the greatest safety in code,
according to guarantees the compiler may offer, though
there's always the PBKAC, "problem between keyboard
and chair". C++98 is the state of the world in Y2K.

My biggest regret, with C++, because I used to love this pro-
gramming language, is that they broke Stroustrup's promise from
the 3rd edition. C++ has, over the decades, become harder and
harder for both compilers and people to comprehend, and by the
same C++ token, harder to teach.

I cannot in good conscience recommend this programming language
for first semester students. It's much better to start with Java,
and have a garbage collector from the get go.

Accounts of etiquette and decorum may be refreshing,
it's like Chivalry: chivalry isn't dead, it's just
curled up in the corner weakly kicking with
conversation & courtesy.

Well, we can always revive the chivalry. You, me, a couple of
swords, and some written code should be all it takes.

That said then it's agreeable that matters of "topicality"
are germane, relevant, apropos, for a collegiate atmosphere.

Conversations between people have an ebb and flow. It's how we
socialize and this is a strength, not a weakness. Just partaking
in a conversation between experienced people can educate the new-
comers in ways they never expected.

And never underestimate the power of having social contacts. That's
how we navigate life, and people who throw away their social contacts
because they don't "fit" anymore, are most likely psychopaths.

Note: I'm not thinking of anyone here in comp.lang.c, but a real life experience I would much rather have avoided. Even suspecting people
you've known for years to be psychopaths is not a nice feeling.

So, "C11, C++11, Java11, it goes up to 11", is a
reasonable, modern, and largely well-understood,
language profile.

I didn't expect to stop counting at eleven, but I'll take your
word for it, and pay attention when we reach higher standards.


Have a nice C day, and may the wind keep your C++ sails taut.
--
Johann | email: invalid -> com | http://www.myrkraverk.com/blog/
I'm not from the Internet, I just work there. | via Easynews.com https://bsky.app/profile/myrkraverk.bsky.social
--- Synchronet 3.22a-Linux NewsLink 1.2

From Newsgroup: comp.lang.c

On 08/04/2026 07:15 PM, Johann 'Myrkraverk' Oskarsson wrote:

On 31/07/2026 12:23 AM, Ross Finlayson wrote:

One might suggest that the "Java Trails" tutorials and "Core Java"
and "Java in a Nutshell" would give an authentic introduction that
were new then and old now, and correct, if not "current", then and now.

https://docs.oracle.com/javase/tutorial/

Thank you. I've begun to create my own Java course, slightly based on
the material in the Java trail. I feel there's a lot to cover for
absolute beginners, so I'll take it slowly and write my own intro-
duction.

For something like C++, my first link would be
"https://cppreference.com", usually. Then after
the tutorials there is only API javadoc the API documentation,
which is also surfaced in the IDE's.

Well, my first inclination is to reach up to /Effective Modern C++/ by Meyers, on my shelf; and then Stroustrup's 4th edition if I can be
bothered to read him again. I think I prefer the 3rd edition anyway.

Java11 and C++ 11 are probably appropriate baselines.

I've programmed in both Swing and Win32, more low-level than high-level,
Java's worker threads and sychronization utilities
vis-a-vis Win32's message-pump and message-crackers and the user-defined
pointer in the HWND's MSG, make for various
accounts then for things like OLE/OLE2/COM/DCOM/ActiveX
as about the .NET IL ASM CLR runtime with C#, VB.NET, F#,
C/C++, and so on.

Well, as you've no doubt noticed, I've added Turbo Vision to my reper-
toire of GUI toolkits recently. My personal go-to toolkit in C, is IUP.

That's also sufficiently obscure that I'll link the original.

https://iup.sourceforge.net/

Note that if you're using Open Watcom -- at least the 1.9 edition from openwatcom.org, you can just use the 32bit binaries for Visual Studio.

You don't have to compile your own. The C linkage hasn't changed, and
these two compilers are fairly compatible.

I offhand don't know about Digital Mars, nor Pelle's C; but if you have 32bit editions of either,
it'll probably work. I have no idea, nor expectations that GCC and/or
clang will work with that build.

It'll be interesting to know if anyone here has experimented with this
build of IUP and the Borland 5.5 free command line compiler, and/or
a more recent build from Embarcadero.

I'll also be interested to know about even more obscure C compilers that
work on the Windows platform.

About runtimes, I'm still in the Java part of /Crafting Interpreters/,
it seems I forgot to continue that course, so thank you for reminding me about it. I have the feeling the 2nd part in C will cover building my
own runtime. Well, for some value of "my own."

Have you ever built your own programming language environment with a new runtime in C?

Agreeably, Meyers' C++ books were very solid,
and almost all the advice is sound. For a decade
they were basically required as part of code-style,
pretty much everything in them.

It's been quite a while since Borland was among the best available
compilers, what with Delphi and so on, or C/C++. Then, there was
djgpp and also Navia's lcc a C compiler, on Win32, these were
greatly appreciated, these days MinGW64. Then Visual C++ of
course was the premier environment. Kai, Wind River, wxWorks,
I don't know them.


I've never written a compiler yet have designed language.

When reading a book something like "Advanced Compiler Optimizations",
these days there's much of the e-graphs for re-write rules and the like,
about porting code besides mapping to concrete forms.

The term-rewriting and term-graph-rewriting accounts have a lot
going on, with basically the idea that anything can be written
or ported to any language. Porting code of course is of course
what they used to call it instead of "rewriting" the code.

Type theory and exercises in type of course have that there's a
great account for both the narrowing and widening, and inversions
of types and with regards to unions of types and so on,
then "Patterns" is its own and a great field, "Patterns"
since the '90's and object-orientation and the like,
are great ways of organizing routine, I'm quite a thorough
believer in abstraction of the domain objects and four facilities
like DB MQ FS WS the database, message-queue, file-system, and
web-services, these sorts of "four facilities" about "four resources"
CPU RAM DISK NET, "four surrounds", other sorts general categorizations
of all the things, I have an ideology.

Experience in the distributed-systems environment or the dot-com
world or the enterprise, I like to think that I've read the
source code, and knew what it was. I've read tons of the code.

Then, the "glue logic" after Pareto law or 80/20 rule, there's
something to be said for the right hammer for the right nail,
these days awash in "bucket-o-dependency-paste".

There's something to be said for pure C++, while, inevitably
there's at least one macro, and inevitably at least one
"extern C", and inevitably at least one import of a C header,
usually with the goal of wrapping that directly in C++
and hiding and safing the acquire/release, then about
"single abstract methods", vis-a-vis, "related functions",
then for "lambdas", as a simplfied account of "function pointers",
while though I still believe in "callbacks" instead of "async".
I do tend to think of things more as pointers than as objects in the
scope. Java's objects are kind of more like pointers than C++'s objects,
with always new/delete, and smart pointers and unique_pointer.



Thanks for writing, good luck with your endeavors.



--- Synchronet 3.22a-Linux NewsLink 1.2

From Newsgroup: comp.lang.c

Hi,

They are the same:

Performance of the Cray T3D
https://arxiv.org/abs/hep-lat/9509003v1

GPU Backend: Find 0xCAFFEE with -C-WAM
https://medium.com/2989/8890efd3503c

Both Cray T3D as installed at PSC, and
the on chip GPU of my Ryzen AI 7 350
w/ Radeon 860M Laptop for ca. 1000 CHF.

they both have MIMD (Multiple instruction,
multiple data) and 512 PE (Processing Elements).
Quite amazing what happend in 30 years of

Very-large-scale integration (VLSI).

LoL

Bye

Mild Shock schrieb:

Hi,

You are still chewing on SIMD. LoL

Ross Finlayson schrieb:

Then the idea is that any of those can be found and matched in
one "run", i.e. a stall-less, branch-less, call-less list of less than
a few or less than a few dozens or less than a few hundreds
instructions, the results "findings" in data and corresponding
"matchings" of expressions, that runs in less than one microsecond.

You cannot make the mental translation that if you have:

Ross Finlayson schrieb:

So, the context then is for register state and stack contents, that
the indicators of the above as "positive presence" then is to make
for that the adjustments to the offsets and extents and the shifts
is according to those, otherwise no-ops. Then the idea is that a

As independent logical thread state, that automatically MIMD follosw?

Whats the problem to solve then?

Bye

--- Synchronet 3.22a-Linux NewsLink 1.2

From Newsgroup: comp.lang.c

On 8/4/2026 11:31 PM, Ross Finlayson wrote:
[...]

Agreeably, Meyers' C++ books were very solid,
and almost all the advice is sound. For a decade
they were basically required as part of code-style,
pretty much everything in them.[...]

Fwiw, I had the joy of being able to converse with Scott over in comp.programming.threads back in the day.

(imvvho, a good thread to read all off when you have some time to burn) https://groups.google.com/g/comp.programming.threads/c/KepRbFWBJA4/m/uEQYE9sfji0J


I posted as SenderX for a while before I used my real name.
--- Synchronet 3.22a-Linux NewsLink 1.2

From Newsgroup: comp.lang.c

On 08/05/2026 12:42 PM, Chris M. Thomasson wrote:

On 8/4/2026 11:31 PM, Ross Finlayson wrote:
[...]

Agreeably, Meyers' C++ books were very solid,
and almost all the advice is sound. For a decade
they were basically required as part of code-style,
pretty much everything in them.[...]

Fwiw, I had the joy of being able to converse with Scott over in comp.programming.threads back in the day.

(imvvho, a good thread to read all off when you have some time to burn) https://groups.google.com/g/comp.programming.threads/c/KepRbFWBJA4/m/uEQYE9sfji0J

I posted as SenderX for a while before I used my real name.

About "Effective C++" and "More Effective C++", about
through "Effective C++" and about 2/3 through "More Effective C++"
is considered a glossary and methodology, an opinion and an approach,
then that later accounts of Meyers, interesting, are a bit out-there, as
it were. Then there's a sort of "Effective Java" or Josh Bloch, also considered pretty sound an opinion as well, take it or leave it.

"Code-style" beyond the cosmetic, for patterns and practices or
ye olde "best practices", is for a structured approach and an
object-oriented approach, since whatever functional or procedural,
or the imperative languages, abstractly always have those as models
of the routines, then for example about the functional model of
procedural languages and the procedural model of functional languages,
and so on.

I've always (and only) posted as myself.


--- Synchronet 3.22a-Linux NewsLink 1.2

From Newsgroup: comp.lang.c

On 8/5/2026 1:24 PM, Ross Finlayson wrote:

On 08/05/2026 12:42 PM, Chris M. Thomasson wrote:

On 8/4/2026 11:31 PM, Ross Finlayson wrote:
[...]

Agreeably, Meyers' C++ books were very solid,
and almost all the advice is sound. For a decade
they were basically required as part of code-style,
pretty much everything in them.[...]

Fwiw, I had the joy of being able to converse with Scott over in
comp.programming.threads back in the day.

(imvvho, a good thread to read all off when you have some time to burn)
https://groups.google.com/g/comp.programming.threads/c/KepRbFWBJA4/m/
uEQYE9sfji0J



I posted as SenderX for a while before I used my real name.

About "Effective C++" and "More Effective C++", about
through "Effective C++" and about 2/3 through "More Effective C++"
is considered a glossary and methodology, an opinion and an approach,
then that later accounts of Meyers, interesting, are a bit out-there, as
it were.-a Then there's a sort of "Effective Java" or Josh Bloch, also considered pretty sound an opinion as well, take it or leave it.

"Code-style" beyond the cosmetic, for patterns and practices or
ye olde "best practices", is for a structured approach and an
object-oriented approach, since whatever functional or procedural,
or the imperative languages, abstractly always have those as models
of the routines, then for example about the functional model of
procedural languages and the procedural model of functional languages,
and so on.

I've always (and only) posted as myself.

My only alias was SenderX back in the early days wrt my usenet presence.
--- Synchronet 3.22a-Linux NewsLink 1.2

From Newsgroup: comp.lang.c

On 08/05/2026 01:24 PM, Ross Finlayson wrote:

On 08/05/2026 12:42 PM, Chris M. Thomasson wrote:

On 8/4/2026 11:31 PM, Ross Finlayson wrote:
[...]

Agreeably, Meyers' C++ books were very solid,
and almost all the advice is sound. For a decade
they were basically required as part of code-style,
pretty much everything in them.[...]

Fwiw, I had the joy of being able to converse with Scott over in
comp.programming.threads back in the day.

(imvvho, a good thread to read all off when you have some time to burn)
https://groups.google.com/g/comp.programming.threads/c/KepRbFWBJA4/m/uEQYE9sfji0J




I posted as SenderX for a while before I used my real name.

About "Effective C++" and "More Effective C++", about
through "Effective C++" and about 2/3 through "More Effective C++"
is considered a glossary and methodology, an opinion and an approach,
then that later accounts of Meyers, interesting, are a bit out-there, as
it were. Then there's a sort of "Effective Java" or Josh Bloch, also considered pretty sound an opinion as well, take it or leave it.

"Code-style" beyond the cosmetic, for patterns and practices or
ye olde "best practices", is for a structured approach and an
object-oriented approach, since whatever functional or procedural,
or the imperative languages, abstractly always have those as models
of the routines, then for example about the functional model of
procedural languages and the procedural model of functional languages,
and so on.

I've always (and only) posted as myself.

Back in the 1980's a close friend had a Commodore, a phone line,
and a modem, and another a Commodore, a modem, and _two_ phone lines,
which was considered extravagant, while allowing the modem to be
on-line while making and taking telephone calls, upon which they
had a "bulletin-board-system", fondly known as a BBS, upon which
they traded brief files of hacking manuals, cook-books, and crude erotica.

So, that was probably my first experience with "login" and "alias",
not to be confused with "cisco and radius", and "admin", not to be
confused with "identd and ppp", then my first admin alias, and one may
aver my last, was "The Faceless One", who like an adolescent before
learning to be honest, was on a power-trip. That character is
characterized as a dick, a stalker, and a leech, and a bit of a troll,
if not so much a lurker, and simply not a regular.

Some people never outgrow that phase.


Of course I'm often "root", or "sa", yet mostly just "r",
and while I understand the utility of hypervisors and virts,
am pretty much against them rooting people.


Anyways, "The Faceless One" is a sort of operator, frozen in time.

FinnEcces / 12ende12 <- world-ranked < 1000 from time to time

Those "games" were decades ago, while though these days
I can still pass Civ VI on "immortal/marathon/ancient/huge",
and even "deity" difficulty with the luck of the draw,
as brings memories of "Archon" and "Populous".


dib dib dib / dob dob dob



--- Synchronet 3.22a-Linux NewsLink 1.2

From Newsgroup: comp.lang.c

On 08/04/2026 11:31 PM, Ross Finlayson wrote:

On 08/04/2026 07:15 PM, Johann 'Myrkraverk' Oskarsson wrote:

On 31/07/2026 12:23 AM, Ross Finlayson wrote:

One might suggest that the "Java Trails" tutorials and "Core Java"
and "Java in a Nutshell" would give an authentic introduction that
were new then and old now, and correct, if not "current", then and now.

https://docs.oracle.com/javase/tutorial/

Thank you. I've begun to create my own Java course, slightly based on
the material in the Java trail. I feel there's a lot to cover for
absolute beginners, so I'll take it slowly and write my own intro-
duction.

For something like C++, my first link would be
"https://cppreference.com", usually. Then after
the tutorials there is only API javadoc the API documentation,
which is also surfaced in the IDE's.

Well, my first inclination is to reach up to /Effective Modern C++/ by
Meyers, on my shelf; and then Stroustrup's 4th edition if I can be
bothered to read him again. I think I prefer the 3rd edition anyway.

Java11 and C++ 11 are probably appropriate baselines.

I've programmed in both Swing and Win32, more low-level than high-level, >>> Java's worker threads and sychronization utilities
vis-a-vis Win32's message-pump and message-crackers and the user-defined >>> pointer in the HWND's MSG, make for various
accounts then for things like OLE/OLE2/COM/DCOM/ActiveX
as about the .NET IL ASM CLR runtime with C#, VB.NET, F#,
C/C++, and so on.

Well, as you've no doubt noticed, I've added Turbo Vision to my reper-
toire of GUI toolkits recently. My personal go-to toolkit in C, is IUP.

That's also sufficiently obscure that I'll link the original.

https://iup.sourceforge.net/

Note that if you're using Open Watcom -- at least the 1.9 edition from
openwatcom.org, you can just use the 32bit binaries for Visual Studio.

You don't have to compile your own. The C linkage hasn't changed, and
these two compilers are fairly compatible.

I offhand don't know about
Digital Mars, nor Pelle's C; but if you have 32bit editions of either,
it'll probably work. I have no idea, nor expectations that GCC and/or
clang will work with that build.

It'll be interesting to know if anyone here has experimented with this
build of IUP and the Borland 5.5 free command line compiler, and/or
a more recent build from Embarcadero.

I'll also be interested to know about even more obscure C compilers that
work on the Windows platform.


About runtimes, I'm still in the Java part of /Crafting Interpreters/,
it seems I forgot to continue that course, so thank you for reminding me
about it. I have the feeling the 2nd part in C will cover building my
own runtime. Well, for some value of "my own."


Have you ever built your own programming language environment with a new
runtime in C?

Agreeably, Meyers' C++ books were very solid,
and almost all the advice is sound. For a decade
they were basically required as part of code-style,
pretty much everything in them.

It's been quite a while since Borland was among the best available
compilers, what with Delphi and so on, or C/C++. Then, there was
djgpp and also Navia's lcc a C compiler, on Win32, these were
greatly appreciated, these days MinGW64. Then Visual C++ of
course was the premier environment. Kai, Wind River, wxWorks,
I don't know them.

I've never written a compiler yet have designed language.

When reading a book something like "Advanced Compiler Optimizations",
these days there's much of the e-graphs for re-write rules and the like, about porting code besides mapping to concrete forms.

The term-rewriting and term-graph-rewriting accounts have a lot
going on, with basically the idea that anything can be written
or ported to any language. Porting code of course is of course
what they used to call it instead of "rewriting" the code.

Type theory and exercises in type of course have that there's a
great account for both the narrowing and widening, and inversions
of types and with regards to unions of types and so on,
then "Patterns" is its own and a great field, "Patterns"
since the '90's and object-orientation and the like,
are great ways of organizing routine, I'm quite a thorough
believer in abstraction of the domain objects and four facilities
like DB MQ FS WS the database, message-queue, file-system, and
web-services, these sorts of "four facilities" about "four resources"
CPU RAM DISK NET, "four surrounds", other sorts general categorizations
of all the things, I have an ideology.

Experience in the distributed-systems environment or the dot-com
world or the enterprise, I like to think that I've read the
source code, and knew what it was. I've read tons of the code.

Then, the "glue logic" after Pareto law or 80/20 rule, there's
something to be said for the right hammer for the right nail,
these days awash in "bucket-o-dependency-paste".

There's something to be said for pure C++, while, inevitably
there's at least one macro, and inevitably at least one
"extern C", and inevitably at least one import of a C header,
usually with the goal of wrapping that directly in C++
and hiding and safing the acquire/release, then about
"single abstract methods", vis-a-vis, "related functions",
then for "lambdas", as a simplfied account of "function pointers",
while though I still believe in "callbacks" instead of "async".
I do tend to think of things more as pointers than as objects in the
scope. Java's objects are kind of more like pointers than C++'s objects,
with always new/delete, and smart pointers and unique_pointer.

Thanks for writing, good luck with your endeavors.

Then, writing the expression, nested expression, and that it's
to reverse-unroll to an instruction listing, brings the idea that
the equivalent functional/procedural forms have these implicit :

subscripts,
bounds,
arrangements,
cases,

that are then for the "typed, templating assembler language" the
idea that each input and output type has its array bounds and
widths and constituent words, then that the implication is to
derive the un-rolling of that, then for example where "v-texel"
is in a "vr-block" in a "vvr-block", more implicits for the reference
the accessor, that variables are accessors and functions are
interpolators, that the

accessors, as sources and destinations, or sources and sinks, and interpolators, that have some specialization for the types x dimensions,

then compose in a way that has a normal form as a code listing of
instructions, ..., so that then those are broken-out (enumerated)
and written-out.

So, to define FILL_VARIBYTE as

INSERTHILO( v-texel-varibyte, UTF8TAG(EXTRACTHILO(v-texel)))

is that it enumerates over hi and lo for EXTRACT and INSERT, and places
them back since they're aligned, skipping over that the UTF8TAG was
applied, which is applied to both hi and lo, each of its 8 bytes.

FILL_TEXEL_VARIBYTE (vr-texel, vr-texel-varibyte) =
EXTRACTHILO(vr-texel) . UTF8TAG . INSERTHILO(vr-texel-varibyte)

FILL_VR_VARIBYTE(vr-src, vr-dst) = EXTRACT(vr-src) . UTF8TAG .
INSERT(vr-dst)

Then, the context of an accessor, and contexts of EXTRACT and INSERT,
have that those are accessors,

FILL_VR_VARIBYTE(vr-src(vr-block-1), vr-dst(vr-block-1)) =
EXTRACT(vr-src) . UTF8TAG . INSERT(vr-dst)

has that accessors are making accessors, then for example, that "." is
both like concatenation, and, like dereference, where it were so that
the compilation off the declarations, generated (made derived) that in a higher-level language, it results a code-model, for a sort of "interpolating-interpreter", and a "functional language", that has a
natural form as a procedural language, if not so much vice-versa,
though, that it does, after invariants.

https://github.com/codereport/array-language-comparisons


So, to sort this out a bit, figure that there's an assembler language
with instruction listings, or a procedural language like "BASIC" or
something. Then, the idea is that accounts of loops are left out,
instead for accounts of "interpolations", interpolating from action to
action, with that the loops are implicit, and of fixed dimensions and un-rolled, then about that the operations: are dyadic usually with
two-many operands src/dst, yet they also have the implicit data-type its
width, and as it contains other data-types as a collection its length,
those being usually enough ratios of powers-of-two,
so that then when concatenating instructions or interpolators
(transformers), that between the poles of them are interpolated the instructions of the inner body, un-rolled, or for example when two
instructions are defined to be specialized through an outer body, the
implicits of that. So, width and length are relative, while, in
the actual data-types, constants.

This then would be key for writing the SIMD/SWAR, because the SIMD
functions would be the same as the SWAR, ..., and about how it goes that
then besides between operands of the same size/data-type/dimensions, are halving/doubling or insert/extract.

Then, why this is relevant to languages like Java or C++ or C, is that
the expressions like EXTRACT . UTF8TAG . INSERT, happen to look just
like field references, for what are structs of "interpolator bodies",
that then at compile-time, a recursive and exhaustive sort of building
up the declarations and definitions, can then result the simple sort of combinators I suppose, since the types are sort of simplified because
they're only data-types with relative-width and relative-length, and
signed or unsigned integer or floating-point definition in the
instruction sets, then that "re-write rules" or "template
specializations" can be written and found in the "recursive and
exhaustive" sort of compilation, these kinds of things.

LOAD_OR_AND_STORE(src, const, dst) = LOAD(src) . OR(const) . STORE(dst)

Then, this idea of an "accessors and interpolators" language, for
example, it's a sort of language. The idea is that interpolators are assignable, and then that's at compile-time, and results an instruction listing, that's fixed.




I just made that up so it's yet a sort of, "design of language",
and a description of a compiler, about "typed and templating
assembler".


--- Synchronet 3.22a-Linux NewsLink 1.2

From Newsgroup: comp.lang.c

On 06/08/2026 11:42 AM, Ross Finlayson wrote:

I just made that up so it's yet a sort of, "design of language",
and a description of a compiler, about "typed and templating
assembler".

Some of that read like brainstorming, other things read like output
from an L.L.M. I'm not sure you need me to comment on anything, as
it's your brainstorm. Am I wrong about that?


Happy brainstorming!
--
Johann | email: invalid -> com | http://www.myrkraverk.com/blog/
I'm not from the Internet, I just work there. | via Easynews.com https://bsky.app/profile/myrkraverk.bsky.social | for ( ;; ) _:;
--- Synchronet 3.22a-Linux NewsLink 1.2

From Newsgroup: comp.lang.c

On 05/08/2026 2:31 PM, Ross Finlayson wrote:

On 08/04/2026 07:15 PM, Johann 'Myrkraverk' Oskarsson wrote:

On 31/07/2026 12:23 AM, Ross Finlayson wrote:

One might suggest that the "Java Trails" tutorials and "Core Java"
and "Java in a Nutshell" would give an authentic introduction that
were new then and old now, and correct, if not "current", then and now.

https://docs.oracle.com/javase/tutorial/

Thank you.-a I've begun to create my own Java course, slightly based on
the material in the Java trail.-a I feel there's a lot to cover for
absolute beginners, so I'll take it slowly and write my own intro-
duction.

For something like C++, my first link would be
"https://cppreference.com", usually. Then after
the tutorials there is only API javadoc the API documentation,
which is also surfaced in the IDE's.

Well, my first inclination is to reach up to /Effective Modern C++/ by
Meyers, on my shelf; and then Stroustrup's 4th edition if I can be
bothered to read him again.-a I think I prefer the 3rd edition anyway.

Java11 and C++ 11 are probably appropriate baselines.

I've programmed in both Swing and Win32, more low-level than high-level, >>> Java's worker threads and sychronization utilities
vis-a-vis Win32's message-pump and message-crackers and the user-defined >>> pointer in the HWND's MSG, make for various
accounts then for things like OLE/OLE2/COM/DCOM/ActiveX
as about the .NET IL ASM CLR runtime with C#, VB.NET, F#,
C/C++, and so on.

Well, as you've no doubt noticed, I've added Turbo Vision to my reper-
toire of GUI toolkits recently.-a My personal go-to toolkit in C, is IUP.

That's also sufficiently obscure that I'll link the original.

-a-a https://iup.sourceforge.net/

Note that if you're using Open Watcom -- at least the 1.9 edition from
openwatcom.org, you can just use the 32bit binaries for Visual Studio.

You don't have to compile your own.-a The C linkage hasn't changed, and
these two compilers are fairly compatible.

-a-a-a-a-a-a-a-a-a-a-a-a-a-a-a-a-a-a-a-a-a-a-a-a-a-a-a-a-a-a-a-a-a-a-a-a-a-a-a-a-a-a-a-a I offhand don't know about
Digital Mars, nor Pelle's C; but if you have 32bit editions of either,
it'll probably work.-a I have no idea, nor expectations that GCC and/or
clang will work with that build.

It'll be interesting to know if anyone here has experimented with this
build of IUP and the Borland 5.5 free command line compiler, and/or
a more recent build from Embarcadero.

I'll also be interested to know about even more obscure C compilers that
work on the Windows platform.


About runtimes, I'm still in the Java part of /Crafting Interpreters/,
it seems I forgot to continue that course, so thank you for reminding me
about it.-a I have the feeling the 2nd part in C will cover building my
own runtime.-a Well, for some value of "my own."


Have you ever built your own programming language environment with a new
runtime in C?

Agreeably, Meyers' C++ books were very solid,
and almost all the advice is sound. For a decade
they were basically required as part of code-style,
pretty much everything in them.

At the moment, I have only the one. And of course Stroustrup that
nobody ever reads. I guess he lost it, and I haven't heard of any-
one recommend his book since the 3rd.

I hope I won't need more Meyers books before I start receiving pay-
checks.

It's been quite a while since Borland was among the best available
compilers, what with Delphi and so on, or C/C++. Then, there was
djgpp and also Navia's lcc a C compiler, on Win32, these were
greatly appreciated, these days MinGW64. Then Visual C++ of
course was the premier environment. Kai, Wind River, wxWorks,
I don't know them.

I've never written a compiler yet have designed language.

While I have had interest in the compiler technology, and never designed
a language.

When reading a book something like "Advanced Compiler Optimizations",
these days there's much of the e-graphs for re-write rules and the like, about porting code besides mapping to concrete forms.

I believe you mean /Optimizing Compilers for Modern Architectures/ by
Allen Kennedy; you seem to be to talking about the paper by David Padua
and Michael J. Wolfe -- which I haven't read.

The term-rewriting and term-graph-rewriting accounts have a lot
going on, with basically the idea that anything can be written
or ported to any language. Porting code of course is of course
what they used to call it instead of "rewriting" the code.

Yes, with enough effort, one can even process the binary code, put it
into graphs, convert to SSA, optimize, and collapse again into a diff-
erent binary code.

I believe that's what they do, when they run things under the Rosetta
stone, by the fruit vendor.

Type theory and exercises in type of course have that there's a
great account for both the narrowing and widening, and inversions
of types and with regards to unions of types and so on,
then "Patterns" is its own and a great field, "Patterns"
since the '90's and object-orientation and the like,
are great ways of organizing routine, I'm quite a thorough
believer in abstraction of the domain objects and four facilities
like DB MQ FS WS the database, message-queue, file-system, and
web-services, these sorts of "four facilities" about "four resources"
CPU RAM DISK NET, "four surrounds", other sorts general categorizations
of all the things, I have an ideology.

I've started to read books about type theory. At the core, it seems
to be a mathematical discipline about keeping meta data about the var-
iables we use in programming languages. If I'm mistaken about that,
I'm mistaken. I don't have these books here, and don't feel a pressing
need to buy 2nd copies.

Experience in the distributed-systems environment or the dot-com
world or the enterprise, I like to think that I've read the
source code, and knew what it was. I've read tons of the code.

I've mostly worked for the /smol/ companies, and by nature of my
skillset, almost exclusively worked alone or at best in a team of
two. This is a pattern that has repeated for the last 16 years, so
it's unlikely to change in the near future. Let's see what the new
job has for me. I haven't turned in the /pre-screening/ questionnaire
yet, but I have high hopes I'll pass everything.

Then, the "glue logic" after Pareto law or 80/20 rule, there's
something to be said for the right hammer for the right nail,
these days awash in "bucket-o-dependency-paste".

I'm not familiar with that. If you feel it's important, please let
me know.

There's something to be said for pure C++, while, inevitably
there's at least one macro, and inevitably at least one
"extern C", and inevitably at least one import of a C header,
usually with the goal of wrapping that directly in C++
and hiding and safing the acquire/release, then about
"single abstract methods", vis-a-vis, "related functions",
then for "lambdas", as a simplfied account of "function pointers",
while though I still believe in "callbacks" instead of "async".
I do tend to think of things more as pointers than as objects in the
scope. Java's objects are kind of more like pointers than C++'s objects,
with always new/delete, and smart pointers and unique_pointer.

I hope I won't get trapped by any of the new C++ features, in the new
job.

Yes, a lot of people get trapped by Java's pointers. It's very easy to
/leak memory/ in Java if one doesn't realize sometimes it's necessary to
null the pointers, and play well with the garbage collector.

Thanks for writing, good luck with your endeavors.

You too!
--
Johann | email: invalid -> com | http://www.myrkraverk.com/blog/
I'm not from the Internet, I just work there. | via Easynews.com https://bsky.app/profile/myrkraverk.bsky.social | for ( ;; ) _:;
--- Synchronet 3.22a-Linux NewsLink 1.2

From Newsgroup: comp.lang.c

On 08/06/2026 06:53 PM, Johann 'Myrkraverk' Oskarsson wrote:

On 05/08/2026 2:31 PM, Ross Finlayson wrote:

On 08/04/2026 07:15 PM, Johann 'Myrkraverk' Oskarsson wrote:

On 31/07/2026 12:23 AM, Ross Finlayson wrote:

One might suggest that the "Java Trails" tutorials and "Core Java"
and "Java in a Nutshell" would give an authentic introduction that
were new then and old now, and correct, if not "current", then and now. >>>>
https://docs.oracle.com/javase/tutorial/

Thank you. I've begun to create my own Java course, slightly based on
the material in the Java trail. I feel there's a lot to cover for
absolute beginners, so I'll take it slowly and write my own intro-
duction.

For something like C++, my first link would be
"https://cppreference.com", usually. Then after
the tutorials there is only API javadoc the API documentation,
which is also surfaced in the IDE's.

Well, my first inclination is to reach up to /Effective Modern C++/ by
Meyers, on my shelf; and then Stroustrup's 4th edition if I can be
bothered to read him again. I think I prefer the 3rd edition anyway.

Java11 and C++ 11 are probably appropriate baselines.

I've programmed in both Swing and Win32, more low-level than
high-level,
Java's worker threads and sychronization utilities
vis-a-vis Win32's message-pump and message-crackers and the
user-defined
pointer in the HWND's MSG, make for various
accounts then for things like OLE/OLE2/COM/DCOM/ActiveX
as about the .NET IL ASM CLR runtime with C#, VB.NET, F#,
C/C++, and so on.

Well, as you've no doubt noticed, I've added Turbo Vision to my reper-
toire of GUI toolkits recently. My personal go-to toolkit in C, is IUP. >>>
That's also sufficiently obscure that I'll link the original.

https://iup.sourceforge.net/

Note that if you're using Open Watcom -- at least the 1.9 edition from
openwatcom.org, you can just use the 32bit binaries for Visual Studio.

You don't have to compile your own. The C linkage hasn't changed, and
these two compilers are fairly compatible.

I offhand don't know about
Digital Mars, nor Pelle's C; but if you have 32bit editions of either,
it'll probably work. I have no idea, nor expectations that GCC and/or
clang will work with that build.

It'll be interesting to know if anyone here has experimented with this
build of IUP and the Borland 5.5 free command line compiler, and/or
a more recent build from Embarcadero.

I'll also be interested to know about even more obscure C compilers that >>> work on the Windows platform.


About runtimes, I'm still in the Java part of /Crafting Interpreters/,
it seems I forgot to continue that course, so thank you for reminding me >>> about it. I have the feeling the 2nd part in C will cover building my
own runtime. Well, for some value of "my own."


Have you ever built your own programming language environment with a new >>> runtime in C?

Agreeably, Meyers' C++ books were very solid,
and almost all the advice is sound. For a decade
they were basically required as part of code-style,
pretty much everything in them.

At the moment, I have only the one. And of course Stroustrup that
nobody ever reads. I guess he lost it, and I haven't heard of any-
one recommend his book since the 3rd.

I hope I won't need more Meyers books before I start receiving pay-
checks.

It's been quite a while since Borland was among the best available
compilers, what with Delphi and so on, or C/C++. Then, there was
djgpp and also Navia's lcc a C compiler, on Win32, these were
greatly appreciated, these days MinGW64. Then Visual C++ of
course was the premier environment. Kai, Wind River, wxWorks,
I don't know them.


I've never written a compiler yet have designed language.

While I have had interest in the compiler technology, and never designed
a language.

When reading a book something like "Advanced Compiler Optimizations",
these days there's much of the e-graphs for re-write rules and the like,
about porting code besides mapping to concrete forms.

I believe you mean /Optimizing Compilers for Modern Architectures/ by
Allen Kennedy; you seem to be to talking about the paper by David Padua
and Michael J. Wolfe -- which I haven't read.

The term-rewriting and term-graph-rewriting accounts have a lot
going on, with basically the idea that anything can be written
or ported to any language. Porting code of course is of course
what they used to call it instead of "rewriting" the code.

Yes, with enough effort, one can even process the binary code, put it
into graphs, convert to SSA, optimize, and collapse again into a diff-
erent binary code.

I believe that's what they do, when they run things under the Rosetta
stone, by the fruit vendor.

Type theory and exercises in type of course have that there's a
great account for both the narrowing and widening, and inversions
of types and with regards to unions of types and so on,
then "Patterns" is its own and a great field, "Patterns"
since the '90's and object-orientation and the like,
are great ways of organizing routine, I'm quite a thorough
believer in abstraction of the domain objects and four facilities
like DB MQ FS WS the database, message-queue, file-system, and
web-services, these sorts of "four facilities" about "four resources"
CPU RAM DISK NET, "four surrounds", other sorts general categorizations
of all the things, I have an ideology.

I've started to read books about type theory. At the core, it seems
to be a mathematical discipline about keeping meta data about the var-
iables we use in programming languages. If I'm mistaken about that,
I'm mistaken. I don't have these books here, and don't feel a pressing
need to buy 2nd copies.

Experience in the distributed-systems environment or the dot-com
world or the enterprise, I like to think that I've read the
source code, and knew what it was. I've read tons of the code.

I've mostly worked for the /smol/ companies, and by nature of my
skillset, almost exclusively worked alone or at best in a team of
two. This is a pattern that has repeated for the last 16 years, so
it's unlikely to change in the near future. Let's see what the new
job has for me. I haven't turned in the /pre-screening/ questionnaire
yet, but I have high hopes I'll pass everything.

Then, the "glue logic" after Pareto law or 80/20 rule, there's
something to be said for the right hammer for the right nail,
these days awash in "bucket-o-dependency-paste".

I'm not familiar with that. If you feel it's important, please let
me know.

There's something to be said for pure C++, while, inevitably
there's at least one macro, and inevitably at least one
"extern C", and inevitably at least one import of a C header,
usually with the goal of wrapping that directly in C++
and hiding and safing the acquire/release, then about
"single abstract methods", vis-a-vis, "related functions",
then for "lambdas", as a simplfied account of "function pointers",
while though I still believe in "callbacks" instead of "async".
I do tend to think of things more as pointers than as objects in the
scope. Java's objects are kind of more like pointers than C++'s objects,
with always new/delete, and smart pointers and unique_pointer.

I hope I won't get trapped by any of the new C++ features, in the new
job.

Yes, a lot of people get trapped by Java's pointers. It's very easy to
/leak memory/ in Java if one doesn't realize sometimes it's necessary to
null the pointers, and play well with the garbage collector.

Thanks for writing, good luck with your endeavors.

You too!

I'm a fan of Stroustrup, and have copies of both 3'rd and Special
editions. The Special edition does have some extended narrative,
and from the time, was quite suitable as both desktop reference
and paperweight. That and something like the "Standard C++ IOStreams
and Locales" go together.

Dangling references and unclosed resource handles are people's own
faults, about something like how reference counting mechanisms are
yet remarkably relevant from the age when people put away their tools.

Then people went to unique_ptr after smart_ptr and shared_ptr,
these things neatly hiding reference-counting and ownership.



Topicality, staying on topic, respecting the forum, these
are good things, while yet, in the desert, when the oasis
dries up, sooner or later all the creatures come down to
the watering hole.



--- Synchronet 3.22a-Linux NewsLink 1.2

From Newsgroup: comp.lang.c

On 08/06/2026 06:55 PM, Johann 'Myrkraverk' Oskarsson wrote:

On 06/08/2026 11:42 AM, Ross Finlayson wrote:

I just made that up so it's yet a sort of, "design of language",
and a description of a compiler, about "typed and templating
assembler".

Some of that read like brainstorming, other things read like output
from an L.L.M. I'm not sure you need me to comment on anything, as
it's your brainstorm. Am I wrong about that?

Happy brainstorming!

"Hello? Yes, this is Usenet Post."


A "large" language model is just a matter of perspective, ....


About "type theory", and that there's a sort of different
account when the types in assembler are all fixed-length
or "scalars", then a "fits-and-sits" type-theory instead
of an "is-a/has-a" type-theory, like a 64-bit word "fits"
two 32-bit words and eight bytes "sit" in a 64-bit word,
makes for a sort of, "scalar type-theory", about that
all the ratios between types are compile-time invariants,
is an example of an idea.

So "typed" and "templating" basically is for generics
and alignment then derivations, ..., "products" of
macros and parameterization, with "type theory" making
for a compiler a model of what "fits-and-sits", then
about how to relate that to "is-a/has-a", or the
"lambda-calculus", of type theory, is sort of an
idea of a, "scalar lambda-calculus".

I don't know anybody who's framed it in quite that way,
yet, surely it's the most usual kind of thing, ....


--- Synchronet 3.22a-Linux NewsLink 1.2

From Newsgroup: comp.lang.c

On 08/07/2026 05:13 AM, Ross Finlayson wrote:

On 08/06/2026 06:55 PM, Johann 'Myrkraverk' Oskarsson wrote:

On 06/08/2026 11:42 AM, Ross Finlayson wrote:

I just made that up so it's yet a sort of, "design of language",
and a description of a compiler, about "typed and templating
assembler".

Some of that read like brainstorming, other things read like output
from an L.L.M. I'm not sure you need me to comment on anything, as
it's your brainstorm. Am I wrong about that?


Happy brainstorming!

"Hello? Yes, this is Usenet Post."

A "large" language model is just a matter of perspective, ....

About "type theory", and that there's a sort of different
account when the types in assembler are all fixed-length
or "scalars", then a "fits-and-sits" type-theory instead
of an "is-a/has-a" type-theory, like a 64-bit word "fits"
two 32-bit words and eight bytes "sit" in a 64-bit word,
makes for a sort of, "scalar type-theory", about that
all the ratios between types are compile-time invariants,
is an example of an idea.

So "typed" and "templating" basically is for generics
and alignment then derivations, ..., "products" of
macros and parameterization, with "type theory" making
for a compiler a model of what "fits-and-sits", then
about how to relate that to "is-a/has-a", or the
"lambda-calculus", of type theory, is sort of an
idea of a, "scalar lambda-calculus".

I don't know anybody who's framed it in quite that way,
yet, surely it's the most usual kind of thing, ....

It's all "relations", then ideas about syntax and language
mostly are about contriving that what's already, "in the language".

For example I notice it's a trend this days in C++ to overload
"|" and use it for chaining expressions, "in the language",
it's an idiom, then that type-theory makes for the inference
of what it means, about that category-theory and type-theory
are two different theories.

High-level languages usually involve at least two different
theories, of the fundamental elements, then are given "primitives"
that relate the various kinds of theories kinds of elements, or
that it's given to the "compiler" to so interpret the expressions
in one as expressions in the other.

That "it's all relations" has that two things relate or don't,
what kind of relations they are then is a matter of all their
relations, recursively, then that most usually connected to
arithmetic, algebra, or geometry, arithmetizations, algebraizations,
and geometrizations, since they already have structure as relations,
or, just tables of relations, like relational-algebra, often
well-known as "a relational data-base management system with
relational algebra then also rows and nulls".

So, thinking about syntax, then there are only so many syntactical
elements or terminals or symbols usually on a keyboard, a usual
sort of 101-key keyboard with "qwerty" and "ASCII", then about
how to make for assembler language, syntax to define the
composition of "functions", which are a simple sort of "function",
that always have two inputs and one output, or "dyadic" functions.

Then, the "values" in this kind of idea of
"typed-and-templating-assembler", are alike in that they're scalars, and various in their
size. Then, accounts of arithmetic and the like, vis-a-vis "logic"
or binary relations, then comparison, is for that these live in
the chip, in a world where there are no stalls, branches, calls,
or faults.

#EXTRACT = #INSERT
#DECODE = 1

EXTRACT > DECODE < INSERT ~ EXTRACT . DECODE . INSERT

Then, there are no loops, yet EXTRACT is a generic, or just "un-sized"
#DECODE is 1, and INSERT is a generic that goes along with EXTRACT,
and their concatenation "interpolates" the loop.

Then, in a world without loops, though interpolation, has that
concatenation of the expressions, implies, to be inferred, a loop,
has for a theory of types or a sub-theory of the theory of types,
about how these sorts of things "go".

#T = 2
#ADD = 1

T(a, b) > ADD

A B . ADD


Then, it's kind of like "well, then "ADD" is a recursive definition",
and it's like, "well, maybe that's what functions are".


So, account of language, "in the language", are idiom, then
for languages with higher types, and over-riding or simply
enough defining the operators, it varies.


--- Synchronet 3.22a-Linux NewsLink 1.2

From Newsgroup: comp.lang.c

Hi,

Why is nobody mentioning Agda here. It has
beautiful dependent types, and tactics are
just programs. Poor Henk Barendregt, not

everybody likes dependent types it seems:

Are we stuck with Lean?
https://mathoverflow.net/q/513742/

Does Depependent types require proof objects,
which waste large amounts of memory. Well,
if you are not good in erasing them.

But is there a Red Pyjama for Proof Assistants,
the baby cradle where LLMs can learn proof
assistant lingua and strategies. It seems

yes, synthetic data corpuses to the rescue:

We address this gap by introducing SMAD
(Synthetic Multilanguage Autoformalization
Dataset), a 400K 4-to-3 parallel corpus
covering four formal languages (Dedukti,
Agda, Coq, Lean) and three natural languages (
English, French, Swedish), generated via
the Informath project.
https://github.com/GrammaticalFramework/informath

But the corpus could be an accident, maybe rather
a toy from the https://www.grammaticalframework.org/
folks, will this have an impact?

Bye

Mild Shock schrieb:

Hi,

Why does this Lama have a red pyjama.
Oh, its a baby Lama. Its still in the cradle
and needs some training:

RedPajama-Data-v2
https://github.com/togethercomputer/RedPajama-Data

But then Andrej Karpathy recently showed
GPT-2 training on rented GPUs for less
than 100 USD in less then 2 hours.

So where do these grown up Lamas go.
Well Georgi Gerganov prefered C++/C
when he shouted Llama Llama Red Pyjama.

But you also find WebLLM, wrapping the
underlying C++/C GPU interface via the
W3C standard WebGPU / WGSL, with JavaScript:

In-Browser LLM Inference Engine
https://webllm.mlc.ai/

My experience with WebLLM 6 months
ago on an iPad Pro 2024, still a little early
stage performance and robustness.

But hey hardware of AI mobile iGPUs is
still evolving, and AI laptop, AI smartphones
and AI tablets, will soon feature Chinese

hardware such some new Kirin AI in 2027.

Bye

Mild Shock schrieb:

Hi,

Maybe there is a Rossy Boy flux generator
web server with infinity and continuity
HTTPS and .mjs type, aka SIMT halucination.

To run the GPU example that is written in HTML,
JavaScript and WebGPU / WGSL, the minium is
possibly a HTTPS server that can deliver the

right mime type for the .mjs extension. Its
then only a bundle of static pages that does
the demonstration. What worked on my side

is the IntelliJ browse button, which then uses
a small local server on its own, sandboxed to
serving some project files.

But this is only how to launch the test pages.

The Rossy Boy SIMT halucination, could also work, who knows?

Bye

Mild Shock schrieb:

Hi,

Nobody cares about CivetWeb a C++/C library,
the rossy boy moron refuses to understand this
simple GPU test, that shows some AI Acceleration:

11.4 Giga Lips with a Budget Laptop
https://github.com/Jean-Luc-Picard-2021/gigabudget

Bye

Johann 'Myrkraverk' Oskarsson schrieb:

On 29/07/2026 5:15 PM, Mild Shock wrote:

Hi,

Confused rossy boy is confused. We are
not building a stupid web server, where
a listener thread spawns service threads,

and to avoid malloc and free, reuses
a pool, or some shitty fork join framework.
The producer and consumer example I posted

elsewhere archived a dataflow without
malloc and free of threads. You are miles
away from what we are doing here.

Why not?-a Isn't this comp.lang.c?-a And isn't that exactly how
CivetWeb works internally?-a Have you never built your own web
sever in C?-a Not even with CivetWeb?-a It's really easy!-a You
only need to implement a callback or two.

--- Synchronet 3.22a-Linux NewsLink 1.2

From Newsgroup: comp.lang.c

Hi,

How do you break out of a loop,

What Hamelt is to English language, is Hack to
Compiler Construction. The playbook of Hack contains
every drama that a Compiler Construction will face.
In the following we show how we realized Project 6:
Assembler from the Nand to Tetris journey via
a little Prolog DSL.

BTW, roughly or maybe not?
Hack (the book) =
Nand to Tetris (the website) =
Nisan, N. and Schocken, S. (the authors)

See also:

-C-WAM Assembly: Comfortable Labels and Goto https://medium.com/2989/1a11dd512813

Have Fun!

Bye


Mild Shock schrieb:

Hi,

pi-WAM is compiled to Hack VM. You
can realize goto's wherever you want. The
Hack VM I am using is a variant of:

The Elements of Computing Systems
Nisan, N. and Schocken, S. - June 15, 2021, MIT Press https://mitpress.mit.edu/9780262539807/the-elements-of-computing-systems/

I just combine the 16-bit A and D instructions
into single 32-bit instructions. You
find a Hack VM interpreter for WebGPU here:

11.4 Giga Lips with a Budget Laptop https://github.com/Jean-Luc-Picard-2021/gigabudget

Hava Fun!

Bye

Mild Shock schrieb:

Hi,

Using Java sometimes doesn't make me a Java
evangelist. I wouldn't care less about any
programming language, because the idea of

pi-WAM draws from pi-calculus and WAM. But
since we are in 2026, not many people
might remember pi-calculus:

Functions as Processes
Robin Milner - June 1989
https://hal.science/docs/00/07/54/05/PDF/RR-1154.pdf

AI chat bots know pi-calculus from time to
time, while interacting, they spit out
pi-calculus. I have always to tame them,

and let them cool down, since well, the
pi-calculus doesn't happen directly in the
pi-WAM. Rather in the FFI, which has create

operations on threads and queue, frankly my
pi-WAM is an extremly crippled, has only
a few primitives from pi-calculus.

BYe

Johann 'Myrkraverk' Oskarsson schrieb:

On 29/07/2026 11:25 PM, Ross Finlayson wrote:

On 07/29/2026 08:11 AM, Mild Shock wrote:


Then, of course, the idea that it naturally employs or "saturates"
the processor resources while doing work, in the low-level, yet
also has a direct interpretation in higher-level languages, even
"higher-level languages without GOTO", has also that it's faster
in both machine-organized, compiled, and interpreted environments.

Didn't you say in some other post you've done Java professionally?

How do you break out of a loop, from within a switch () statement
in Java?-a I gather that's simply impossible, because "goto" isn't
implemented, and the "break" statement doesn't see labels outside
the switch ()?

Not sure how well that fits within comp.theory, as I haven't sub-
scribed yet, but perhaps Mild Shock is willing to comment on that
glaring deficiency in the Java programming language?

--- Synchronet 3.22a-Linux NewsLink 1.2

From Newsgroup: comp.lang.c

Hi,

It is simply solved by these strings/3 facts:

:- multifile(strings/3).

/* de = ISO locale atoms with prefix de_ */ strings('evaluation_error.zero_divisor', de, 'Nulldivision.').

/* '' = fall back ISO locale atoms */ strings('evaluation_error.zero_divisor', '', 'Division by zero.').

About the price tag for using a multifile/1
directives in your Prolog code, instead of some
libc binding: Effort practically zero, just
write the directive before your clauses in every

file you define strings/3. Learning curve
practically zero, at least I assume so, multifile/1
directive is very intuitive. So the bottomline is
you didnrCOt buy the ISO Prolog core standard,

and also you didnrCOt buy the ISO POSIX standard,
400 pages fresh from the Austin group, in a classic
English office park in Berkshire, costs only 226
CHF in 2026 from ISO.

You see its everywhere, not only that GitHub
wants money for CI, even POSIX is subject to what
Cory Doctorow sees as Honey Moon, Bait-and-Switch
and Final Form , i.e. enshittification.

ItrCOs called . . . . enshittification https://www.youtube.com/watch?v=ShBOcElw1b0

Bye

Mild Shock schrieb:

Hi,

A better compiler is planned. There are
some tricks to use Prolog variables,
to perform fixups, during compilation.

Especially because its a compile before
use approach. So its a) not irrelevant that
the compiler is fast, and b) compile before

use gives head room, to complicated compile
schemes, for example of a Prolog cut (!)/0,
that not really fits into the structured

language concepts of a programming language
such as Java. Although situation might be
different when one looks at the Java VM

bytecode and not at the Java language.
The Java VM byte code might open more
possibilities than the Java language itself.

Bye

Mild Shock schrieb:

Hi,

With -C-WAM we add a second Prolog VM to the
same Prolog system, with the aim to use
it for specialized tasks:

Emulating -C-WAM in Dogelog Player
https://medium.com/2989/de9cd29c7d37

Optimized for speed the -C-WAM is very primitive.
The compiler capitalizes that code blocks
are relocatable.

Bye

Mild Shock schrieb:

Hi,

pi-WAM is compiled to Hack VM. You
can realize goto's wherever you want.

In particular the repo contains two versions
of a Hack VM, written in WebGPU / WGSL:

Hack VM: Version 1.0
https://github.com/Jean-Luc-Picard-2021/gigabudget/blob/main/course/example63/boot.mjs


Hack VM: Version 2.0
https://github.com/Jean-Luc-Picard-2021/gigabudget/blob/main/course/example64/boot2.mjs


Version 1.0 is for a single compute shader
expriment. And Version 2.o is for a multi
compute shader experiment.

Bye

Mild Shock schrieb:

Hi,

You are still chewing on SIMD. LoL

Ross Finlayson schrieb:

Then the idea is that any of those can be found and matched in
one "run", i.e. a stall-less, branch-less, call-less list of less >>>> than
a few or less than a few dozens or less than a few hundreds
instructions, the results "findings" in data and corresponding
"matchings" of expressions, that runs in less than one microsecond. >>>>

You cannot make the mental translation that if you have:

Ross Finlayson schrieb:

So, the context then is for register state and stack contents, that
the indicators of the above as "positive presence" then is to make
for that the adjustments to the offsets and extents and the shifts
is according to those, otherwise no-ops. Then the idea is that a

As independent logical thread state, that automatically MIMD follosw?

Whats the problem to solve then?

Bye

--- Synchronet 3.22a-Linux NewsLink 1.2

From Newsgroup: comp.lang.c

Hi,

Years ago Sam Altman said to have no idea how
to generate revenue, but when the generally
intelligent system is in place, he might ask it.

Some schools approach the rCLgeneralityrCY from
a totally wrong perspective. Take the EyeProlog
Pseudo Scientism here:

The Art of EyeProlog https://eyereasoner.github.io/eyeprolog/the-art-of-eyeprolog

It is the same nonsense like constraint propagation,
the idea here is to evolve better software, that it
has as a main component refinement:

Start -> Algo1 -> Algo2 -> Algo3 -> Algo4 ...

But EyeProlog itself is an example of not using
this refinement. Like dropping the classical
WAM architecture, and back to YieldProlog somehow.

What if the world ticks like this
when it come to generality:

/-> Algo1
/--> Algo2
Start ---> Algo3
\--> Algo4
\-> ...

Innovation requires to start from scratch.
I think this little booklet, recommended by
Ernst Specker, Proofs from THE BOOK is a

book of mathematical proofs by Martin Aigner
and G|+nter M. Ziegler, first published in 1998.
Just wants to teach us about this bifurcation:

Chapter 1: Six proofs of the infinity of
the primes, including Euclid's and Furstenberg's. https://en.wikipedia.org/wiki/Proofs_from_THE_BOOK

Yeah, lets aim for surprises by
generative AI, not refinement.

Bye

See also:

Sam Altman on his Business Model
https://www.youtube.com/shorts/pLnyjxgFxew

Mild Shock schrieb:

Hi,

Why is nobody mentioning Agda here. It has
beautiful dependent types, and tactics are
just programs. Poor Henk Barendregt, not

everybody likes dependent types it seems:

Are we stuck with Lean?
https://mathoverflow.net/q/513742/

Does Depependent types require proof objects,
which waste large amounts of memory. Well,
if you are not good in erasing them.

But is there a Red Pyjama for Proof Assistants,
the baby cradle where LLMs can learn proof
assistant lingua and strategies. It seems

yes, synthetic data corpuses to the rescue:

We address this gap by introducing SMAD
(Synthetic Multilanguage Autoformalization
Dataset), a 400K 4-to-3 parallel corpus
covering four formal languages (Dedukti,
Agda, Coq, Lean) and three natural languages (
English, French, Swedish), generated via
the Informath project.
https://github.com/GrammaticalFramework/informath

But the corpus could be an accident, maybe rather
a toy from the https://www.grammaticalframework.org/
folks, will this have an impact?

Bye

Mild Shock schrieb:

Hi,

Why does this Lama have a red pyjama.
Oh, its a baby Lama. Its still in the cradle
and needs some training:

RedPajama-Data-v2
https://github.com/togethercomputer/RedPajama-Data

But then Andrej Karpathy recently showed
GPT-2 training on rented GPUs for less
than 100 USD in less then 2 hours.

So where do these grown up Lamas go.
Well Georgi Gerganov prefered C++/C
when he shouted Llama Llama Red Pyjama.

But you also find WebLLM, wrapping the
underlying C++/C GPU interface via the
W3C standard WebGPU / WGSL, with JavaScript:

In-Browser LLM Inference Engine
https://webllm.mlc.ai/

My experience with WebLLM 6 months
ago on an iPad Pro 2024, still a little early
stage performance and robustness.

But hey hardware of AI mobile iGPUs is
still evolving, and AI laptop, AI smartphones
and AI tablets, will soon feature Chinese

hardware such some new Kirin AI in 2027.

Bye

Mild Shock schrieb:

Hi,

Maybe there is a Rossy Boy flux generator
web server with infinity and continuity
HTTPS and .mjs type, aka SIMT halucination.

To run the GPU example that is written in HTML,
JavaScript and WebGPU / WGSL, the minium is
possibly a HTTPS server that can deliver the

right mime type for the .mjs extension. Its
then only a bundle of static pages that does
the demonstration. What worked on my side

is the IntelliJ browse button, which then uses
a small local server on its own, sandboxed to
serving some project files.

But this is only how to launch the test pages.

The Rossy Boy SIMT halucination, could also work, who knows?

Bye

Mild Shock schrieb:

Hi,

Nobody cares about CivetWeb a C++/C library,
the rossy boy moron refuses to understand this
simple GPU test, that shows some AI Acceleration:

11.4 Giga Lips with a Budget Laptop
https://github.com/Jean-Luc-Picard-2021/gigabudget

Bye

Johann 'Myrkraverk' Oskarsson schrieb:

On 29/07/2026 5:15 PM, Mild Shock wrote:

Hi,

Confused rossy boy is confused. We are
not building a stupid web server, where
a listener thread spawns service threads,

and to avoid malloc and free, reuses
a pool, or some shitty fork join framework.
The producer and consumer example I posted

elsewhere archived a dataflow without
malloc and free of threads. You are miles
away from what we are doing here.

Why not?-a Isn't this comp.lang.c?-a And isn't that exactly how
CivetWeb works internally?-a Have you never built your own web
sever in C?-a Not even with CivetWeb?-a It's really easy!-a You
only need to implement a callback or two.

--- Synchronet 3.22a-Linux NewsLink 1.2

From Newsgroup: comp.lang.c

Hi,

Every does eat and sleep. Thats not,
don't give up and restart:

Cite 100 collegues, cite 100 papers, and
do 100 Python snippets. Thats only warm-up!
About - Hi, IrCOm Philip Zucker!
https://www.philipzucker.com/about/

One the other hand, that here is true
don't give up and restart:

Invent a dozen acronyms HMB2, HBM2E, TC-NCF,
MR-UF, MUF, MR-MUF and try them all.
How SK hynix Won the AI Memory Race
https://www.youtube.com/watch?v=Cg5tAujp6Go

Bye

Mild Shock schrieb:

Hi,

Years ago Sam Altman said to have no idea how
to generate revenue, but when the generally
intelligent system is in place, he might ask it.

Some schools approach the rCLgeneralityrCY from
a totally wrong perspective. Take the EyeProlog
Pseudo Scientism here:

The Art of EyeProlog https://eyereasoner.github.io/eyeprolog/the-art-of-eyeprolog

It is the same nonsense like constraint propagation,
the idea here is to evolve better software, that it
has as a main component refinement:

Start -> Algo1 -> Algo2 -> Algo3 -> Algo4 ...

But EyeProlog itself is an example of not using
this refinement. Like dropping the classical
WAM architecture, and back to YieldProlog somehow.

What if the world ticks like this
when it come to generality:

-a-a-a-a-a-a /-> Algo1
-a-a-a-a-a /--> Algo2
Start ---> Algo3
-a-a-a-a-a \--> Algo4
-a-a-a-a-a-a \-> ...

Innovation requires to start from scratch.
I think this little booklet, recommended by
Ernst Specker, Proofs from THE BOOK is a

book of mathematical proofs by Martin Aigner
and G|+nter M. Ziegler, first published in 1998.
Just wants to teach us about this bifurcation:

Chapter 1: Six proofs of the infinity of
the primes, including Euclid's and Furstenberg's. https://en.wikipedia.org/wiki/Proofs_from_THE_BOOK

Yeah, lets aim for surprises by
generative AI, not refinement.

Bye

See also:

Sam Altman on his Business Model
https://www.youtube.com/shorts/pLnyjxgFxew

Mild Shock schrieb:

Hi,

Why is nobody mentioning Agda here. It has
beautiful dependent types, and tactics are
just programs. Poor Henk Barendregt, not

everybody likes dependent types it seems:

Are we stuck with Lean?
https://mathoverflow.net/q/513742/

Does Depependent types require proof objects,
which waste large amounts of memory. Well,
if you are not good in erasing them.

But is there a Red Pyjama for Proof Assistants,
the baby cradle where LLMs can learn proof
assistant lingua and strategies. It seems

yes, synthetic data corpuses to the rescue:

We address this gap by introducing SMAD
(Synthetic Multilanguage Autoformalization
Dataset), a 400K 4-to-3 parallel corpus
covering four formal languages (Dedukti,
Agda, Coq, Lean) and three natural languages (
English, French, Swedish), generated via
the Informath project.
https://github.com/GrammaticalFramework/informath

But the corpus could be an accident, maybe rather
a toy from the https://www.grammaticalframework.org/
folks, will this have an impact?

Bye

Mild Shock schrieb:

Hi,

Why does this Lama have a red pyjama.
Oh, its a baby Lama. Its still in the cradle
and needs some training:

RedPajama-Data-v2
https://github.com/togethercomputer/RedPajama-Data

But then Andrej Karpathy recently showed
GPT-2 training on rented GPUs for less
than 100 USD in less then 2 hours.

So where do these grown up Lamas go.
Well Georgi Gerganov prefered C++/C
when he shouted Llama Llama Red Pyjama.

But you also find WebLLM, wrapping the
underlying C++/C GPU interface via the
W3C standard WebGPU / WGSL, with JavaScript:

In-Browser LLM Inference Engine
https://webllm.mlc.ai/

My experience with WebLLM 6 months
ago on an iPad Pro 2024, still a little early
stage performance and robustness.

But hey hardware of AI mobile iGPUs is
still evolving, and AI laptop, AI smartphones
and AI tablets, will soon feature Chinese

hardware such some new Kirin AI in 2027.

Bye

Mild Shock schrieb:

Hi,

Maybe there is a Rossy Boy flux generator
web server with infinity and continuity
HTTPS and .mjs type, aka SIMT halucination.

To run the GPU example that is written in HTML,
JavaScript and WebGPU / WGSL, the minium is
possibly a HTTPS server that can deliver the

right mime type for the .mjs extension. Its
then only a bundle of static pages that does
the demonstration. What worked on my side

is the IntelliJ browse button, which then uses
a small local server on its own, sandboxed to
serving some project files.

But this is only how to launch the test pages.

The Rossy Boy SIMT halucination, could also work, who knows?

Bye

Mild Shock schrieb:

Hi,

Nobody cares about CivetWeb a C++/C library,
the rossy boy moron refuses to understand this
simple GPU test, that shows some AI Acceleration:

11.4 Giga Lips with a Budget Laptop
https://github.com/Jean-Luc-Picard-2021/gigabudget

Bye

Johann 'Myrkraverk' Oskarsson schrieb:

On 29/07/2026 5:15 PM, Mild Shock wrote:

Hi,

Confused rossy boy is confused. We are
not building a stupid web server, where
a listener thread spawns service threads,

and to avoid malloc and free, reuses
a pool, or some shitty fork join framework.
The producer and consumer example I posted

elsewhere archived a dataflow without
malloc and free of threads. You are miles
away from what we are doing here.

Why not?-a Isn't this comp.lang.c?-a And isn't that exactly how
CivetWeb works internally?-a Have you never built your own web
sever in C?-a Not even with CivetWeb?-a It's really easy!-a You
only need to implement a callback or two.

--- Synchronet 3.22a-Linux NewsLink 1.2