Visual Prolog

<h2 id="history">History</h2>
<table><tbody><tr><th scope="col">Version</th><th scope="col">New features</th></tr><tr><th scope="row">Version 11</th><td>introduces suspending predicates for asynchronous programming<a class="footnote-ref" id="fnref:1" href="#fn:1"><sup>1</sup></a></td></tr><tr><th scope="row">Version 10</th><td>introduces object expressions, support for master/slave processes, <a href="/facts/Microsoft_Edge/BGoJEFX9">Microsoft Edge</a> webView2 control and some support for <a href="/facts/Direct2D/2wyAQnIz">Direct2D</a>+<a href="/facts/DirectWrite/nSP4w7pj">DirectWrite</a>+<a href="/facts/Windows_Imaging_Component/rwCtuJWh">Windows Imaging Component</a>.<a class="footnote-ref" id="fnref:2" href="#fn:2"><sup>2</sup></a></td></tr><tr><th scope="row">Version 9</th><td>introduces bounded polymorphism, extension predicates, threadsafe lock free fact databases, named parameters.<a class="footnote-ref" id="fnref:3" href="#fn:3"><sup>3</sup></a></td></tr><tr><th scope="row">Version 8</th><td>introduces presenters, for more user friendly data presentation in debugger and running program.<a class="footnote-ref" id="fnref:4" href="#fn:4"><sup>4</sup></a></td></tr><tr><th scope="row">Version 7.5</th><td>contains http server and LALR(1) parser generator.<a class="footnote-ref" id="fnref:5" href="#fn:5"><sup>5</sup></a></td></tr><tr><th scope="row">Version 7.4</th><td>can generate 64 bit windows code.<a class="footnote-ref" id="fnref:6" href="#fn:6"><sup>6</sup></a></td></tr><tr><th scope="row">Version 7.3</th><td>introduced generic classes and interfaces (see <a href="/facts/Generic_programming/kqtqJk7p">Generic programming</a>), guarded <a href="/facts/Monitor_(synchronization)/g2zfRatV">monitors</a>.<a class="footnote-ref" id="fnref:7" href="#fn:7"><sup>7</sup></a></td></tr><tr><th scope="row">Version 7.2</th><td>introduced anonymous predicates (a logical pendant to <a href="/facts/Anonymous_functions/2vdyE4zL">anonymous functions</a>) and namespaces.<a class="footnote-ref" id="fnref:8" href="#fn:8"><sup>8</sup></a></td></tr><tr><th scope="row">Version 7.0</th><td>introduced <a href="/facts/Parametric_polymorphism/ETb0G1zd">parametric polymorphism</a>.</td></tr><tr><th scope="row">Since version 6.0</th><td>the language has been fully <a href="/facts/Object-oriented_(programming)/TxNMEcao">object-oriented</a>.</td></tr></tbody></table>
<h2 id="hanoi-example">Hanoi example</h2>
<p>In the <a href="/facts/Towers_of_Hanoi/oxsYwDAD">Towers of Hanoi</a> example, the Prolog inference engine figures out how to move a stack of any number of progressively smaller disks, one at a time, from the left pole to the right pole in the described way, by means of a center as transit, so that there's never a bigger disk on top of a smaller disk. The predicate hanoi takes an integer indicating the number of disks as an initial argument.
</p>
class hanoi 
   predicates 
       hanoi : (unsigned N). 
end class hanoi 
 
implement hanoi 
   domains 
       pole = left; center; right. 
 
   clauses 
       hanoi(N) :- move(N, left, center, right). 
 
   class predicates 
       move : (unsigned N, pole A, pole B, pole C). 
   clauses 
       move(0, _, _, _) :- !. 
       move(N, A, B, C) :- 
           move(N-1, A, C, B), 
           stdio::writef("move a disc from % pole to the % pole\n", A, C), 
           move(N-1, B, A, C). 
end implement hanoi 
 
goal 
   console::init(), 
   hanoi::hanoi(4).

<h2 id="reception">Reception</h2>
<p><a href="/facts/Bruce_F._Webster/Bs0x9dI0">Bruce F. Webster</a> of <i><a href="/facts/BYTE/xWovF95Q">BYTE</a></i> praised Turbo Prolog in September 1986, stating that it was the first Borland product to excite him as much as Turbo Pascal did. He liked the user interface and low price, and reported that two <a href="/facts/BYU/aYaXLWt2">BYU</a> professors stated that it was superior to the Prolog they used at the university. While questioning the market demand for the language, Webster concluded that "Turbo Prolog may be as significant a leap in software design as Turbo Pascal represented three years ago", and recommended it to those "at all interested in artificial intelligence, databases, expert systems, or new ways of thinking about programming".<a class="footnote-ref" id="fnref:9" href="#fn:9"><sup>9</sup></a> Another author in the magazine that month wrote that the language's nonstandard, more structured syntax as making "source listings much more readable than those of standard Prolog". While stating that it had "many good features", he stated that Turbo Prolog's "Turbo Pascal flavor in its compiler and strong data typing ... create an identity problem for the language". Describing it as "Turbo Paslog", the author concluded that he does "not recommend it if you are seriously considering becoming a Prolog programmer".<a class="footnote-ref" id="fnref:10" href="#fn:10"><sup>10</sup></a> The magazine in 1989 listed Turbo Prolog 2.0 as among the "Distinction" winners of the BYTE Awards, approving of how Borland had "developed a system for real-world applications programming".<a class="footnote-ref" id="fnref:11" href="#fn:11"><sup>11</sup></a>
</p>
<h2 id="books-about-visual-prolog">Books about Visual Prolog</h2>
<ul><li>Thomas W. de Boer, <a href="https://wiki.visual-prolog.com/index.php?title=A_Beginners_Guide_to_Visual_Prolog">A Beginners Guide to Visual Prolog</a>
<ul><li><a href="https://wiki.visual-prolog.com/index.php?title=A_Beginners_Guide_to_Visual_Prolog_in_Chinese">Chinese translation</a></li></ul></li>
<li>Eduardo Costa, <a href="https://wiki.visual-prolog.com/index.php?title=Visual_Prolog_for_Tyros">Visual Prolog for Tyros</a>
<ul><li><a href="https://wikiru.visual-prolog.com/index.php?title=Visual_Prolog_for_Tyros">Russian translation</a></li>
<li><a href="https://wiki.visual-prolog.com/index.php?title=Visual_Prolog_for_Tyros_in_Chinese">Chinese translation</a></li></ul></li>
<li>Giovanni Torrero, <a href="http://digidownload.libero.it/giotorrero/informatica/VisualProlog.pdf">VISUAL PROLOG PER PRINCIPIANTI</a> <i>Italian</i> 113 pages (pdf)</li>
<li>Randall Scott, A Guide to Artificial Intelligence with Visual Prolog, <a href="/facts/ISBN_(identifier)/15AdSPa9">ISBN</a> 978-1-4327-4936-1</li></ul>
<h2 id="see-also">See also</h2>
<ul><li><a href="/facts/Comparison_of_Prolog_implementations/eQHFInTs">Comparison of Prolog implementations</a></li>
<li><a href="/facts/Logtalk/LsuW2sYU">Logtalk</a></li>
<li><a href="/facts/Mercury_(programming_language)/4UDPmoxe">Mercury (programming language)</a></li>
<li><a href="/facts/Prolog_syntax_and_semantics/umbG3kbq">Prolog syntax and semantics</a></li></ul>

<h2 id="external-links">External links</h2>
<ul><li><a href="//www.visual-prolog.com">Official website</a></li></ul>

<h2 id="references">References</h2>

<ol>
<li id="fn:1"><p>Visual Prolog 11 New Features <a href="https://wiki.visual-prolog.com/index.php?title=Visual_Prolog_11_New_Features" target="_blank">https://wiki.visual-prolog.com/index.php?title=Visual_Prolog_11_New_Features</a> <a href="#fnref:1" class="footnote-back-ref">↩</a></p></li>
<li id="fn:2"><p>Visual Prolog 10 New Features <a href="https://wiki.visual-prolog.com/index.php?title=Visual_Prolog_10_New_Features" target="_blank">https://wiki.visual-prolog.com/index.php?title=Visual_Prolog_10_New_Features</a> <a href="#fnref:2" class="footnote-back-ref">↩</a></p></li>
<li id="fn:3"><p>Visual Prolog 9 New Features <a href="https://wiki.visual-prolog.com/index.php?title=Visual_Prolog_9_New_Features" target="_blank">https://wiki.visual-prolog.com/index.php?title=Visual_Prolog_9_New_Features</a> <a href="#fnref:3" class="footnote-back-ref">↩</a></p></li>
<li id="fn:4"><p>Visual Prolog 8 New Features <a href="https://wiki.visual-prolog.com/index.php?title=Visual_Prolog_8_New_Features" target="_blank">https://wiki.visual-prolog.com/index.php?title=Visual_Prolog_8_New_Features</a> <a href="#fnref:4" class="footnote-back-ref">↩</a></p></li>
<li id="fn:5"><p>Visual Prolog 7.5 New Features <a href="https://wiki.visual-prolog.com/index.php?title=Visual_Prolog_7.5_New_Features" target="_blank">https://wiki.visual-prolog.com/index.php?title=Visual_Prolog_7.5_New_Features</a> <a href="#fnref:5" class="footnote-back-ref">↩</a></p></li>
<li id="fn:6"><p>Visual Prolog 7.4 New Features <a href="https://wiki.visual-prolog.com/index.php?title=Visual_Prolog_7.4_New_Features" target="_blank">https://wiki.visual-prolog.com/index.php?title=Visual_Prolog_7.4_New_Features</a> <a href="#fnref:6" class="footnote-back-ref">↩</a></p></li>
<li id="fn:7"><p>Visual Prolog 7.3 New Features <a href="https://wiki.visual-prolog.com/index.php?title=Visual_Prolog_7.3_New_Features" target="_blank">https://wiki.visual-prolog.com/index.php?title=Visual_Prolog_7.3_New_Features</a> <a href="#fnref:7" class="footnote-back-ref">↩</a></p></li>
<li id="fn:8"><p>Visual Prolog 7.2 New Features <a href="https://wiki.visual-prolog.com/index.php?title=Visual_Prolog_7.2_New_Features" target="_blank">https://wiki.visual-prolog.com/index.php?title=Visual_Prolog_7.2_New_Features</a> <a href="#fnref:8" class="footnote-back-ref">↩</a></p></li>
<li id="fn:9"><p>Webster, Bruce F. (September 1986). "Two Fine Products". BYTE. p. 335. <a href="https://archive.org/stream/byte-magazine-1986-09/1986_09_BYTE_11-09_The_68000_Family#page/n345/mode/2up" target="_blank">https://archive.org/stream/byte-magazine-1986-09/1986_09_BYTE_11-09_The_68000_Family#page/n345/mode/2up</a> <a href="#fnref:9" class="footnote-back-ref">↩</a></p></li>
<li id="fn:10"><p>Shammas, Namir Clement (September 1986). "Turbo Prolog". BYTE. p. 293. <a href="#fnref:10" class="footnote-back-ref">↩</a></p></li>
<li id="fn:11"><p>"The BYTE Awards". BYTE. January 1989. p. 327. <a href="https://archive.org/stream/byte-magazine-1989-01/1989_01_BYTE_14-01_PC_Communications_and_Annual_Awards_and_Digitizing_Tablets#page/n371/mode/2up" target="_blank">https://archive.org/stream/byte-magazine-1989-01/1989_01_BYTE_14-01_PC_Communications_and_Annual_Awards_and_Digitizing_Tablets#page/n371/mode/2up</a> <a href="#fnref:11" class="footnote-back-ref">↩</a></p></li>
</ol>

Visual Prolog open-in-new

Visual Prolog