Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
Groups > comp.lang.java.programmer > #53770
| From | Mild Shock <janburse@fastmail.fm> |
|---|---|
| Newsgroups | comp.lang.java.programmer |
| Subject | π-WAM Assembly: Comfortable Labels and Goto (Re: π-WAM Contest: 1 Million Packets with Prolog) |
| Date | 2026-08-09 19:40 +0200 |
| Message-ID | <115ae23$6ap5$4@solani.org> (permalink) |
| References | <1148lqu$hg9r$3@solani.org> <114ppkd$svql$3@solani.org> <114vacj$10nl1$3@solani.org> <1154v4b$2m36$4@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.java.programmer | Previous | Next — Previous in thread | Find similar | Unroll thread
GPU Backend: Find 0xCAFFEE with π-WAM (Re: ANN: Dogelog Player 2.2.4 (Parallel π-WAM)) Mild Shock <janburse@fastmail.fm> - 2026-08-03 12:13 +0200
Emulating ADA RendezVous in π-WAM (Re: GPU Backend: Find 0xCAFFEE with π-WAM) Mild Shock <janburse@fastmail.fm> - 2026-08-05 14:30 +0200
Re: Emulating ADA RendezVous in π-WAM (Re: GPU Backend: Find 0xCAFFEE with π-WAM) Johann 'Myrkraverk' Oskarsson <johann@myrkraverk.invalid> - 2026-08-05 23:44 +0800
π-WAM Assembly: Comfortable Labels and Goto (Re: π-WAM Contest: 1 Million Packets with Prolog) Mild Shock <janburse@fastmail.fm> - 2026-08-09 19:40 +0200
csiph-web