<?xml version="1.0" encoding="UTF-8"?>
<feed xmlns="http://www.w3.org/2005/Atom">
<author>
<name>oleg-at-okmij.org</name></author>
<id>https://okmij.org/ftp/</id>
<generator>MarXere</generator>
<link type="application/atom+xml" rel="self" href="https://okmij.org/ftp/atom.xml"/>
<link rel="alternate" href="https://okmij.org/ftp/"/>
<title>okmij.org</title>
<updated>2026-05-05T00:01:00Z</updated>
<entry>
<id>https://okmij.org/ftp/Babel/Babel.html#vax-scripting</id>
<link rel="alternate" href="https://okmij.org/ftp/Babel/Babel.html#vax-scripting"/>
<title>Bibliographic `web service' in VAX/VMS times: or shell scripting done right.</title>
<updated>2026-05-05T00:01:00Z</updated>
<summary>Bibliographic `web service' in VAX/VMS times: or shell scripting done right. If VAX were more widespread Perl would not have been needed. </summary></entry>
<entry>
<id>https://okmij.org/ftp/Algorithms/matmul.html</id>
<link rel="alternate" href="https://okmij.org/ftp/Algorithms/matmul.html"/>
<title>Matrix-matrix multiplication, from less conventional points of view:</title>
<updated>2026-04-07T00:01:00Z</updated>
<summary>Matrix-matrix multiplication, from less conventional points of view: including an elegant imperative view </summary></entry>
<entry>
<id>https://okmij.org/ftp/meta-programming/calculi.html#HOAS</id>
<link rel="alternate" href="https://okmij.org/ftp/meta-programming/calculi.html#HOAS"/>
<title>The last problem of Higher-Order Abstract Syntax:</title>
<updated>2026-03-02T00:01:00Z</updated>
<summary>The last problem of Higher-Order Abstract Syntax: latent effects </summary></entry>
<entry>
<id>https://okmij.org/ftp/tagless-final/Compiler/index.html</id>
<link rel="alternate" href="https://okmij.org/ftp/tagless-final/Compiler/index.html"/>
<title>Compilers: Incrementally and Extensibly.</title>
<updated>2026-02-02T00:01:00Z</updated>
<summary>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. </summary></entry>
<entry>
<id>https://okmij.org/ftp/ML/MetaOCaml.html#design-10</id>
<link rel="alternate" href="https://okmij.org/ftp/ML/MetaOCaml.html#design-10"/>
<title>MetaOCaml: Ten Years Later.</title>
<updated>2026-01-01T00:01:00Z</updated>
<summary>MetaOCaml: Ten Years Later. The full, 2.5x extended paper published in Science of Computer Programming </summary></entry>
<entry>
<id>https://okmij.org/ftp/Algorithms/map-monoid-reduce.html#nga.warm-up</id>
<link rel="alternate" href="https://okmij.org/ftp/Algorithms/map-monoid-reduce.html#nga.warm-up"/>
<title>Nested grouping-aggregation: Vertical monoid composition</title>
<updated>2026-01-01T00:01:01Z</updated>
<summary>Nested grouping-aggregation: Vertical monoid composition A slightly simpler, and faster, algorithm and a better explanation  </summary></entry>
<entry>
<id>https://okmij.org/ftp/Algorithms/map-monoid-reduce.html#nga.gen</id>
<link rel="alternate" href="https://okmij.org/ftp/Algorithms/map-monoid-reduce.html#nga.gen"/>
<title>Generating parallel  map-reduce for nested grouping-aggregation.</title>
<updated>2026-01-01T00:01:02Z</updated>
<summary>Generating parallel  map-reduce for nested grouping-aggregation. Generating first-order, imperative and indeed performant code </summary></entry>
<entry>
<id>https://okmij.org/ftp/meta-programming/calculi.html#scope-check</id>
<link rel="alternate" href="https://okmij.org/ftp/meta-programming/calculi.html#scope-check"/>
<title>Handling Scope Checks: A Comparative Framework for Dynamic Scope Extrusion Checks.</title>
<updated>2026-01-01T00:01:03Z</updated>
<summary>Handling Scope Checks: A Comparative Framework for Dynamic Scope Extrusion Checks. Published in PACMPL (POPL), 2026. </summary></entry>
<entry>
<id>https://okmij.org/ftp/meta-programming/calculi.html#tricks</id>
<link rel="alternate" href="https://okmij.org/ftp/meta-programming/calculi.html#tricks"/>
<title>Generating Code along with Annotations,</title>
<updated>2026-01-01T00:01:04Z</updated>
<summary>Generating Code along with Annotations, on an apt example suggested by Olivier Danvy long time ago. An OlivierFest paper. </summary></entry>
<entry>
<id>https://okmij.org/ftp/gengo/index.html#new-PLA</id>
<link rel="alternate" href="https://okmij.org/ftp/gengo/index.html#new-PLA"/>
<title>Anaphora in Static Orthodox First-Order Logic:</title>
<updated>2025-12-08T00:01:00Z</updated>
<summary>Anaphora in Static Orthodox First-Order Logic: intra- and inter-sentential, bound-variable and donkey anaphora in the the 1920s logic </summary></entry>
<entry>
<id>https://okmij.org/ftp/tagless-final/Compiler/index.html#intro</id>
<link rel="alternate" href="https://okmij.org/ftp/tagless-final/Compiler/index.html#intro"/>
<title>Compilers: Incrementally and Extensibly</title>
<updated>2025-11-01T00:01:00Z</updated>
<summary>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. </summary></entry>
<entry>
<id>https://okmij.org/ftp/Algorithms/map-monoid-reduce.html</id>
<link rel="alternate" href="https://okmij.org/ftp/Algorithms/map-monoid-reduce.html"/>
<title>Fun with Monoids and Map-Reduce:</title>
<updated>2025-10-03T00:01:00Z</updated>
<summary>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. </summary></entry>
<entry>
<id>https://okmij.org/ftp/Computation/having-effect.html</id>
<link rel="alternate" href="https://okmij.org/ftp/Computation/having-effect.html"/>
<title>Having an Effect:</title>
<updated>2025-09-05T00:01:00Z</updated>
<summary>Having an Effect: more polish, more references </summary></entry>
<entry>
<id>https://okmij.org/ftp/Algorithms/map-monoid-reduce.html#nested-agg</id>
<link rel="alternate" href="https://okmij.org/ftp/Algorithms/map-monoid-reduce.html#nested-agg"/>
<title>Nested grouping-aggregation: Vertical monoid composition.</title>
<updated>2025-08-06T00:01:00Z</updated>
<summary>Nested grouping-aggregation: Vertical monoid composition. Nested grouping-aggregation (Advent of Code 2022 Problem 1) embarrassingly in parallel, with linear speed-up. </summary></entry></feed>