Viewing profile — falsissime

Yes, this technique has been used by several implementations. And any application developer can use `asserta/1` for the very same purpose. Just one rule, that is certainly much mor…

> The user has no realistic way of implementing the `call/N` builtin themselves. Not sure what you mean by realistic, but `call/1` can be implemented by having one simple rule for …

You lost this bet: Write append3/4 which appends three lists to a fourth, such that append3(Xs,Ys,[e],[]) terminates.

For many languages, the lexical part requires an "eager consumer rule"/"maximal munch" in addition to the actual grammar, whereas the remaining grammar does not.

> ... all the activity of the early years of logic programming has died out, ... Of course, now there is activity of the current years! What else could we have now? If you look bac…

> Which system are you referring to? SICStus. The best for catching resource errors (that is with catch/3) and continues thereafter happily. SWI does catch many situations, but as …

> But there's no formal concept of "interface" in Prolog Any predicate you write for someone else has an interface. Someone else includes you in a couple of weeks. All predicates t…

(It seems one needs to go into a post directly to be able to reply more rapidly. The delay seems to be reserved for the thread-mode.) Before sending an e-mail, check https://www.so…

Explicit checking of the appropriate instantiations is something for more or less official interfaces, not for every internal predicate. For those official checking via must_be/2, …

(It takes some time here, before the reply link appears) While I do not know what you were thinking either, I do know that you insisted on a mode +,- and thus refrained from using …

Support of as many modes as possible is an aim that is often too ambitious. Instead, unsupported modes should be indicated with an instantiation error or (much rarer) an uninstanti…

For one, the second argument should be (upon success at least) a list. But in your program it isn't a list for `[]`.

There is a minor impurity in this code: `N = 1+1, rle([a,a],[[a,N]]).` succeeds, yet `rle([a,a],[[a,N]]), N = 1+1` fails. Add `:- op(150, fx, #).` and use it like `#CountPlus1 #= #…

> but the burning problem that datalog does fix is Prolog's semi-decidability, or in other words, its tendency to enter infinite recursions. Prolog's built-in search is not semidec…

Any progress for Quantum conformity wise? It's doc reads is a full ISO Prolog implementation https://quantumprolog.sgml.io/docs/langreference.html

op(150, fx, #) would make the SWI code more readable.

The 1978 DEC10 Prolog user guide mentions PROG.PL as an example of a Prolog file with an extension. See 3.2 in https://userweb.fct.unl.pt/~lmp/publications/online-papers/U... Maybe…

[dead]

Consider to set the flag to "error" to see if there are any cases where infinite terms would be created.

> the occurs check is crucial for the performance of the algorithm (because without it unification can go on forever, whereas with the occurs check unification will terminate and f…

Just to note one error in I.2.1: > ... whereas unification without the occur check is linear on the size of the smallest of the terms being unified. This claim is incorrect, it goe…

> [3] What does the DEC10 Prolog manual say about the occurs check? See I.2.1. Occur Check of https://userweb.fct.unl.pt/~lmp/publications/online-papers/D... A recent related discu…

> If Colmerauer had his way, Prolog would be a quick and dirty programming language fit to replace javascript or C. No. There are far too many such allusions in this post that it i…

The first Prolog was written in Algol-W. The second one, which was called Prolog I was written in Fortran. See comments for more: https://stackoverflow.com/a/4478969