Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
Groups > comp.lang.python > #197875
| From | Mild Shock <janburse@fastmail.fm> |
|---|---|
| Newsgroups | comp.lang.python |
| Subject | π-WAM Assembly: Comfortable Labels and Goto (Re: π-WAM Contest: 1 Million Packets with Prolog) |
| Date | 2026-08-09 19:37 +0200 |
| Message-ID | <115adsc$6ap5$2@solani.org> (permalink) |
| References | <1148loe$hg9r$1@solani.org> <114ppli$svql$4@solani.org> <114va95$10nl1$1@solani.org> <1154uui$2m36$2@solani.org> |
Hi, 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. Our initial quick and dirty prototype deploys double buffering to determine code lengths and is brittle in examples such as between/3. Our assembly DSL does without symbol tables but with Prolog logical variables only. We could fix the between/3 glitch and give a first disjunction (;)/2 prototype. Bye See also: π-WAM Assembly: Comfortable Labels and Goto https://medium.com/2989/1a11dd512813 Mild Shock schrieb: > Hi, > > We recently demonstrated a Prolog emulator for > ADA RendezVous without ACK and NACK. This is basically > a bounded buffer with max_size=1. We now went on and > implemented this kind of fire and forget channel > object natively for JavaScript, Java and Python. > Some results. > > Our 100 producers and 100 consumers, that communicate > 10000 packets through a single channel, is the camel > to go through the eye of a needle test case. Both > π-WAM and SWI-Prolog can do it below a second using > different means, but π-WAM beats SWI-Prolog here > by a factor of ca. 1.5x. > > Bye > > See also: > > π-WAM Contest: 1 Million Packets with Prolog > https://medium.com/2989/ec3e91551773
Back to comp.lang.python | Previous | Next — Previous in thread | Find similar | Unroll thread
ANN: Dogelog Player 2.2.4 (Parallel π-WAM) Mild Shock <janburse@fastmail.fm> - 2026-07-28 00:23 +0200
Emulating ADA RendezVous in π-WAM (Was: GPU Backend: Find 0xCAFFEE with π-WAM) Mild Shock <janburse@fastmail.fm> - 2026-08-05 14:28 +0200
π-WAM Contest: 1 Million Packets with Prolog (Re: Emulating ADA RendezVous in π-WAM) Mild Shock <janburse@fastmail.fm> - 2026-08-07 17:51 +0200
π-WAM Assembly: Comfortable Labels and Goto (Re: π-WAM Contest: 1 Million Packets with Prolog) Mild Shock <janburse@fastmail.fm> - 2026-08-09 19:37 +0200
csiph-web