<?xml version="1.0" encoding="UTF-8"?>
<rss xmlns:atom="http://www.w3.org/2005/Atom" version="2.0">
<channel>
<link>https://okmij.org/ftp/</link>
<title>okmij.org</title>
<description>List of updates to okmij.org</description>
<generator>MarXere</generator>
<language>en-us</language>
<ttl>21600</ttl>
<atom:link href="https://okmij.org/ftp/rss.xml" rel="self" type="application/rss+xml"/>
<lastBuildDate>07 Apr 2026 00:01 GMT</lastBuildDate>
<item>
<link>https://okmij.org/ftp/Algorithms/matmul.html</link>
<title>Matrix-matrix multiplication, from less conventional points of view:</title>
<pubDate>07 Apr 2026 00:01 GMT</pubDate>
<guid isPermaLink="false">tag:okmij.org,2026-04-07:Algorithms/matmul.html</guid>
<description>Matrix-matrix multiplication, from less conventional points of view: including an elegant imperative view </description></item>
<item>
<link>https://okmij.org/ftp/meta-programming/calculi.html#HOAS</link>
<title>The last problem of Higher-Order Abstract Syntax:</title>
<pubDate>02 Mar 2026 00:01 GMT</pubDate>
<guid isPermaLink="false">tag:okmij.org,2026-03-02:meta-programming/calculi.html#HOAS</guid>
<description>The last problem of Higher-Order Abstract Syntax: latent effects </description></item>
<item>
<link>https://okmij.org/ftp/tagless-final/Compiler/index.html</link>
<title>Compilers: Incrementally and Extensibly.</title>
<pubDate>02 Feb 2026 00:01 GMT</pubDate>
<guid isPermaLink="false">tag:okmij.org,2026-02-02:tagless-final/Compiler/index.html</guid>
<description>Further updated and extended notes for the course Compilers: Incrementally and Extensibly. Included in the public notes now is the section on languages, grammars, parsing. </description></item>
<item>
<link>https://okmij.org/ftp/ML/MetaOCaml.html#design-10</link>
<title>MetaOCaml: Ten Years Later.</title>
<pubDate>01 Jan 2026 00:01 GMT</pubDate>
<guid isPermaLink="false">tag:okmij.org,2026-01-01:ML/MetaOCaml.html#design-10</guid>
<description>MetaOCaml: Ten Years Later. The full, 2.5x extended paper published in Science of Computer Programming </description></item>
<item>
<link>https://okmij.org/ftp/Algorithms/map-monoid-reduce.html#nga.warm-up</link>
<title>Nested grouping-aggregation: Vertical monoid composition</title>
<pubDate>01 Jan 2026 00:01 GMT</pubDate>
<guid isPermaLink="false">tag:okmij.org,2026-01-01:Algorithms/map-monoid-reduce.html#nga.warm-up</guid>
<description>Nested grouping-aggregation: Vertical monoid composition A slightly simpler, and faster, algorithm and a better explanation  </description></item>
<item>
<link>https://okmij.org/ftp/Algorithms/map-monoid-reduce.html#nga.gen</link>
<title>Generating parallel  map-reduce for nested grouping-aggregation.</title>
<pubDate>01 Jan 2026 00:01 GMT</pubDate>
<guid isPermaLink="false">tag:okmij.org,2026-01-01:Algorithms/map-monoid-reduce.html#nga.gen</guid>
<description>Generating parallel  map-reduce for nested grouping-aggregation. Generating first-order, imperative and indeed performant code </description></item>
<item>
<link>https://okmij.org/ftp/meta-programming/calculi.html#scope-check</link>
<title>Handling Scope Checks: A Comparative Framework for Dynamic Scope Extrusion Checks.</title>
<pubDate>01 Jan 2026 00:01 GMT</pubDate>
<guid isPermaLink="false">tag:okmij.org,2026-01-01:meta-programming/calculi.html#scope-check</guid>
<description>Handling Scope Checks: A Comparative Framework for Dynamic Scope Extrusion Checks. Published in PACMPL (POPL), 2026. </description></item>
<item>
<link>https://okmij.org/ftp/meta-programming/calculi.html#tricks</link>
<title>Generating Code along with Annotations,</title>
<pubDate>01 Jan 2026 00:01 GMT</pubDate>
<guid isPermaLink="false">tag:okmij.org,2026-01-01:meta-programming/calculi.html#tricks</guid>
<description>Generating Code along with Annotations, on an apt example suggested by Olivier Danvy long time ago. An OlivierFest paper. </description></item>
<item>
<link>https://okmij.org/ftp/gengo/index.html#new-PLA</link>
<title>Anaphora in Static Orthodox First-Order Logic:</title>
<pubDate>08 Dec 2025 00:01 GMT</pubDate>
<guid isPermaLink="false">tag:okmij.org,2025-12-08:gengo/index.html#new-PLA</guid>
<description>Anaphora in Static Orthodox First-Order Logic: intra- and inter-sentential, bound-variable and donkey anaphora in the the 1920s logic </description></item>
<item>
<link>https://okmij.org/ftp/tagless-final/Compiler/index.html#intro</link>
<title>Compilers: Incrementally and Extensibly</title>
<pubDate>01 Nov 2025 00:01 GMT</pubDate>
<guid isPermaLink="false">tag:okmij.org,2025-11-01:tagless-final/Compiler/index.html#intro</guid>
<description>Teaching Compilers: Incrementally and Extensibly once more. The course notes are updated and extended. The significantly re-written Section 3 of the course notes (starts on p.12) now gives a very simple introduction to optimization in the tagless-final style without re-writing or pattern-matching, using normalization-by-evaluation instead. </description></item>
<item>
<link>https://okmij.org/ftp/Algorithms/map-monoid-reduce.html</link>
<title>Fun with Monoids and Map-Reduce:</title>
<pubDate>03 Oct 2025 00:01 GMT</pubDate>
<guid isPermaLink="false">tag:okmij.org,2025-10-03:Algorithms/map-monoid-reduce.html</guid>
<description>More Fun with Monoids and Map-Reduce: with quite more explanations -- in particular, of the parallel Horner rule (relating to outer semidirect product) and Boyer-Moore majority voting. Added the complete OCaml code for the parallel nested-aggregation, using OCaml domains. </description></item>
<item>
<link>https://okmij.org/ftp/Computation/having-effect.html</link>
<title>Having an Effect:</title>
<pubDate>05 Sep 2025 00:01 GMT</pubDate>
<guid isPermaLink="false">tag:okmij.org,2025-09-05:Computation/having-effect.html</guid>
<description>Having an Effect: more polish, more references </description></item>
<item>
<link>https://okmij.org/ftp/Algorithms/map-monoid-reduce.html#nested-agg</link>
<title>Nested grouping-aggregation: Vertical monoid composition.</title>
<pubDate>06 Aug 2025 00:01 GMT</pubDate>
<guid isPermaLink="false">tag:okmij.org,2025-08-06:Algorithms/map-monoid-reduce.html#nested-agg</guid>
<description>Nested grouping-aggregation: Vertical monoid composition. Nested grouping-aggregation (Advent of Code 2022 Problem 1) embarrassingly in parallel, with linear speed-up. </description></item></channel></rss>