scryer-prolog

Awesome work, thank you a lot Javier for making this available, and for the Scryer Prolog improvements that make this possible! I see that almost all of the changes mentioned on the page are in fact already filed for inclusion: https://github.com/mthom/scryer-prolog/pull/3379 https://github.com/mthom/scryer-prolog/pull/3383 https://github.com/mthom/scryer-prolog/pull/3387 https://github.com/mthom/scryer-prolog/pull/3390 If anyone is interested in contributing to Scryer Prolog and getting these changes included, please have a look and participate in the accompanying discussions, thank you a lot! For everyone interested in Prolog and its applications, please also consider attending the Scryer Prolog Meetup 2026 on Oct. 24th and 25th in Vienna: https://www.digitalaustria.gv.at/wissenswertes/events/scryer... I hope to see several of you there

I think this is very well phrased, and I would argue the same holds for Prolog too. In my opinion, a key difference between Prolog and other languages in that regard is one of degree, not kind: Compared to other languages, addressing performance problems in Prolog engines tends to have far greater effects on Prolog programs, because so much is implicit (i.e., left to the engine). If the performance problem is not in the engine, but in the program itself, then we will face the same questions with Prolog as with other languages: How to formulate the program better, is there a better approach altogether? For example, earlier today an interesting question regarding performance was posted in the Scryer discussions: https://github.com/mthom/scryer-prolog/discussions/3341 The comparison in this case is between Gecode and Scryer on a seemingly si

Regarding distributed systems, I find Torbjörn Lager's recent work on Web Prolog particularly interesting. He recently posted about it here: https://github.com/mthom/scryer-prolog/discussions/3322 and also in the course of a discussion on various approaches to implement concurrency in Prolog: https://github.com/mthom/scryer-prolog/discussions/3307

Very nice! In the Scryer Prolog discussions, Alex has shared a few ideas and considerations for possible improvements to the Prolog code, including the use of metaprogramming to automatically generate more general relations: https://github.com/mthom/scryer-prolog/discussions/3221 I hope for an interesting followup article! Another very interesting Prolog program by Alex is factgraph.pl: https://github.com/alexpetros/factgraph.pl It's a Prolog implementation of the IRS Fact Graph, an application of Law as Code.

You probably already know about https://github.com/mthom/scryer-prolog are you saying we should accelerate scryer-prolog with a Grayskull board?

yes[1][2]. You can write Prolog schedulers with arbitrary constraints. [1]: https://www.metalevel.at/prolog/timetabling/ [2]: https://github.com/mthom/scryer-prolog/discussions/2519

I'm not familiar with the ecosystem. How does the embedding work? Ah, looks like it is compiled to WASM. https://github.com/mthom/scryer-prolog/compare/master...baka...

Speaking of funny shebangs, I came up with this to shell execute prolog .pl files, but it should work for any scripting language that has /**/-comments but doesn't support #-comments or #! shebangs specifically: /*usr/bin/env scryer-prolog "$0" "$@" ; exit #*/ From my original comment https://github.com/mthom/scryer-prolog/issues/2170#issuecomm... : > The way this works is that this test.pl is both a valid shell file and prolog file. When executing as shell the first line finds and executes /usr/bin/env after searching for the glob pattern /*usr/bin/env. env then executes scryer-prolog "test.pl" which runs the prolog file as a module and halts; of course prolog ignores the first line as a comment /* ... */. Then the shell continues and executes the next command after ; which is exit which stops execution so the rest of the file (whic

No, unless you count cancer research[1], particle physics experiments[2], and government funding allocations[3]. [1]: https://dcnorris.github.io/precautionary/index.html [2]: https://github.com/mthom/scryer-prolog/discussions/2441 [3]: https://link.springer.com/chapter/10.1007/978-981-97-2300-3_... Regarding how, check out Power of Prolog on YouTube.

Respectfully have to disagree. Prolog has the best features for abstraction of any language I've used, I suspect it may be near an optimal fixed point for metaprogramming expression[3]. I will say the other side of that wall is breathtaking. Also not sure what you mean, CLP is a first class consideration in many Prologs, esp Scryer Prolog. Check these crazy demos out: [1] https://youtu.be/h5Xy4YjCZxM [2] https://youtu.be/5KUdEZTu06o Just look at this Sudoku solver code (see [2] for explanation): sudoku(Rows) :- length(Rows, 9), maplist(same_length(Rows), Rows), append(Rows, Vs), Vs ins 1..9, maplist(all_distinct, Rows), transpose(Rows, Columns), maplist(all_distinct, Columns), Rows = [As,Bs,Cs,Ds,Es,Fs,Gs,Hs,Is], blocks(As, Bs, Cs), blocks(Ds, Es, Fs), block