From Newsgroup: sci.math

Hi,

J Strother Moore II is the Original Gangster (OG)
of program sharng. Interestingly structure sharing
meant always program sharing in the theorem

proving community back then:

COMPUTATIONAL LOGIC: STRUCTURE SHARING AND
PROOF OF PROGRAM PROPERTIES
J Strother Moore II - 1973 https://era.ed.ac.uk/bitstream/handle/1842/2245/Moore-Thesis-1973-OCR.pdf

Only the WAM community managed to intsitutionalize
the term structure sharng, as a reduced form of
program sharing, namely goal argument sharing

not using pairs of two pointers with skeleton and binding
environment anymore, to indentify a Prolog term,
but simple single pointers for a Prolog term.

Bye
--- Synchronet 3.21a-Linux NewsLink 1.2

From Newsgroup: sci.math

Hi,

The below PhD thesis is a nice gem,
including marvels such as:

2.3 Avoiding Unnecessary OCCUR Checks
It is possible to significantly reduce the number
of calls to OCCUR during a resolution unification
by the following observation. If two clauses are
being resolved, they are standardized apart.

Thus, a variable from the left-hand parent will not
occur in a term from the right-hand parent unless
during this unification, there has been a binding of a
variable from the right to a term from the left.

A similar statement holds for 1eft-to-right bindings.
Once again, in structure sharing, this condition
is easy to check.

The BAROQUE programming languages is also
a genious contraption, it can run functions
backwards, basically a Prolog based functional

language, using the reified IF-THEN-ELSE
from Ulrich Neumerkel. Only in 1973 there was
no EMACS yet. Now we have Prologers that know

EMACS but still know nothing otherwise.

Bye


Mild Shock schrieb:

Hi,

J Strother Moore II is the Original Gangster (OG)
of program sharng. Interestingly structure sharing
meant always program sharing in the theorem

proving community back then:

COMPUTATIONAL LOGIC: STRUCTURE SHARING AND
PROOF OF PROGRAM PROPERTIES
J Strother Moore II - 1973 https://era.ed.ac.uk/bitstream/handle/1842/2245/Moore-Thesis-1973-OCR.pdf

Only the WAM community managed to intsitutionalize
the term structure sharng, as a reduced form of
program sharing, namely goal argument sharing

not using pairs of two pointers with skeleton and binding
environment anymore, to indentify a Prolog term,
but simple single pointers for a Prolog term.

Bye

--- Synchronet 3.21a-Linux NewsLink 1.2

From Newsgroup: sci.math

Hi,

Woa! I didn't know that lausy Microsoft
Copilot certified Laptops are that fast:

%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% Dogelog Player 2.1.1 for Java

% AMD Ryzen 5 4500U
% ?- time(test).
% % Zeit 756 ms, GC 1 ms, Lips 9950390, Uhr 23.08.2025 02:45
% true.

% AMD Ryzen AI 7 350
% ?- time(test).
% % Zeit 378 ms, GC 1 ms, Lips 19900780, Uhr 28.08.2025 17:44
% true.

What happened to the Death of Moore's Law?
But somehow memory speed, CPU - RAM and GPU - RAM
trippled. Possibly due to some Artificial

Intelligence demand. And the bloody thing
has also a NPU (Neural Processing Unit),
nicely visible.

Bye

About the RAM speed. L1, L2 and L3
caches are bigger. So its harder to poison
the CPU. Also the CPU shows a revival of

Hyper-Threading Technology (HTT), which
AMD gives it a different name: They call it
Simultaneous multithreading (SMT).

https://www.cpubenchmark.net/compare/3702vs6397/AMD-Ryzen-5-4500U-vs-AMD-Ryzen-AI-7-350

BTW: Still ticking along with the primes.pl example:

test :-
len(L, 1000),
primes(L, _).

primes([], 1).
primes([J|L], J) :-
primes(L, I),
K is I+1,
search(L, K, J).

search(L, I, J) :-
mem(X, L),
I mod X =:= 0, !,
K is I+1,
search(L, K, J).
search(_, I, I).

mem(X, [X|_]).
mem(X, [_|Y]) :-
mem(X, Y).

len([], 0) :- !.
len([_|L], N) :-
N > 0,
M is N-1,
len(L, N).


Mild Shock schrieb:

Hi,

J Strother Moore II is the Original Gangster (OG)
of program sharng. Interestingly structure sharing
meant always program sharing in the theorem

proving community back then:

COMPUTATIONAL LOGIC: STRUCTURE SHARING AND
PROOF OF PROGRAM PROPERTIES
J Strother Moore II - 1973 https://era.ed.ac.uk/bitstream/handle/1842/2245/Moore-Thesis-1973-OCR.pdf

Only the WAM community managed to intsitutionalize
the term structure sharng, as a reduced form of
program sharing, namely goal argument sharing

not using pairs of two pointers with skeleton and binding
environment anymore, to indentify a Prolog term,
but simple single pointers for a Prolog term.

Bye

--- Synchronet 3.21a-Linux NewsLink 1.2

From Newsgroup: sci.math

Hi,

2025 will be last year we hear of Python.
This is just a tears in your eyes Eulogy:

Python: The Documentary | An origin story https://www.youtube.com/watch?v=GfH4QL4VqJ0

The Zen of Python is very different
from the Zen of Copilot+ . The bloody
Copilot+ Laptop doesn't use Python

in its Artificial Intelligence:

AI Content Extraction
- Python Involced? rYi None at runtime,
Model runs in ONNX + DirectML on NPU

AI Image Search
- Python Involced? rYi None at runtime,
ON-device image feature, fully compiled

AI Phi Silica
- Python Involced? rYi None at runtime,
Lightweight Phi model packaged as ONNX

AI Semantic Analysis?
- Python Involced? rYi None at runtime,
Text understanding done via compiled
ONNX operators

Bye

Mild Shock schrieb:

Hi,

J Strother Moore II is the Original Gangster (OG)
of program sharng. Interestingly structure sharing
meant always program sharing in the theorem

proving community back then:

COMPUTATIONAL LOGIC: STRUCTURE SHARING AND
PROOF OF PROGRAM PROPERTIES
J Strother Moore II - 1973 https://era.ed.ac.uk/bitstream/handle/1842/2245/Moore-Thesis-1973-OCR.pdf

Only the WAM community managed to intsitutionalize
the term structure sharng, as a reduced form of
program sharing, namely goal argument sharing

not using pairs of two pointers with skeleton and binding
environment anymore, to indentify a Prolog term,
but simple single pointers for a Prolog term.

Bye

--- Synchronet 3.21a-Linux NewsLink 1.2