Deploying to master from @ b9dee10 🚀

archive.html

@@ -38,6 +38,10 @@
 
 <ul>
 
+        <li>
+            <a href="./posts/2023-06-12-types23.html">Presenting at TYPES'23</a> - June 12, 2023
+        </li>
+
         <li>
             <a href="./posts/2016-05-12-british-scientists-2.html">Чем занимаются британские ученые (2)</a> - May 12, 2016
         </li>

atom.xml

@@ -79,7 +79,6 @@ new C language standard.</span></p></p>
     <updated>2013-01-31T00:00:00Z</updated>
     <summary type="html"><![CDATA[<article>
     <section class="header">
-        Posted on January 31, 2013
         
     </section>
     <section>
@@ -207,6 +206,9 @@ is spoiling the user experience. I do understand that in general a return
 should be complicated to discourage buyers from returning everything, but
 why don’t you make it equally complicated?</p>
     </section>
+    <p align="right">
+      <i>January 31, 2013</i>
+    </p>
 </article>
 ]]></summary>
 </entry>
@@ -218,7 +220,6 @@ why don’t you make it equally complicated?</p>
     <updated>2013-02-01T00:00:00Z</updated>
     <summary type="html"><![CDATA[<article>
     <section class="header">
-        Posted on February  1, 2013
         
     </section>
     <section>
@@ -242,6 +243,9 @@ following assignment:</p>
 4. How long can an orphan live on it&#39;s own, if at all?</code></pre>
 <p>I hope that it would add some giggle to the overall struggle.</p>
     </section>
+    <p align="right">
+      <i>February  1, 2013</i>
+    </p>
 </article>
 ]]></summary>
 </entry>
@@ -253,7 +257,6 @@ following assignment:</p>
     <updated>2013-04-08T00:00:00Z</updated>
     <summary type="html"><![CDATA[<article>
     <section class="header">
-        Posted on April  8, 2013
         
     </section>
     <section>
@@ -317,6 +320,9 @@ and works pretty well.</p>
 jekyll-scholar, please don’t hesitate to create a github issue or contact an
 author. Every single contribution helps.</p>
     </section>
+    <p align="right">
+      <i>April  8, 2013</i>
+    </p>
 </article>
 ]]></summary>
 </entry>
@@ -328,7 +334,6 @@ author. Every single contribution helps.</p>
     <updated>2013-04-09T00:00:00Z</updated>
     <summary type="html"><![CDATA[<article>
     <section class="header">
-        Posted on April  9, 2013
         
     </section>
     <section>
@@ -402,6 +407,9 @@ So all you need to do is to add the following line to the e-build:</p>
 an overlays for that. May be one day gentoo people will add this thing into
 default tree. Gentoo people, where are you? :)</p>
     </section>
+    <p align="right">
+      <i>April  9, 2013</i>
+    </p>
 </article>
 ]]></summary>
 </entry>

bib.bib

@@ -1,3 +1,32 @@
+@InProceedings{2023-fscd,
+	author = {Altenkirch, Thorsten and 
+            Kaposi, Ambrus and
+            \v{S}inkarovs, Artjoms and
+            V\'{e}gh, Tam\'{a}s},
+	title = {{Combinatory Logic and Lambda Calculus Are Equal, Algebraically}},
+	booktitle = {8th International Conference on Formal Structures for Computation 
+               and Deduction (FSCD 2023)},
+	pages = {24:1--24:19},
+	series = {Leibniz International Proceedings in Informatics (LIPIcs)},
+	isbn = {978-3-95977-277-8},
+	issn = {1868-8969},
+	year = {2023},
+	volume = {260},
+	editor = {Gaboardi, Marco and van Raamsdonk, Femke},
+	publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
+	address = {Dagstuhl, Germany},
+	url = {/pubs/2023-fscd.pdf},
+	urn = {urn:nbn:de:0030-drops-180086},
+	doi = {10.4230/LIPIcs.FSCD.2023.24},
+	annote = {Keywords: Combinatory logic, lambda calculus,
+            quotient inductive types, Cubical Agda},
+	date = {2023-06-28},
+	addinfo = {
+    The sources of the paper with the code
+    \href{https://bitbucket.org/akaposi/combinator/src/master/fscd2023/}{are available here}.
+    Here is \href{https://drops.dagstuhl.de/opus/volltexte/2023/18008/}{the official link to the published paper}.
+  }}
+
 @inproceedings{2022-scan,
 	author = {\v{S}inkarovs, Artjoms and Scholz, Sven-Bodo},
 	title = {Parallel Scan as  a Multidimensional Array Problem},

posts/2013-01-31-amazon-luck-left-me.html

@@ -37,7 +37,6 @@
         <main role="main">
             <article>
     <section class="header">
-        Posted on January 31, 2013
 
     </section>
     <section>
@@ -165,6 +164,9 @@ <h1 id="conclusions">Conclusions</h1>
 should be complicated to discourage buyers from returning everything, but
 why don’t you make it equally complicated?</p>
     </section>
+    <p align="right">
+      <i>January 31, 2013</i>
+    </p>
 </article>
 
         </main>

posts/2013-02-01-teaching-operating-systems.html

@@ -37,7 +37,6 @@
         <main role="main">
             <article>
     <section class="header">
-        Posted on February  1, 2013
 
     </section>
     <section>
@@ -61,6 +60,9 @@
 4. How long can an orphan live on it's own, if at all?</code></pre>
 <p>I hope that it would add some giggle to the overall struggle.</p>
     </section>
+    <p align="right">
+      <i>February  1, 2013</i>
+    </p>
 </article>
 
         </main>

posts/2013-04-08-updating-my-blog.html

@@ -37,7 +37,6 @@
         <main role="main">
             <article>
     <section class="header">
-        Posted on April  8, 2013
 
     </section>
     <section>
@@ -101,6 +100,9 @@
 jekyll-scholar, please don’t hesitate to create a github issue or contact an
 author. Every single contribution helps.</p>
     </section>
+    <p align="right">
+      <i>April  8, 2013</i>
+    </p>
 </article>
 
         </main>

posts/2013-04-09-firefox-in-gentoo.html

@@ -37,7 +37,6 @@
         <main role="main">
             <article>
     <section class="header">
-        Posted on April  9, 2013
 
     </section>
     <section>
@@ -111,6 +110,9 @@ <h2 id="running-browsers-on-gentoo">Running browsers on gentoo</h2>
 an overlays for that. May be one day gentoo people will add this thing into
 default tree. Gentoo people, where are you? :)</p>
     </section>
+    <p align="right">
+      <i>April  9, 2013</i>
+    </p>
 </article>
 
         </main>

posts/2016-03-23-british-scientists-1.html

@@ -37,7 +37,6 @@
         <main role="main">
             <article>
     <section class="header">
-        Posted on March 23, 2016
 
     </section>
     <section>
@@ -176,6 +175,9 @@
 думаю, что тут нужно просто положиться на интуицию.</p>
 <p><a href="../posts/2016-05-12-british-scientists-2.html">Продолжение</a></p>
     </section>
+    <p align="right">
+      <i>March 23, 2016</i>
+    </p>
 </article>
 
         </main>

posts/2016-05-12-british-scientists-2.html

@@ -37,7 +37,6 @@
         <main role="main">
             <article>
     <section class="header">
-        Posted on May 12, 2016
 
     </section>
     <section>
@@ -146,6 +145,9 @@ <h3 id="постскриптум">Постскриптум</h3>
 возможности работы, напишите мне письмо на
 <a href="mailto:[email protected]">[email protected]</a>.</p>
     </section>
+    <p align="right">
+      <i>May 12, 2016</i>
+    </p>
 </article>
 
         </main>

posts/2023-06-12-types23.html

@@ -0,0 +1,71 @@
+<!doctype html>
+<html lang="en">
+    <head>
+        <meta charset="utf-8">
+        <meta http-equiv="x-ua-compatible" content="ie=edge">
+        <meta name="viewport" content="width=device-width, initial-scale=1">
+        <title>Artem Shinkarov - Presenting at TYPES'23</title>
+        <link rel="stylesheet" href="../css/notosans.css" />
+        <link rel="stylesheet" href="../css/merriweather.css" />
+        <link rel="stylesheet" href="../css/sakura.css" />
+        <link rel="stylesheet" href="../css/tema.css" />
+    </head>
+    <script>
+      function visibilityToggle(id) {
+         var x = document.getElementById(id);
+         //alert("display of " + id + " = " + x.style.display)
+         if (x.style.display === "none") {
+           x.style.display = "block";
+         } else {
+           x.style.display = "none";
+         }
+      }
+    </script>
+    <body>
+        <header>
+            <div class="logo">
+                <a href="../">Artem Shinkarov</a>
+            </div>
+            <nav>
+                <a href="../">About</a>
+                <a href="../publications.html">Publications</a>
+                <a href="../archive.html">Posts</a>
+                <a href="../links.html">Links</a>
+            </nav>
+        </header>
+        <hr style="border:1px solid #e4e4e4;" />
+        <main role="main">
+            <article>
+    <section class="header">
+
+    </section>
+    <section>
+        <p>I gave a talk on <a href="https://types2023.webs.upv.es/">TYPES’23</a> about
+implementing rank-polymorphic arrays in dependently-typed theory.</p>
+<p>The slides are <a href="../talks/2023-types">available here</a>, and the
+extended abstract <a href="../pubs/2023-types-abstract.pdf">can be found here</a>
+The abstract follows.</p>
+<p>Rank polymorphism is the ability of a function to operate on arrays of
+arbitrary ranks. The advantages of rank-polymorphism are twofold: very
+generic array combinators and the ability to specify advanced parallel
+algorithms such as scan or blocked matrix multiplication in a very
+natural combinatorial style. In this work we present an embedding of
+rank-polymorphic arrays within a dependently-typed language. Our
+embedding offers the generality of the specifications found in array
+languages. At the same time, we guarantee safe indexing and offer a way
+to reason about concurrency patterns within the given algorithm. The
+notion of array reshaping makes it possible to derive multiple parallel
+versions of the algorithm from a single specification. The overall
+structure of the proposed array framework is surprisingly similar to
+categories with families that is often used to encode type theory.
+Shapes are contexts, reshapes are substitutions, and arrays are
+well-scoped terms.</p>
+    </section>
+    <p align="right">
+      <i>June 12, 2023</i>
+    </p>
+</article>
+
+        </main>
+    </body>
+</html>

publications.html

@@ -37,6 +37,11 @@
         <main role="main">
             <ul>
 
+<li>2023
+ <a href="./pubs/2023-fscd.html">Combinatory Logic and Lambda Calculus Are Equal, Algebraically
+</a></li>
+
+
 <li>2022
  <a href="./pubs/2022-scan.html">Parallel Scan as a Multidimensional Array Problem
 </a></li>