Deploying to wws from @ 0c4d4bd 🚀

Computer.js

@@ -1785,7 +1785,9 @@ class Tables {
       const count = group.length
       const top = -Math.min(...group.map(lang => lang.rank))
 
-      const wrappedName = `<a name='${lodash.camelCase(name)}' />${name}`
+      const wrappedName = `<a href="explorer.html#columns=rank~name~id~appeared~tags~creators~lab&searchBuilder=%7B%22criteria%22%3A%5B%7B%22condition%22%3A%22contains%22%2C%22data%22%3A%22lab%22%2C%22origData%22%3A%22lab%22%2C%22type%22%3A%22string%22%2C%22value%22%3A%5B%22${name}%22%5D%7D%5D%2C%22logic%22%3A%22AND%22%7D" name='${lodash.camelCase(
+        name
+      )}' />${name}`
 
       return { name: wrappedName, languages, count, top }
     })

blog/feed.xml

@@ -4,7 +4,7 @@
  <title>Feed</title>
  <link>https://pldb.io/</link>
  <description>PLDB: a Programming Language Database. Build the next great programming language.</description>
- <lastBuildDate>Wed, 11 Sep 2024 04:07:59 +0000</lastBuildDate>
+ <lastBuildDate>Wed, 11 Sep 2024 07:15:16 +0000</lastBuildDate>
  <language>en-us</language>
  <item>
   <title>A brief interview with Microsoft SandDance creator Steven Drucker</title>

concepts/alf.scroll

@@ -13,7 +13,7 @@ country Germany
 
 wikipedia https://en.wikipedia.org/wiki/Algebraic_Logic_Functional_programming_language
  related c unix
- summary Algebraic Logic Functional programming language, also known as ALF, is a programming language which combines functional and logic programming techniques. Its foundation is Horn clause logic with equality which consists of predicates and Horn clauses for logic programming, and functions and equations for functional programming. ALF was designed to be genuine integration of both programming paradigms, and thus any functional expression can be used in a goal literal and arbitrary predicates can occur in conditions of equations. ALF's operational semantics is based on the resolution rule to solve literals and narrowing to evaluate functional expressions. In order to reduce the number of possible narrowing steps, a leftmost-innermost basic narrowing strategy is used which, it is claimed, can be efficiently implemented. Terms are simplified by rewriting before a narrowing step is applied and equations are rejected if the two sides have different constructors at the top. Rewriting and rejection are supposed to result in a large reduction of the search tree and produce an operational semantics that is more efficient than Prolog's resolution strategy. Similarly to Prolog, ALF uses a backtracking strategy corresponding to a depth-first search in the derivation tree. The ALF system was designed to be an efficient implementation of the combination of resolution, narrowing, rewriting, and rejection. ALF programs are compiled into instructions of an abstract machine. The abstract machine is based on the Warren Abstract Machine (WAM) with several extensions to implement narrowing and rewriting. In the current ALF implementation programs of this abstract machine are executed by an emulator written in C. In the Carnegie Mellon University Artificial Intelligence Repository, ALF is included as an AI programming language, in particular as a functional/logic programming language Prolog implementation. A user manual describing the language and the use of the system is available. The ALF System runs under Unix and is free.
+ summary Algebraic Logic Functional programming language, also known as ALF, is a programming language which combines functional and logic programming techniques. Its foundation is Horn clause logic with equality which consists of predicates and Horn clauses for logic programming, and functions and equations for functional programming. ALF was designed to be genuine integration of both programming paradigms, and thus any functional expression can be used in a goal literal and arbitrary predicates can occur in conditions of equations. ALF's operational semantics is based on the resolution rule to solve literals and narrowing to evaluate functional expressions. In order to reduce the number of possible narrowing steps, a leftmost-innermost basic narrowing strategy is used which, it is claimed, can be efficiently implemented. Terms are simplified by rewriting before a narrowing step is applied and equations are rejected if the two sides have different constructors at the top. Rewriting and rejection are supposed to result in a large reduction of the search tree and produce an operational semantics that is more efficient than Prolog's resolution strategy. Similarly to Prolog, ALF uses a backtracking strategy corresponding to a depth-first search in the derivation tree. The ALF system was designed to be an efficient implementation of the combination of resolution, narrowing, rewriting, and rejection. ALF programs are compiled into instructions of an abstract machine. The abstract machine is based on the Warren Abstract Machine (WAM) with several extensions to implement narrowing and rewriting. In the current ALF implementation programs of this abstract machine are executed by an emulator written in C. In the Carnegie Mellon Artificial Intelligence Repository, ALF is included as an AI programming language, in particular as a functional/logic programming language Prolog implementation. A user manual describing the language and the use of the system is available. The ALF System runs under Unix and is free.
  pageId 11868019
  created 2004
  backlinksCount 8

concepts/alphard-programming-language.html

@@ -422,7 +422,7 @@
 <a href="https://en.wikipedia.org/wiki/Alphard_%28programming_language%29">Wikipedia</a>
 <p class="scrollParagraph">Alphard is a Pascal-like programming language for data abstraction and verification, proposed and designed by William A. Wulf, Ralph L. London, and Mary Shaw. <a href="https://en.wikipedia.org/wiki/Alphard_%28programming_language%29">Read more on Wikipedia...</a></p>
 <ul ><li >Tags: <a href='../lists/explorer.html#searchBuilder=%7B"criteria"%3A%5B%7B"condition"%3A"contains"%2C"data"%3A"tags"%2C"origData"%3A"tags"%2C"type"%3A"string"%2C"value"%3A%5B"pl"%5D%7D%5D%2C"logic"%3A"AND"%7D'>programming language</a></li>
-<li >Early development of Alphard happened in <a href="../lists/labs.html#q=Carnegie Mellon">Carnegie Mellon</a> and <a href="../lists/labs.html#q=USC">USC</a> and <a href="../lists/labs.html#q=Carnegie Mellon University">Carnegie Mellon University</a></li>
+<li >Early development of Alphard happened in <a href="../lists/labs.html#q=Carnegie Mellon">Carnegie Mellon</a> and <a href="../lists/labs.html#q=USC">USC</a> and <a href="../lists/labs.html#q=Carnegie Mellon">Carnegie Mellon</a></li>
 <li >See also: (2 related languages) <a href="pascal.html">Pascal</a>, <a href="lisp.html">Lisp</a></li></ul>
 <br>
 <div class="scrollKeyboardNav" style="display:none;"><a href="abbreviated-test-language-for-all-systems.html">abbreviated-test-language-for-all-systems.html</a> · alphard-programming-language.html · <a href="b32-business-basic.html">b32-business-basic.html</a><script>document.addEventListener('keydown', function(event) {

concepts/alphard-programming-language.scroll

@@ -4,7 +4,7 @@ id alphard-programming-language
 name Alphard
 appeared 1974
 tags pl
-lab Carnegie Mellon && USC && Carnegie Mellon University
+lab Carnegie Mellon && USC && Carnegie Mellon
 
 wikipedia https://en.wikipedia.org/wiki/Alphard_%28programming_language%29
  related pascal lisp

concepts/alphard-programming-language.txt

@@ -11,7 +11,7 @@ Alphard is a Pascal-like programming language for data abstraction and verificat
  https://en.wikipedia.org/wiki/Alphard_%28programming_language%29 Read more on Wikipedia...
 
 - Tags: programming language
-- Early development of Alphard happened in Carnegie Mellon and USC and Carnegie Mellon University
+- Early development of Alphard happened in Carnegie Mellon and USC and Carnegie Mellon
 - See also: (2 related languages) Pascal, Lisp
 
 View source

concepts/ashmedai.html

@@ -421,7 +421,7 @@
 </table>
 <p class="scrollParagraph"></p>
 <ul ><li >Tags: <a href='../lists/explorer.html#searchBuilder=%7B"criteria"%3A%5B%7B"condition"%3A"contains"%2C"data"%3A"tags"%2C"origData"%3A"tags"%2C"type"%3A"string"%2C"value"%3A%5B"pl"%5D%7D%5D%2C"logic"%3A"AND"%7D'>programming language</a></li>
-<li >Early development of ASHMEDAI happened in <a href="../lists/labs.html#q=Carnegie Mellon University">Carnegie Mellon University</a> and <a href="../lists/labs.html#q=University of Pittsburgh">University of Pittsburgh</a></li>
+<li >Early development of ASHMEDAI happened in <a href="../lists/labs.html#q=Carnegie Mellon">Carnegie Mellon</a> and <a href="../lists/labs.html#q=University of Pittsburgh">University of Pittsburgh</a></li>
 <li ><a href="https://hopl.info/showlanguage.prx?exp=1835">ASHMEDAI on HOPL</a></li>
 <li >Read more about ASHMEDAI on Semantic Scholar: <a href="https://semanticscholar.org/paper/4eabeac5f92184ae0ae03f2685cbf0a036602bab">1.</a></li></ul>
 <br>

concepts/ashmedai.scroll

@@ -4,7 +4,7 @@ id ashmedai
 name ASHMEDAI
 appeared 1967
 tags pl
-lab Carnegie Mellon University && University of Pittsburgh
+lab Carnegie Mellon && University of Pittsburgh
 
 country United States
 reference https://semanticscholar.org/paper/4eabeac5f92184ae0ae03f2685cbf0a036602bab

concepts/ashmedai.txt

@@ -8,7 +8,7 @@ ASHMEDAI is a programming language created in 1967.
 57 Years Old
 
 - Tags: programming language
-- Early development of ASHMEDAI happened in Carnegie Mellon University and University of Pittsburgh
+- Early development of ASHMEDAI happened in Carnegie Mellon and University of Pittsburgh
 - ASHMEDAI on HOPL
  https://hopl.info/showlanguage.prx?exp=1835 ASHMEDAI on HOPL
 - Read more about ASHMEDAI on Semantic Scholar: 1.

concepts/bliss.html

@@ -420,9 +420,9 @@
 <td>55<span>Years Old</span></td></tr>
 </table>
 <a href="https://en.wikipedia.org/wiki/BLISS">Wikipedia</a>
-<p class="scrollParagraph">BLISS is a system programming language developed at Carnegie Mellon University by W. A. Wulf, D. <a href="https://en.wikipedia.org/wiki/BLISS">Read more on Wikipedia...</a></p>
+<p class="scrollParagraph">BLISS is a system programming language developed at Carnegie Mellon by W. A. Wulf, D. <a href="https://en.wikipedia.org/wiki/BLISS">Read more on Wikipedia...</a></p>
 <ul ><li >Tags: <a href='../lists/explorer.html#searchBuilder=%7B"criteria"%3A%5B%7B"condition"%3A"contains"%2C"data"%3A"tags"%2C"origData"%3A"tags"%2C"type"%3A"string"%2C"value"%3A%5B"pl"%5D%7D%5D%2C"logic"%3A"AND"%7D'>programming language</a></li>
-<li >Early development of BLISS happened in <a href="../lists/labs.html#q=Carnegie Mellon University">Carnegie Mellon University</a></li>
+<li >Early development of BLISS happened in <a href="../lists/labs.html#q=Carnegie Mellon">Carnegie Mellon</a></li>
 <li ><a href="https://hopl.info/showlanguage.prx?exp=375">BLISS on HOPL</a></li>
 <li >See also: (5 related languages) <a href="mips.html">MIPS architecture</a>, <a href="ia-32.html">IA-32</a>, <a href="algol.html">Algol</a>, <a href="c.html">C</a>, <a href="doi.html">DOI</a></li>
 <li >Read more about BLISS on Semantic Scholar: <a href="https://semanticscholar.org/paper/4430dfe254804b19bb6a4d9fc10d5bed2932b7cc">1.</a></li></ul>

concepts/bliss.scroll

@@ -5,7 +5,7 @@ name BLISS
 appeared 1969
 creators William Wulf
 tags pl
-lab Carnegie Mellon University
+lab Carnegie Mellon
 
 country United States
 reference https://semanticscholar.org/paper/4430dfe254804b19bb6a4d9fc10d5bed2932b7cc
@@ -49,7 +49,7 @@ wikipedia https://en.wikipedia.org/wiki/BLISS
   END
   ELUDOM
  related mips ia-32 algol c doi
- summary BLISS is a system programming language developed at Carnegie Mellon University by W. A. Wulf, D. B. Russell, and A. N. Habermann around 1970. It was perhaps the best known systems programming language right up until C made its debut a few years later. Since then, C took off and BLISS faded into obscurity. When C was in its infancy, a few projects within Bell Labs were debating the merits of BLISS vs. C. BLISS is a typeless block-structured language based on expressions rather than statements, and includes constructs for exception handling, coroutines, and macros. It does not include a goto statement. The name is variously said to be short for "Basic Language for Implementation of System Software" or "System Software Implementation Language, Backwards". It was sometimes called "Bill's Language for Implementing System Software", after Bill Wulf. The original Carnegie Mellon compiler was notable for its extensive use of optimizations, and formed the basis of the classic book The Design of an Optimizing Compiler. DEC developed and maintained BLISS compilers for the PDP-10, PDP-11, VAX, DEC Prism, MIPS, DEC Alpha, and Intel IA-32, The language did not become popular among customers and few had the compiler, but DEC used it heavily in-house into the 1980s; most of the utility programs for the VMS operating system were written in BLISS-32. After its acquisition of DEC, Compaq developed and maintained a BLISS compiler for Intel IA-64.
+ summary BLISS is a system programming language developed at Carnegie Mellon by W. A. Wulf, D. B. Russell, and A. N. Habermann around 1970. It was perhaps the best known systems programming language right up until C made its debut a few years later. Since then, C took off and BLISS faded into obscurity. When C was in its infancy, a few projects within Bell Labs were debating the merits of BLISS vs. C. BLISS is a typeless block-structured language based on expressions rather than statements, and includes constructs for exception handling, coroutines, and macros. It does not include a goto statement. The name is variously said to be short for "Basic Language for Implementation of System Software" or "System Software Implementation Language, Backwards". It was sometimes called "Bill's Language for Implementing System Software", after Bill Wulf. The original Carnegie Mellon compiler was notable for its extensive use of optimizations, and formed the basis of the classic book The Design of an Optimizing Compiler. DEC developed and maintained BLISS compilers for the PDP-10, PDP-11, VAX, DEC Prism, MIPS, DEC Alpha, and Intel IA-32, The language did not become popular among customers and few had the compiler, but DEC used it heavily in-house into the 1980s; most of the utility programs for the VMS operating system were written in BLISS-32. After its acquisition of DEC, Compaq developed and maintained a BLISS compiler for Intel IA-64.
  backlinksCount 113
  pageId 390261
  dailyPageViews 44

concepts/bliss.txt

@@ -8,11 +8,11 @@ BLISS is a programming language created in 1969 by William Wulf.
 #1127 on PLDB
 55 Years Old
 
-BLISS is a system programming language developed at Carnegie Mellon University by W. A. Wulf, D. Read more on Wikipedia...
+BLISS is a system programming language developed at Carnegie Mellon by W. A. Wulf, D. Read more on Wikipedia...
  https://en.wikipedia.org/wiki/BLISS Read more on Wikipedia...
 
 - Tags: programming language
-- Early development of BLISS happened in Carnegie Mellon University
+- Early development of BLISS happened in Carnegie Mellon
 - BLISS on HOPL
  https://hopl.info/showlanguage.prx?exp=375 BLISS on HOPL
 - See also: (5 related languages) MIPS architecture, IA-32, Algol, C, DOI

concepts/charrette-ada.html

@@ -421,7 +421,7 @@
 </table>
 <p class="scrollParagraph"></p>
 <ul ><li >Tags: <a href='../lists/explorer.html#searchBuilder=%7B"criteria"%3A%5B%7B"condition"%3A"contains"%2C"data"%3A"tags"%2C"origData"%3A"tags"%2C"type"%3A"string"%2C"value"%3A%5B"pl"%5D%7D%5D%2C"logic"%3A"AND"%7D'>programming language</a></li>
-<li >Early development of Charrette Ada happened in <a href="../lists/labs.html#q=Carnegie Mellon University">Carnegie Mellon University</a></li>
+<li >Early development of Charrette Ada happened in <a href="../lists/labs.html#q=Carnegie Mellon">Carnegie Mellon</a></li>
 <li ><a href="https://hopl.info/showlanguage.prx?exp=3902">Charrette Ada on HOPL</a></li>
 <li >Read more about Charrette Ada on Semantic Scholar: <a href="https://semanticscholar.org/paper/dd3a2e7535ac8799215a4a80e1319927ae9b9b07">1.</a></li></ul>
 <br>

concepts/charrette-ada.scroll

@@ -4,7 +4,7 @@ id charrette-ada
 name Charrette Ada
 appeared 1980
 tags pl
-lab Carnegie Mellon University
+lab Carnegie Mellon
 
 country United States
 reference https://semanticscholar.org/paper/dd3a2e7535ac8799215a4a80e1319927ae9b9b07

concepts/charrette-ada.txt

@@ -8,7 +8,7 @@ Charrette Ada is a programming language created in 1980.
 44 Years Old
 
 - Tags: programming language
-- Early development of Charrette Ada happened in Carnegie Mellon University
+- Early development of Charrette Ada happened in Carnegie Mellon
 - Charrette Ada on HOPL
  https://hopl.info/showlanguage.prx?exp=3902 Charrette Ada on HOPL
 - Read more about Charrette Ada on Semantic Scholar: 1.

concepts/cmu-common-lisp.html

@@ -420,7 +420,7 @@
 <td>44<span>Years Old</span></td></tr>
 </table>
 <a href="https://www.cons.org/cmucl/">Homepage</a> · <a href="https://en.wikipedia.org/wiki/CMU_Common_Lisp">Wikipedia</a>
-<p class="scrollParagraph">CMUCL is a free Common Lisp implementation, originally developed at Carnegie Mellon University. CMUCL runs on most Unix-like platforms, including Linux and BSD; there is an experimental Windows port as well. Steel Bank Common Lisp is derived from CMUCL. <a href="https://en.wikipedia.org/wiki/CMU_Common_Lisp">Read more on Wikipedia...</a></p>
+<p class="scrollParagraph">CMUCL is a free Common Lisp implementation, originally developed at Carnegie Mellon. CMUCL runs on most Unix-like platforms, including Linux and BSD; there is an experimental Windows port as well. Steel Bank Common Lisp is derived from CMUCL. <a href="https://en.wikipedia.org/wiki/CMU_Common_Lisp">Read more on Wikipedia...</a></p>
 <ul ><li >Tags: <a href='../lists/explorer.html#searchBuilder=%7B"criteria"%3A%5B%7B"condition"%3A"contains"%2C"data"%3A"tags"%2C"origData"%3A"tags"%2C"type"%3A"string"%2C"value"%3A%5B"pl"%5D%7D%5D%2C"logic"%3A"AND"%7D'>programming language</a></li>
 <li >Early development of CMU Common Lisp happened in <a href="../lists/labs.html#q=CMUCL Project">CMUCL Project</a></li></ul>
 <br>

concepts/cmu-common-lisp.scroll

@@ -11,7 +11,7 @@ lab CMUCL Project
 country United States
 
 wikipedia https://en.wikipedia.org/wiki/CMU_Common_Lisp
- summary CMUCL is a free Common Lisp implementation, originally developed at Carnegie Mellon University. CMUCL runs on most Unix-like platforms, including Linux and BSD; there is an experimental Windows port as well. Steel Bank Common Lisp is derived from CMUCL. The Scieneer Common Lisp is a commercial derivative from CMUCL.
+ summary CMUCL is a free Common Lisp implementation, originally developed at Carnegie Mellon. CMUCL runs on most Unix-like platforms, including Linux and BSD; there is an experimental Windows port as well. Steel Bank Common Lisp is derived from CMUCL. The Scieneer Common Lisp is a commercial derivative from CMUCL.
  backlinksCount 103
  pageId 969655
  dailyPageViews 13

concepts/cmu-common-lisp.txt

@@ -7,7 +7,7 @@ CMU Common Lisp is a programming language created in 1980.
 #2348 on PLDB
 44 Years Old
 
-CMUCL is a free Common Lisp implementation, originally developed at Carnegie Mellon University. CMUCL runs on most Unix-like platforms, including Linux and BSD; there is an experimental Windows port as well. Steel Bank Common Lisp is derived from CMUCL. Read more on Wikipedia...
+CMUCL is a free Common Lisp implementation, originally developed at Carnegie Mellon. CMUCL runs on most Unix-like platforms, including Linux and BSD; there is an experimental Windows port as well. Steel Bank Common Lisp is derived from CMUCL. Read more on Wikipedia...
  https://en.wikipedia.org/wiki/CMU_Common_Lisp Read more on Wikipedia...
 
 - Tags: programming language