Forums before death by AOL, social media and spammers... "We can't have nice things"
|    sci.logic    |    Logic -- math, philosophy & computationa    |    262,912 messages    |
[   << oldest   |   < older   |   list   |   newer >   |   newest >>   ]
|    Message 262,437 of 262,912    |
|    Mikko to olcott    |
|    Re: Prolog formally resolves the Liar Pa    |
|    10 Jan 26 11:02:47    |
      XPost: comp.theory, sci.math, comp.lang.prolog       From: mikko.levanto@iki.fi              On 09/01/2026 17:53, olcott wrote:       > On 1/9/2026 4:03 AM, Mikko wrote:       >> On 09/01/2026 01:28, olcott wrote:       >>       >>> Non-programmers and non-Prolog programmers only       >>> understand Occurs‑check failure as “Prolog doesn’t like it”.       >>       >> I don't know about non-programmers but everyone who knows enough about       >> programming to be able to read the definition of the predicate       >> unify_with_occurs_check/2 can understand that its failure means that       >> the programmer does not like a cyclic structure at that point.              > That is so stupidly wrong that it must be dishonest.              Prolog is what the standard says it is. You don't show any contradiction       with the Prolog standard but dishonesstly say "dishonest" anyway.              --       Mikko              --- SoupGate-Win32 v1.05        * Origin: you cannot sedate... all the things you hate (1:229/2)    |
[   << oldest   |   < older   |   list   |   newer >   |   newest >>   ]
(c) 1994, bbs@darkrealms.ca