[create-pull-request] automated change (#1392)

Co-authored-by: cuihtlauac <[email protected]>

asset/feed.xml

@@ -1,5 +1,5 @@
 <?xml version="1.0" encoding="UTF-8"?>
-<feed xmlns="http://www.w3.org/2005/Atom"><id>https://ocaml.org/feed.xml</id><title type="text">OCaml.org blog</title><updated>2023-07-13T05:47:28-00:00</updated><entry><link href="https://tarides.com/blog/2023-07-12-ocaml-ci-renovated" rel="alternate"/><contributor><uri>https://tarides.com/feed.xml</uri><name>tarides</name></contributor><content type="html">&lt;p&gt;OCaml-CI started with the goal of making a better continuous build system for OCaml projects. When we began in 2019, the goals were clear: it should provide a zero-configuration experience for OCaml projects using opam and Dune, and it should use an incremental architecture to avoid expensive recomputation of builds. We're delighted to announce that we achieved these goals, and OCaml-CI is currently tracking over five hundred repositories and processing over a hundred thousand jobs daily. This is inspiring news to those already using OCaml-CI or developers looking for a CI solution for their OCaml project.&lt;/p&gt;
+<feed xmlns="http://www.w3.org/2005/Atom"><id>https://ocaml.org/feed.xml</id><title type="text">OCaml.org blog</title><updated>2023-07-14T05:47:25-00:00</updated><entry><link href="https://tarides.com/blog/2023-07-12-ocaml-ci-renovated" rel="alternate"/><contributor><uri>https://tarides.com/feed.xml</uri><name>tarides</name></contributor><content type="html">&lt;p&gt;OCaml-CI started with the goal of making a better continuous build system for OCaml projects. When we began in 2019, the goals were clear: it should provide a zero-configuration experience for OCaml projects using opam and Dune, and it should use an incremental architecture to avoid expensive recomputation of builds. We're delighted to announce that we achieved these goals, and OCaml-CI is currently tracking over five hundred repositories and processing over a hundred thousand jobs daily. This is inspiring news to those already using OCaml-CI or developers looking for a CI solution for their OCaml project.&lt;/p&gt;
 &lt;p&gt;Throughout 2022, the Tarides CI team worked on rennovating OCaml-CI, focusing on improving the usability of the website, adding build history for branches, supporting new platforms, and launching experimental build support. We will cover all of those things in this blog post and hope you find them useful.&lt;/p&gt;
 &lt;p&gt;There is also a &lt;a href=&quot;https://discuss.ocaml.org/t/best-practices-for-continuous-integration-ci-in-2023/12380&quot;&gt;Discuss thread on CI Best Practices&lt;/a&gt;.&lt;/p&gt;
 &lt;h2 style=&quot;position:relative;&quot;&gt;&lt;a href=&quot;https://tarides.com/feed.xml#what-is-ocaml-ci&quot; aria-label=&quot;what is ocaml ci permalink&quot; class=&quot;anchor before&quot;&gt;&lt;svg aria-hidden=&quot;true&quot; focusable=&quot;false&quot; height=&quot;16&quot; version=&quot;1.1&quot; viewbox=&quot;0 0 16 16&quot; width=&quot;16&quot;&gt;&lt;path fill-rule=&quot;evenodd&quot; d=&quot;M4 9h1v1H4c-1.5 0-3-1.69-3-3.5S2.55 3 4 3h4c1.45 0 3 1.69 3 3.5 0 1.41-.91 2.72-2 3.25V8.59c.58-.45 1-1.27 1-2.09C10 5.22 8.98 4 8 4H4c-.98 0-2 1.22-2 2.5S3 9 4 9zm9-3h-1v1h1c1 0 2 1.22 2 2.5S13.98 12 13 12H9c-.98 0-2-1.22-2-2.5 0-.83.42-1.64 1-2.09V6.25c-1.09.53-2 1.84-2 3.25C6 11.31 7.55 13 9 13h4c1.45 0 3-1.69 3-3.5S14.5 6 13 6z&quot;&gt;&lt;/path&gt;&lt;/svg&gt;&lt;/a&gt;What is OCaml-CI?&lt;/h2&gt;

data/planet/0branch.xml

@@ -1,5 +1,5 @@
 <?xml version="1.0" encoding="UTF-8"?>
-<feed xmlns="http://www.w3.org/2005/Atom"><id>https://blog.0branch.com/rss.xml</id><title type="text">0branch</title><updated>2023-07-13T05:47:28-00:00</updated><entry><link href="http://blog.0branch.com/posts/2020-05-18-vile-9.8u.html" rel="alternate"/><contributor><uri>https://blog.0branch.com/rss.xml</uri><name>0branch</name></contributor><content type="html">&lt;div&gt;
+<feed xmlns="http://www.w3.org/2005/Atom"><id>https://blog.0branch.com/rss.xml</id><title type="text">0branch</title><updated>2023-07-14T05:47:25-00:00</updated><entry><link href="http://blog.0branch.com/posts/2020-05-18-vile-9.8u.html" rel="alternate"/><contributor><uri>https://blog.0branch.com/rss.xml</uri><name>0branch</name></contributor><content type="html">&lt;div&gt;
   &lt;div class=&quot;span-22&quot;&gt;
     &lt;div class=&quot;span-12&quot;&gt;&lt;h1&gt;vile 9.8u&lt;/h1&gt;&lt;/div&gt;
     &lt;div style=&quot;text-align: right&quot; class=&quot;span-10 last&quot;&gt;

data/planet/ambassadortothecomputers.xml

@@ -1,5 +1,5 @@
 <?xml version="1.0" encoding="UTF-8"?>
-<feed xmlns="http://www.w3.org/2005/Atom"><id>http://ambassadortothecomputers.blogspot.com/feeds/posts/default?alt=rss</id><title type="text">ambassadortothecomputers</title><updated>2023-07-13T05:47:28-00:00</updated><entry><link href="http://ambassadortothecomputers.blogspot.com/2011/06/logic-programming-in-scala-part-3.html" rel="alternate"/><contributor><uri>http://ambassadortothecomputers.blogspot.com/feeds/posts/default?alt=rss</uri><name>ambassadortothecomputers</name></contributor><content type="html">&lt;p&gt;In this post I want to build on the backtracking logic monad we covered &lt;a href=&quot;http://ambassadortothecomputers.blogspot.com/2011/04/logic-programming-in-scala-part-2.html&quot;&gt;last time&lt;/a&gt; by adding &lt;em&gt;unification&lt;/em&gt;, yielding an embedded DSL for Prolog-style logic programming.&lt;/p&gt; 
+<feed xmlns="http://www.w3.org/2005/Atom"><id>http://ambassadortothecomputers.blogspot.com/feeds/posts/default?alt=rss</id><title type="text">ambassadortothecomputers</title><updated>2023-07-14T05:47:25-00:00</updated><entry><link href="http://ambassadortothecomputers.blogspot.com/2011/06/logic-programming-in-scala-part-3.html" rel="alternate"/><contributor><uri>http://ambassadortothecomputers.blogspot.com/feeds/posts/default?alt=rss</uri><name>ambassadortothecomputers</name></contributor><content type="html">&lt;p&gt;In this post I want to build on the backtracking logic monad we covered &lt;a href=&quot;http://ambassadortothecomputers.blogspot.com/2011/04/logic-programming-in-scala-part-2.html&quot;&gt;last time&lt;/a&gt; by adding &lt;em&gt;unification&lt;/em&gt;, yielding an embedded DSL for Prolog-style logic programming.&lt;/p&gt; 
 &lt;b&gt;Prolog&lt;/b&gt; 
 &lt;p&gt;Here is a small Prolog example, the rough equivalent of &lt;code&gt;List.contains&lt;/code&gt; in Scala:&lt;/p&gt; 
 &lt;div class=&quot;highlight&quot;&gt;&lt;pre&gt;&lt;code class=&quot;prolog&quot;&gt;  &lt;span class=&quot;nf&quot;&gt;member&lt;/span&gt;&lt;span class=&quot;p&quot;&gt;(&lt;/span&gt;&lt;span class=&quot;nv&quot;&gt;X&lt;/span&gt;&lt;span class=&quot;p&quot;&gt;,&lt;/span&gt; &lt;span class=&quot;p&quot;&gt;[&lt;/span&gt;&lt;span class=&quot;nv&quot;&gt;X&lt;/span&gt;&lt;span class=&quot;p&quot;&gt;|&lt;/span&gt;&lt;span class=&quot;nv&quot;&gt;T&lt;/span&gt;&lt;span class=&quot;p&quot;&gt;]).&lt;/span&gt; 

data/planet/andrej.xml

@@ -1,5 +1,5 @@
 <?xml version="1.0" encoding="UTF-8"?>
-<feed xmlns="http://www.w3.org/2005/Atom"><id>http://math.andrej.com/feed.xml</id><title type="text">andrej</title><updated>2023-07-13T05:47:27-00:00</updated><entry><link href="http://math.andrej.com/2023/02/13/formalizing-invisible-mathematics/" rel="alternate"/><contributor><uri>http://math.andrej.com/feed.xml</uri><name>andrej</name></contributor><content type="html">&lt;p&gt;I am at the &lt;a href=&quot;http://www.ipam.ucla.edu/programs/workshops/machine-assisted-proofs/&quot;&gt;Machine assisted proofs&lt;/a&gt; workshop at the &lt;a href=&quot;http://www.ipam.ucla.edu&quot;&gt;UCLA Institute for Pure and Applied Mathematics&lt;/a&gt;, where I am about to give a talk on &amp;ldquo;Formalizing invisible mathematics&amp;rdquo;.&lt;/p&gt;
+<feed xmlns="http://www.w3.org/2005/Atom"><id>http://math.andrej.com/feed.xml</id><title type="text">andrej</title><updated>2023-07-14T05:47:24-00:00</updated><entry><link href="http://math.andrej.com/2023/02/13/formalizing-invisible-mathematics/" rel="alternate"/><contributor><uri>http://math.andrej.com/feed.xml</uri><name>andrej</name></contributor><content type="html">&lt;p&gt;I am at the &lt;a href=&quot;http://www.ipam.ucla.edu/programs/workshops/machine-assisted-proofs/&quot;&gt;Machine assisted proofs&lt;/a&gt; workshop at the &lt;a href=&quot;http://www.ipam.ucla.edu&quot;&gt;UCLA Institute for Pure and Applied Mathematics&lt;/a&gt;, where I am about to give a talk on &amp;ldquo;Formalizing invisible mathematics&amp;rdquo;.&lt;/p&gt;
 
 &lt;p&gt;Here are the &lt;a href=&quot;http://math.andrej.com/asset/data/formalizing-invisible-mathematics.pdf&quot;&gt;slides with speaker notes&lt;/a&gt; and the &lt;a href=&quot;https://youtu.be/wZSvuCJBaFU&quot;&gt;video recording of the talk&lt;/a&gt;.&lt;/p&gt;
 

data/planet/ashishagarwal.xml

@@ -1,5 +1,5 @@
 <?xml version="1.0" encoding="UTF-8"?>
-<feed xmlns="http://www.w3.org/2005/Atom"><id>http://ashishagarwal.org/tag/ocaml/feed/</id><title type="text">ashishagarwal</title><updated>2023-07-13T05:47:27-00:00</updated><entry><link href="http://ashishagarwal.org/2012/09/11/functional-big-data-genomics/" rel="alternate"/><contributor><uri>http://ashishagarwal.org/tag/ocaml/feed/</uri><name>ashishagarwal</name></contributor><content type="html">&lt;p&gt;&lt;strong&gt;Abstract&lt;/strong&gt;&lt;br/&gt;
+<feed xmlns="http://www.w3.org/2005/Atom"><id>http://ashishagarwal.org/tag/ocaml/feed/</id><title type="text">ashishagarwal</title><updated>2023-07-14T05:47:24-00:00</updated><entry><link href="http://ashishagarwal.org/2012/09/11/functional-big-data-genomics/" rel="alternate"/><contributor><uri>http://ashishagarwal.org/tag/ocaml/feed/</uri><name>ashishagarwal</name></contributor><content type="html">&lt;p&gt;&lt;strong&gt;Abstract&lt;/strong&gt;&lt;br/&gt;
 High-throughput genomic sequencing is characterized by large diverse datasets and numerous analysis methods. It is normal for an individual bioinformatician to work with thousands of data files and employ hundreds of distinct computations during the course of a single project. This problem is magnified in &amp;ldquo;core facilities&amp;rdquo;, which support multiple researchers working on diverse projects. Most investigators use ad hoc methods to manage this complexity with dire consequences: analyses frequently fail to meet the scientific mandate of reproducibility; improved analysis methods are often not considered because recomputing all downstream steps would be overwhelming; hard drives and CPUs are used sub-optimally; and, in some cases, raw data is lost.&lt;/p&gt;
 &lt;p&gt;We describe HITSCORE, an OCaml software stack that operates all computational aspects of the Genomics Core Facility at New York University&amp;rsquo;s Center for Genomics and Systems Biology. HITSCORE has been in production use for one year, and was implemented quickly by less than two programmers following design advice from several biologists. A simple domain specific language (DSL) enables generating type safe database bindings and GUI components, and greatly eases updates and migration of our data model. We found a multi-lingual stack too burdensome in a small team setting, and credit OCaml for fulfilling the needs of our full application stack. It has good database bindings, excels at encoding complex domain logic, and now allows construction of rich websites due to the Ocsigen web programming framework. Higher level libraries for distributed computing would be a welcome improvement.&lt;/p&gt;
 &lt;p&gt;The opportunity to build this system did not stem directly from any strength of functional programming or OCaml. It was necessary for a person with credibility amongst biologists to champion its development, and this credibility took several years to build. Rapid development appears to be the single most important factor in allaying doubts about using a lesser known language, and we will briefly describe our experiences in bringing OCaml to several high profile projects.&lt;/p&gt;

data/planet/bap.xml

@@ -1,5 +1,5 @@
 <?xml version="1.0" encoding="UTF-8"?>
-<feed xmlns="http://www.w3.org/2005/Atom"><id>https://binaryanalysisplatform.github.io/feed.xml</id><title type="text">bap</title><updated>2023-07-13T05:47:28-00:00</updated><entry><link href="http://binaryanalysisplatform.github.io/2021/09/15/writing-lifters-using-primus-lisp/" rel="alternate"/><contributor><uri>https://binaryanalysisplatform.github.io/feed.xml</uri><name>bap</name></contributor><content type="html">&lt;h1&gt;Defining instructions semantics using Primus Lisp (Tutorial)&lt;/h1&gt;
+<feed xmlns="http://www.w3.org/2005/Atom"><id>https://binaryanalysisplatform.github.io/feed.xml</id><title type="text">bap</title><updated>2023-07-14T05:47:25-00:00</updated><entry><link href="http://binaryanalysisplatform.github.io/2021/09/15/writing-lifters-using-primus-lisp/" rel="alternate"/><contributor><uri>https://binaryanalysisplatform.github.io/feed.xml</uri><name>bap</name></contributor><content type="html">&lt;h1&gt;Defining instructions semantics using Primus Lisp (Tutorial)&lt;/h1&gt;
 
 &lt;h2&gt;Introduction&lt;/h2&gt;
 

data/planet/baturin.xml

@@ -1,5 +1,5 @@
 <?xml version="1.0" encoding="UTF-8"?>
-<feed xmlns="http://www.w3.org/2005/Atom"><id>https://baturin.org/blog/atom-ocaml.xml</id><title type="text">baturin</title><updated>2023-07-05T05:48:06-00:00</updated><entry><link href="https://www.baturin.org/blog/lua-ml-embedding-and-projection" rel="alternate"/><contributor><uri>https://baturin.org/blog/atom-ocaml.xml</uri><name>baturin</name></contributor><content type="html">
+<feed xmlns="http://www.w3.org/2005/Atom"><id>https://baturin.org/blog/atom-ocaml.xml</id><title type="text">baturin</title><updated>2023-07-14T05:47:25-00:00</updated><entry><link href="https://www.baturin.org/blog/lua-ml-embedding-and-projection" rel="alternate"/><contributor><uri>https://baturin.org/blog/atom-ocaml.xml</uri><name>baturin</name></contributor><content type="html">
     One thing I find odd about many interpreter projects is that they are designed as standalone and can't be used as embedded
 scripting languages. Lua-ML is completely different in that regard: it's designed as an extension language first and offers
 some unique features for that use case, including a reconfigurable runtime library. You can remove modules from its standard library or replace