Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
Groups > comp.lang.prolog > #15653
| From | Mild Shock <janburse@fastmail.fm> |
|---|---|
| Newsgroups | comp.lang.prolog, sci.logic, sci.math |
| Subject | ANN: Library Pegg, for π-E-graphs [Not EXWM] (Was: Accelerate Lean! From Theorem 3.11 to Corollary 3.12 [ZMC]) |
| Date | 2026-07-19 16:21 +0200 |
| Message-ID | <113imi5$2pqt$1@solani.org> (permalink) |
| References | (1 earlier) <10p4dif$1nve7$1@solani.org> <112b732$20pmt$1@solani.org> <112b7iu$20q3i$1@solani.org> <113cqbm$85b9$1@solani.org> <113ilkt$2ouu$1@solani.org> |
Cross-posted to 3 groups.
Hi, While some logicians seem to go backwards, bascially want GPUs eliminated from laptops, and then kill any windows manager, just use EXWM: From XFCE to EXWM Emacs is a text editor that, through EXWM (Emacs X Window Manager), can also be your window manager: https://www.vidal-rosset.net/2026-07-12-from-xfce-to-exwm-living-in-emacs-desktop-on-mx-linux.html Mostlikely we might soon see the backward sequel to E-graphs called EMACS-graphs. But here is my proposal, why not go the other way? - π-E-graphs: Basically parallel E-graphs - Pegg: An alternative egg library, using π-WAM Ok, this will not come so fast. Currently my π-WAM is still very integerish. Not sure how to do anything E-graph yet. Bye P.S: There is already an attempt based on Scala 3.4.1, some experiments done on Intel Core i7-12700K using 8 threads. But why use a very old CPU from Q4'21, when you can use an AI Laptop from 2026 with 512 GPU streaming processors? Parallel and Customizable Equality Saturation https://dl.acm.org/doi/pdf/10.1145/3771775.3786266 Mild Shock schrieb: > Hi, > > Accelerate Lean! And get from Theorem 3.11 > to Corollary 3.12 done. > > PROJECT LANA INTERIM REPORT ON IUT THEORY > ZEN Mathematics Center - 2026/07/17 > https://zen.ac.jp/en/zmc > > ZMC(ZEN Mathematics Center) is an international > research institute established with the aim > of promoting and developing modern mathematics > > with a focus on arithmetic geometry and the > formalization of modern mathematics using > computer languages > > LoL > > Bye > > Mild Shock schrieb: >> Hi, >> >> Maybe I should write a blog post, titled >> Introduction to AI Accelerator Prolog: >> >> - specialized jobs π-WAM (currently integerish stuff) >> - π-WAM uses no atomics, only comms >> - π-WAM uses warp, 30-40% more speed >> - π-WAM runs on GPU and CPU >> - π-WAM runs from within JavaScript, Python and Java >> >> Feels like reinventing FGCS concurrent >> logic programming. >> >> LoL >> >> Bye >> >> Mild Shock schrieb: >>> Hi, >>> >>> So the idea is to cover backtracking without >>> stack and choice points, only with registers. >>> So at the compute goto will use an instruction >>> >>> that stores the PC target into a register, >>> a new instruction for Hack: >>> >>> REG = PC + REL >>> >>> And then the jump will be, again a new >>> instruction for Hack: >>> >>> PC = REG >>> >>> If we squeeze the lemon and compile as much >>> with that, we will only find that it breaks for >>> calling recursive predicates that can use >>> >>> arbitary registers and choice points. But we >>> could maybe add stack and choice point as an >>> after match, instead of the classical WAM design >>> >>> that starts with stack and choice points! >>> >>> Bye >>> >>> Mild Shock schrieb: >>>> Hi, >>>> >>>> pi-WAM is a nice challenge, since its aim is to go >>>> even blow the instruction set of SWI-Prolog, >>>> while only using a Hack variant as instruction >>>> >>>> stream. But what is Hack? Well Hack seems to be >>>> the missing legacy of Niclaus Wirths PL0. The >>>> Hack (machine .asm) and Jack (highlevel compiler >>>> >>>> generating .vm which can be converted to .asm) >>>> combo makes even the famous Crafting Interpreters >>>> /Lox by Bob Nystrom redundant: >>>> >>>> Nand to Tetris courses are taught at 400+ >>>> universities, high schools, and bootcamps. The >>>> students who take them range from high >>>> schoolers to Ph.D. students to >>>> https://www.nand2tetris.org/ >>>> >>>> But digging deaper in Hack, it has no functions >>>> pointers so objects don't use virtual tables. >>>> But what will pi-WAM need and that is not yet >>>> >>>> in Hack? Given that my pi-WAM doesn't want a stack >>>> nor a choice point lists? Currently there is the >>>> idea to add a computed goto and that it can >>>> >>>> cover a more lightweight C_OR as known from >>>> SWI-Prolog, that would have the C_OR branches >>>> maybe restricted to have no outside >>>> >>>> clause calls? Lets see. Not yet sure. >>>> >>>> Bye >> >
Back to comp.lang.prolog | Previous | Next — Previous in thread | Find similar | Unroll thread
Prolog Education Group clueless about the AI Boom? Mild Shock <janburse@fastmail.fm> - 2025-03-03 14:18 +0100
Re: Prolog Education Group clueless about the AI Boom? Mild Shock <janburse@fastmail.fm> - 2025-03-03 14:20 +0100
Salary Templates if you "Grok" ML / AI [PhDs Negotiate Salaries] (Re: Prolog Education Group clueless about the AI Boom?) Mild Shock <janburse@fastmail.fm> - 2025-03-03 18:03 +0100
ILP is still dreaming of higher order (Was: Prolog Education Group clueless about the AI Boom?) Mild Shock <janburse@fastmail.fm> - 2025-03-07 23:58 +0100
Re: ILP is still dreaming of higher order (Was: Prolog Education Group clueless about the AI Boom?) Mild Shock <janburse@fastmail.fm> - 2025-03-08 00:00 +0100
FYI: Philip Zucker’s Co-Egraphs (Was: Prolog Education Group clueless about the AI Boom?) Mild Shock <janburse@fastmail.fm> - 2025-08-12 18:37 +0200
Using Hopcroft & Karp (HK) everywhere (Was: FYI: Philip Zucker’s Co-Egraphs) Mild Shock <janburse@fastmail.fm> - 2025-08-14 12:31 +0200
Confusing "decidable problem" and "complete algorithm" (Was: Using Hopcroft & Karp (HK) everywhere) Mild Shock <janburse@fastmail.fm> - 2025-08-14 14:31 +0200
DFA algorithms in a Python library (Re: Confusing "decidable problem" and "complete algorithm") Mild Shock <janburse@fastmail.fm> - 2025-08-14 15:14 +0200
Static Variable Shunting in Dogelog Player (Was: Using Hopcroft & Karp (HK) everywhere) Mild Shock <janburse@fastmail.fm> - 2025-08-16 11:22 +0200
Dynamic Variable Shunting in WebPL (Was: Static Variable Shunting in Dogelog Player) Mild Shock <janburse@fastmail.fm> - 2025-08-16 11:34 +0200
SWI-Prolog is still the OG of GC (Was: Dynamic Variable Shunting in WebPL) Mild Shock <janburse@fastmail.fm> - 2025-08-16 11:46 +0200
Cyclic Term Unification is Accounted (Was: SWI-Prolog is still the OG of GC) Mild Shock <janburse@fastmail.fm> - 2025-08-16 11:59 +0200
WebPL is an interesting project (Was: SWI-Prolog is still the OG of GC) Mild Shock <janburse@fastmail.fm> - 2025-08-17 18:00 +0200
Head to Head Race with Scryer Prolog (Was: WebPL is an interesting project) Mild Shock <janburse@fastmail.fm> - 2025-08-17 18:24 +0200
Does Variable Age make Sense? [Prolog Unification] (Was: Head to Head Race with Scryer Prolog) Mild Shock <janburse@fastmail.fm> - 2026-02-10 12:05 +0100
Type systems for non-deterministic concurrency [Amir Pnueli] (Was: Does Variable Age make Sense? [Prolog Unification]) Mild Shock <janburse@fastmail.fm> - 2026-07-20 12:20 +0200
Robin Milners fickle gives non-determinism in practice [Parallel π-WAM] (Was: Type systems for non-deterministic concurrency [Amir Pnueli]) Mild Shock <janburse@fastmail.fm> - 2026-07-20 12:34 +0200
Sleepy Joe and the Poor South (Local AI Emacs Mode) (Re: Prolog Education Group clueless about the AI Boom?) Mild Shock <janburse@fastmail.fm> - 2025-11-12 12:59 +0100
Beyond Sleepy Joe around the World (Was: Sleepy Joe and the Poor South (Local AI Emacs Mode)) Mild Shock <janburse@fastmail.fm> - 2025-11-12 13:12 +0100
GENESIS MISSION: Loosing it over Deep Pokets [Business wants A-Life] (Was: Prolog Education Group clueless about the AI Boom?) Mild Shock <janburse@fastmail.fm> - 2025-11-26 18:07 +0100
Vanilla Prolog: semi-decidable =\= decidable (Re: Prolog Education Group clueless about the AI Boom?) Mild Shock <janburse@fastmail.fm> - 2026-03-14 20:40 +0100
Its on the Internet, so it must be true? (Was: Vanilla Prolog: semi-decidable =\= decidable) Mild Shock <janburse@fastmail.fm> - 2026-03-16 11:01 +0100
Hack + Computed Goto = Leightweigh C_OR (Was: Vanilla Prolog: semi-decidable =\= decidable) Mild Shock <janburse@fastmail.fm> - 2026-07-04 16:58 +0200
The stack and choice points as an after match (Re: Hack + Computed Goto = Leightweigh C_OR) Mild Shock <janburse@fastmail.fm> - 2026-07-04 17:07 +0200
Introduction to AI Accelerator Prolog [π-WAM of Dogelog] (Was: The stack and choice points as an after match) Mild Shock <janburse@fastmail.fm> - 2026-07-17 10:49 +0200
Not praying to the god of lambda calculus [π beats α] (Was: Introduction to AI Accelerator Prolog [π-WAM of Dogelog]) Mild Shock <janburse@fastmail.fm> - 2026-07-17 11:13 +0200
pi in pi-WAM refers to pi-calculus (Re: Introduction to AI Accelerator Prolog [π-WAM of Dogelog]) Mild Shock <janburse@fastmail.fm> - 2026-07-18 01:22 +0200
Milners fickle() in pi-WAM [For fun and profit] (Re: pi in pi-WAM refers to pi-calculus (Re: Introduction to AI Accelerator Prolog [π-WAM of Dogelog]) Mild Shock <janburse@fastmail.fm> - 2026-07-18 01:49 +0200
Robin Milners pi calculus is typeless (Re: Milners fickle() in pi-WAM [For fun and profit]) Mild Shock <janburse@fastmail.fm> - 2026-07-18 11:00 +0200
Can the Church Turing hypotheses be refuted? [TLo @ FOM] (Re: Robin Milners pi calculus is typeless) Mild Shock <janburse@fastmail.fm> - 2026-07-18 11:10 +0200
Accelerate Lean! From Theorem 3.11 to Corollary 3.12 [ZMC] (Was: Introduction to AI Accelerator Prolog [π-WAM of Dogelog]) Mild Shock <janburse@fastmail.fm> - 2026-07-19 16:06 +0200
ANN: Library Pegg, for π-E-graphs [Not EXWM] (Was: Accelerate Lean! From Theorem 3.11 to Corollary 3.12 [ZMC]) Mild Shock <janburse@fastmail.fm> - 2026-07-19 16:21 +0200
csiph-web