<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:dc="http://purl.org/dc/elements/1.1/"><channel><title>Posts on Massimo Nocentini</title><link>https://massimo-nocentini.github.io/post/</link><description>Recent content in Posts on Massimo Nocentini</description><generator>Hugo</generator><language>en-US</language><lastBuildDate>Wed, 21 Oct 2026 11:03:00 +0200</lastBuildDate><atom:link href="https://massimo-nocentini.github.io/post/index.xml" rel="self" type="application/rss+xml"/><item><title>The (aux anthropic) module</title><link>https://massimo-nocentini.github.io/post/2026-10-21-scm-testsuite-anthropic-suite/</link><pubDate>Wed, 21 Oct 2026 11:03:00 +0200</pubDate><dc:creator>Massimo Nocentini</dc:creator><guid>https://massimo-nocentini.github.io/post/2026-10-21-scm-testsuite-anthropic-suite/</guid></item><item><title>The (aux cml) module</title><link>https://massimo-nocentini.github.io/post/2026-10-21-scm-testsuite-cml/</link><pubDate>Wed, 21 Oct 2026 10:47:00 +0200</pubDate><dc:creator>Massimo Nocentini</dc:creator><guid>https://massimo-nocentini.github.io/post/2026-10-21-scm-testsuite-cml/</guid></item><item><title>The (aux hakaru10) modules</title><link>https://massimo-nocentini.github.io/post/2026-10-21-scm-testsuite-hakaru10/</link><pubDate>Wed, 21 Oct 2026 10:36:00 +0200</pubDate><dc:creator>Massimo Nocentini</dc:creator><guid>https://massimo-nocentini.github.io/post/2026-10-21-scm-testsuite-hakaru10/</guid></item><item><title>The (aux kanren) modules</title><link>https://massimo-nocentini.github.io/post/2026-10-21-scm-testsuite-kanren/</link><pubDate>Wed, 21 Oct 2026 10:28:00 +0200</pubDate><dc:creator>Massimo Nocentini</dc:creator><guid>https://massimo-nocentini.github.io/post/2026-10-21-scm-testsuite-kanren/</guid></item><item><title>The (aux games dice-of-doom) module</title><link>https://massimo-nocentini.github.io/post/2026-10-21-scm-testsuite-dice-of-doom-suite/</link><pubDate>Wed, 21 Oct 2026 10:27:00 +0200</pubDate><dc:creator>Massimo Nocentini</dc:creator><guid>https://massimo-nocentini.github.io/post/2026-10-21-scm-testsuite-dice-of-doom-suite/</guid></item><item><title>The (aux machine) modules</title><link>https://massimo-nocentini.github.io/post/2026-10-21-scm-testsuite-machine/</link><pubDate>Wed, 21 Oct 2026 10:24:00 +0200</pubDate><dc:creator>Massimo Nocentini</dc:creator><guid>https://massimo-nocentini.github.io/post/2026-10-21-scm-testsuite-machine/</guid></item><item><title>The (aux schemer seasoned) module</title><link>https://massimo-nocentini.github.io/post/2026-10-21-scm-testsuite-seasoned-schemer-suite/</link><pubDate>Wed, 21 Oct 2026 10:23:00 +0200</pubDate><dc:creator>Massimo Nocentini</dc:creator><guid>https://massimo-nocentini.github.io/post/2026-10-21-scm-testsuite-seasoned-schemer-suite/</guid></item><item><title>The (aux continuation) modules</title><link>https://massimo-nocentini.github.io/post/2026-10-21-scm-testsuite-continuation/</link><pubDate>Wed, 21 Oct 2026 10:19:00 +0200</pubDate><dc:creator>Massimo Nocentini</dc:creator><guid>https://massimo-nocentini.github.io/post/2026-10-21-scm-testsuite-continuation/</guid></item><item><title>The (aux category) modules</title><link>https://massimo-nocentini.github.io/post/2026-10-21-scm-testsuite-category/</link><pubDate>Wed, 21 Oct 2026 10:13:00 +0200</pubDate><dc:creator>Massimo Nocentini</dc:creator><guid>https://massimo-nocentini.github.io/post/2026-10-21-scm-testsuite-category/</guid></item><item><title>The (aux timsort) module</title><link>https://massimo-nocentini.github.io/post/2026-10-21-scm-testsuite-timsort/</link><pubDate>Wed, 21 Oct 2026 10:09:00 +0200</pubDate><dc:creator>Massimo Nocentini</dc:creator><guid>https://massimo-nocentini.github.io/post/2026-10-21-scm-testsuite-timsort/</guid></item><item><title>The (aux fds) modules</title><link>https://massimo-nocentini.github.io/post/2026-10-21-scm-testsuite-fds/</link><pubDate>Wed, 21 Oct 2026 10:07:00 +0200</pubDate><dc:creator>Massimo Nocentini</dc:creator><guid>https://massimo-nocentini.github.io/post/2026-10-21-scm-testsuite-fds/</guid></item><item><title>The (aux sxml) module</title><link>https://massimo-nocentini.github.io/post/2026-10-21-scm-testsuite-sxml-suite/</link><pubDate>Wed, 21 Oct 2026 10:06:00 +0200</pubDate><dc:creator>Massimo Nocentini</dc:creator><guid>https://massimo-nocentini.github.io/post/2026-10-21-scm-testsuite-sxml-suite/</guid></item><item><title>The (aux variable) module</title><link>https://massimo-nocentini.github.io/post/2026-10-21-scm-testsuite-variable-suite/</link><pubDate>Wed, 21 Oct 2026 10:05:00 +0200</pubDate><dc:creator>Massimo Nocentini</dc:creator><guid>https://massimo-nocentini.github.io/post/2026-10-21-scm-testsuite-variable-suite/</guid></item><item><title>The (aux tabling) module</title><link>https://massimo-nocentini.github.io/post/2026-10-21-scm-testsuite-tabling-suite/</link><pubDate>Wed, 21 Oct 2026 10:04:00 +0200</pubDate><dc:creator>Massimo Nocentini</dc:creator><guid>https://massimo-nocentini.github.io/post/2026-10-21-scm-testsuite-tabling-suite/</guid></item><item><title>The (aux commons) module</title><link>https://massimo-nocentini.github.io/post/2026-10-21-scm-testsuite-commons-suite/</link><pubDate>Wed, 21 Oct 2026 10:03:00 +0200</pubDate><dc:creator>Massimo Nocentini</dc:creator><guid>https://massimo-nocentini.github.io/post/2026-10-21-scm-testsuite-commons-suite/</guid></item><item><title>Learning tests for CHICKEN Scheme</title><link>https://massimo-nocentini.github.io/post/2026-10-21-scm-testsuite-learning-chicken-suite/</link><pubDate>Wed, 21 Oct 2026 10:02:00 +0200</pubDate><dc:creator>Massimo Nocentini</dc:creator><guid>https://massimo-nocentini.github.io/post/2026-10-21-scm-testsuite-learning-chicken-suite/</guid></item><item><title>Promises</title><link>https://massimo-nocentini.github.io/post/2026-10-21-scm-testsuite-promise-suite/</link><pubDate>Wed, 21 Oct 2026 10:01:00 +0200</pubDate><dc:creator>Massimo Nocentini</dc:creator><guid>https://massimo-nocentini.github.io/post/2026-10-21-scm-testsuite-promise-suite/</guid></item><item><title>The Ackermann function</title><link>https://massimo-nocentini.github.io/post/2026-10-21-scm-testsuite-ackermann-suite/</link><pubDate>Wed, 21 Oct 2026 10:00:00 +0200</pubDate><dc:creator>Massimo Nocentini</dc:creator><guid>https://massimo-nocentini.github.io/post/2026-10-21-scm-testsuite-ackermann-suite/</guid></item><item><title>Concurrent ML for CHICKEN Scheme</title><link>https://massimo-nocentini.github.io/post/cml/</link><pubDate>Thu, 24 Sep 2026 10:00:00 +0100</pubDate><dc:creator>Massimo Nocentini</dc:creator><guid>https://massimo-nocentini.github.io/post/cml/</guid></item><item><title>Inspecting the Payments Graph</title><link>https://massimo-nocentini.github.io/post/payments-graph/</link><pubDate>Fri, 28 Aug 2026 09:58:04 +0100</pubDate><dc:creator>Massimo Nocentini</dc:creator><guid>https://massimo-nocentini.github.io/post/payments-graph/</guid></item><item><title>SIMD</title><link>https://massimo-nocentini.github.io/post/simd-survey/</link><pubDate>Fri, 14 Aug 2026 06:58:04 +0100</pubDate><dc:creator>Massimo Nocentini</dc:creator><guid>https://massimo-nocentini.github.io/post/simd-survey/</guid><description>&lt;p&gt;A reading path and a working survey.&lt;/p&gt;</description></item><item><title>CHICKEN Scheme</title><link>https://massimo-nocentini.github.io/post/chicken-scheme-impl-notes/</link><pubDate>Mon, 10 Aug 2026 10:33:23 +0100</pubDate><dc:creator>Massimo Nocentini</dc:creator><guid>https://massimo-nocentini.github.io/post/chicken-scheme-impl-notes/</guid><description>&lt;p&gt;The latest CHICKEN release is &lt;a href="https://code.call-cc.org"&gt;&lt;em&gt;6.0.0&lt;/em&gt;&lt;/a&gt;, which came out on August 10th, 2026.&lt;/p&gt;</description></item><item><title>Pharo Smalltalk</title><link>https://massimo-nocentini.github.io/post/smalltalk/</link><pubDate>Fri, 17 Jul 2026 09:58:04 +0100</pubDate><dc:creator>Massimo Nocentini</dc:creator><guid>https://massimo-nocentini.github.io/post/smalltalk/</guid><description>&lt;p&gt;Pharo is a pure object-oriented programming language and a powerful environment, focused on simplicity and immediate feedback (think IDE and OS rolled into one).&lt;/p&gt;</description></item><item><title>Neovim</title><link>https://massimo-nocentini.github.io/post/nvim/</link><pubDate>Fri, 03 Jul 2026 09:58:04 +0100</pubDate><dc:creator>Massimo Nocentini</dc:creator><guid>https://massimo-nocentini.github.io/post/nvim/</guid></item><item><title>The SBRAL data structure</title><link>https://massimo-nocentini.github.io/post/sbral/</link><pubDate>Fri, 10 Apr 2026 09:58:04 +0100</pubDate><dc:creator>Massimo Nocentini</dc:creator><guid>https://massimo-nocentini.github.io/post/sbral/</guid><description>&lt;p&gt;We describe a CHICKEN Scheme implementation of &lt;em&gt;skew binary random-access lists&lt;/em&gt;&#10;(SBRALs), a purely functional data structure that provides &lt;span class="katex"&gt;&lt;span class="katex-mathml"&gt;&lt;math xmlns="http://www.w3.org/1998/Math/MathML"&gt;&lt;semantics&gt;&lt;mrow&gt;&lt;mi&gt;O&lt;/mi&gt;&lt;mo stretchy="false"&gt;(&lt;/mo&gt;&lt;mn&gt;1&lt;/mn&gt;&lt;mo stretchy="false"&gt;)&lt;/mo&gt;&lt;/mrow&gt;&lt;annotation encoding="application/x-tex"&gt;O(1)&lt;/annotation&gt;&lt;/semantics&gt;&lt;/math&gt;&lt;/span&gt;&lt;span class="katex-html" aria-hidden="true"&gt;&lt;span class="katex-base"&gt;&lt;span class="katex-strut" style="height:1em;vertical-align:-0.25em;"&gt;&lt;/span&gt;&lt;span class="mord mathnormal" style="margin-right:0.0278em;"&gt;O&lt;/span&gt;&lt;span class="mopen"&gt;(&lt;/span&gt;&lt;span class="mord"&gt;1&lt;/span&gt;&lt;span class="mclose"&gt;)&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt; worst-case&#10;&lt;code&gt;cons&lt;/code&gt;, &lt;code&gt;car&lt;/code&gt;, and &lt;code&gt;cdr&lt;/code&gt; at the front while supporting &lt;span class="katex"&gt;&lt;span class="katex-mathml"&gt;&lt;math xmlns="http://www.w3.org/1998/Math/MathML"&gt;&lt;semantics&gt;&lt;mrow&gt;&lt;mi&gt;O&lt;/mi&gt;&lt;mo stretchy="false"&gt;(&lt;/mo&gt;&lt;mi&gt;log&lt;/mi&gt;&lt;mo&gt;⁡&lt;/mo&gt;&lt;mi&gt;n&lt;/mi&gt;&lt;mo stretchy="false"&gt;)&lt;/mo&gt;&lt;/mrow&gt;&lt;annotation encoding="application/x-tex"&gt;O(\log n)&lt;/annotation&gt;&lt;/semantics&gt;&lt;/math&gt;&lt;/span&gt;&lt;span class="katex-html" aria-hidden="true"&gt;&lt;span class="katex-base"&gt;&lt;span class="katex-strut" style="height:1em;vertical-align:-0.25em;"&gt;&lt;/span&gt;&lt;span class="mord mathnormal" style="margin-right:0.0278em;"&gt;O&lt;/span&gt;&lt;span class="mopen"&gt;(&lt;/span&gt;&lt;span class="mop"&gt;lo&lt;span style="margin-right:0.0139em;"&gt;g&lt;/span&gt;&lt;/span&gt;&lt;span class="mspace" style="margin-right:0.1667em;"&gt;&lt;/span&gt;&lt;span class="mord mathnormal"&gt;n&lt;/span&gt;&lt;span class="mclose"&gt;)&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt; indexed&#10;lookup and persistent update. The module &lt;code&gt;(aux fds sbral)&lt;/code&gt; realises the&#10;structure as a list of weight-annotated complete binary trees whose sizes follow&#10;the skew binary number system. We present the representation, walk through&#10;every exported definition, give complexity bounds, and illustrate the invariants&#10;with a concrete trace drawn from the accompanying test suite.&lt;/p&gt;</description></item><item><title>Pattern matching</title><link>https://massimo-nocentini.github.io/post/guarded-pattern-matching/</link><pubDate>Tue, 24 Feb 2026 10:59:04 +0100</pubDate><dc:creator>Massimo Nocentini</dc:creator><guid>https://massimo-nocentini.github.io/post/guarded-pattern-matching/</guid></item><item><title>The Wolfram Engine</title><link>https://massimo-nocentini.github.io/post/2026-02-17-wolframengine-docker/</link><pubDate>Tue, 17 Feb 2026 09:56:03 +0100</pubDate><dc:creator>Massimo Nocentini</dc:creator><guid>https://massimo-nocentini.github.io/post/2026-02-17-wolframengine-docker/</guid></item><item><title>Running PostgreSQL natively vs into containers</title><link>https://massimo-nocentini.github.io/post/2026-02-06-postgresql-native-vs-docker/</link><pubDate>Fri, 06 Feb 2026 09:58:04 +0100</pubDate><dc:creator>Massimo Nocentini, Richard Uttner</dc:creator><guid>https://massimo-nocentini.github.io/post/2026-02-06-postgresql-native-vs-docker/</guid></item><item><title>The (aux hansei) modules</title><link>https://massimo-nocentini.github.io/post/2026-02-05-scm-testsuite-hanseitest/</link><pubDate>Thu, 05 Feb 2026 10:01:03 +0100</pubDate><dc:creator>Massimo Nocentini</dc:creator><guid>https://massimo-nocentini.github.io/post/2026-02-05-scm-testsuite-hanseitest/</guid></item><item><title>The (aux nondeterministic) module</title><link>https://massimo-nocentini.github.io/post/2026-02-05-scm-testsuite-letnondeterministic-suite/</link><pubDate>Thu, 05 Feb 2026 10:01:02 +0100</pubDate><dc:creator>Massimo Nocentini</dc:creator><guid>https://massimo-nocentini.github.io/post/2026-02-05-scm-testsuite-letnondeterministic-suite/</guid></item><item><title>The (aux stream) modules</title><link>https://massimo-nocentini.github.io/post/2026-02-05-scm-testsuite-stream-suite/</link><pubDate>Thu, 05 Feb 2026 09:58:04 +0100</pubDate><dc:creator>Massimo Nocentini</dc:creator><guid>https://massimo-nocentini.github.io/post/2026-02-05-scm-testsuite-stream-suite/</guid></item><item><title>Learning tests for Scheme</title><link>https://massimo-nocentini.github.io/post/2026-02-05-scm-testsuite-learning-suite/</link><pubDate>Thu, 05 Feb 2026 09:58:04 +0100</pubDate><dc:creator>Massimo Nocentini</dc:creator><guid>https://massimo-nocentini.github.io/post/2026-02-05-scm-testsuite-learning-suite/</guid></item><item><title>The (aux unittest) module</title><link>https://massimo-nocentini.github.io/post/2026-02-05-scm-testsuite-bootstrap-sut/</link><pubDate>Thu, 05 Feb 2026 09:56:03 +0100</pubDate><dc:creator>Massimo Nocentini</dc:creator><guid>https://massimo-nocentini.github.io/post/2026-02-05-scm-testsuite-bootstrap-sut/</guid></item><item><title>TAOCP: Volume 4, Fascicle 6.</title><link>https://massimo-nocentini.github.io/post/taocp-satisfiability/</link><pubDate>Wed, 28 Jan 2026 09:56:03 +0100</pubDate><dc:creator>Donald E. Knuth</dc:creator><guid>https://massimo-nocentini.github.io/post/taocp-satisfiability/</guid></item><item><title>The Stanford GraphBase and CWEB</title><link>https://massimo-nocentini.github.io/post/2026-01-25-sgb/</link><pubDate>Sun, 25 Jan 2026 09:56:03 +0100</pubDate><dc:creator>Donald E. Knuth</dc:creator><guid>https://massimo-nocentini.github.io/post/2026-01-25-sgb/</guid></item><item><title>Rust bindings for Postgres</title><link>https://massimo-nocentini.github.io/post/2026-01-23-libpq-rs/</link><pubDate>Fri, 23 Jan 2026 15:43:03 +0100</pubDate><dc:creator>Massimo Nocentini</dc:creator><guid>https://massimo-nocentini.github.io/post/2026-01-23-libpq-rs/</guid><description>&lt;p&gt;We provide a new set of bindings over &lt;a href="https://www.postgresql.org/docs/current/libpq.html"&gt;Postgresql&#10;&lt;code&gt;libpq&lt;/code&gt;&lt;/a&gt; C library, that&#10;focuses to be Rusty but stick to the original library as much as possible.&lt;/p&gt;</description></item><item><title>Scheme lang: Chez, 48 and Chicken</title><link>https://massimo-nocentini.github.io/post/2026-01-22-chez-scheme/</link><pubDate>Thu, 22 Jan 2026 10:18:13 +0100</pubDate><dc:creator>Massimo Nocentini</dc:creator><guid>https://massimo-nocentini.github.io/post/2026-01-22-chez-scheme/</guid></item><item><title>Rust bindings for igraph</title><link>https://massimo-nocentini.github.io/post/2026-01-12-igraph-rust-bindings/</link><pubDate>Mon, 12 Jan 2026 16:12:22 +0100</pubDate><dc:creator>Massimo Nocentini</dc:creator><guid>https://massimo-nocentini.github.io/post/2026-01-12-igraph-rust-bindings/</guid><description>&lt;p&gt;We provide a new Rust crate &lt;a href="https://github.com/massimo-nocentini/igraph-rs"&gt;igraph-rs&lt;/a&gt;, with&#10;the relative &lt;a href="https://massimo-nocentini.github.io/igraph-rs/igraph/"&gt;documentation&lt;/a&gt;, that&#10;supply bindings over the C library &lt;a href="https://github.com/igraph/igraph"&gt;igraph&lt;/a&gt;.&lt;/p&gt;</description></item><item><title>Hyperfunctions</title><link>https://massimo-nocentini.github.io/post/2026-02-03-hyperfunctions/</link><pubDate>Thu, 08 Jan 2026 18:33:23 +0100</pubDate><dc:creator>Donnacha Kidney, Nicolas Wu</dc:creator><guid>https://massimo-nocentini.github.io/post/2026-02-03-hyperfunctions/</guid></item><item><title>Lua 5.5.0 is out!</title><link>https://massimo-nocentini.github.io/post/2026-01-09-lua-5-5-0-is-out/</link><pubDate>Mon, 22 Dec 2025 10:29:22 +0100</pubDate><dc:creator>Massimo Nocentini</dc:creator><guid>https://massimo-nocentini.github.io/post/2026-01-09-lua-5-5-0-is-out/</guid></item><item><title>Functions and Jordan canonical forms of Riordan matrices</title><link>https://massimo-nocentini.github.io/post/functions-jordan-riordan-matrices/</link><pubDate>Fri, 15 Mar 2019 18:33:23 +0100</pubDate><dc:creator>Massimo Nocentini, Donatella Merlini</dc:creator><guid>https://massimo-nocentini.github.io/post/functions-jordan-riordan-matrices/</guid></item><item><title>The Reasoned Schemer</title><link>https://massimo-nocentini.github.io/post/the-reasoned-schemer/</link><pubDate>Fri, 09 Mar 2018 10:02:03 +0100</pubDate><dc:creator>Daniel P. Friedman, William E. Byrd, Oleg Kiselyov, Jason Hemann</dc:creator><guid>https://massimo-nocentini.github.io/post/the-reasoned-schemer/</guid></item><item><title>Algebraic Generating Functions for Languages Avoiding Riordan Patterns</title><link>https://massimo-nocentini.github.io/post/algebraic-gf-avoiding-patterns/</link><pubDate>Sun, 21 Jan 2018 18:33:23 +0100</pubDate><dc:creator>Massimo Nocentini, Donatella Merlini</dc:creator><guid>https://massimo-nocentini.github.io/post/algebraic-gf-avoiding-patterns/</guid></item><item><title>BiRank</title><link>https://massimo-nocentini.github.io/post/2016-09-20-birank-paper/</link><pubDate>Tue, 20 Sep 2016 10:02:03 +0100</pubDate><dc:creator>Xiangnan He, Ming Gao, Min-Yen Kan, Dingxian Wang</dc:creator><guid>https://massimo-nocentini.github.io/post/2016-09-20-birank-paper/</guid></item><item><title>Axioms for Centrality</title><link>https://massimo-nocentini.github.io/post/2013-08-09-axioms-for-centrality/</link><pubDate>Fri, 09 Aug 2013 18:33:23 +0100</pubDate><dc:creator>Paolo Boldi, Sebastiano Vigna</dc:creator><guid>https://massimo-nocentini.github.io/post/2013-08-09-axioms-for-centrality/</guid></item><item><title>miniKanren, live and untagged</title><link>https://massimo-nocentini.github.io/post/minikanren-live-and-untagged/</link><pubDate>Sun, 09 Sep 2012 18:33:23 +0100</pubDate><dc:creator>William E. Byrd, Eric Holk, Daniel P. Friedman</dc:creator><guid>https://massimo-nocentini.github.io/post/minikanren-live-and-untagged/</guid></item><item><title>Aggregation predicates for µkanren</title><link>https://massimo-nocentini.github.io/post/microkanren-aggregators/</link><pubDate>Sun, 09 Sep 2012 18:33:23 +0100</pubDate><dc:creator>Massimo Nocentini</dc:creator><guid>https://massimo-nocentini.github.io/post/microkanren-aggregators/</guid></item><item><title>Teaching the art of computer programming</title><link>https://massimo-nocentini.github.io/post/teaching-taocp/</link><pubDate>Fri, 06 May 2011 08:59:04 +0100</pubDate><dc:creator>Frank Ruskey</dc:creator><guid>https://massimo-nocentini.github.io/post/teaching-taocp/</guid></item><item><title>Pure, declarative, and constructive arithmetic relations</title><link>https://massimo-nocentini.github.io/post/microkanren-arithmetic/</link><pubDate>Mon, 14 Apr 2008 18:33:23 +0100</pubDate><dc:creator>William E. Byrd, Oleg Kiselyov, Daniel P. Friedman, Chung-Chieh Shan</dc:creator><guid>https://massimo-nocentini.github.io/post/microkanren-arithmetic/</guid></item><item><title>The igraph software package for complex network research</title><link>https://massimo-nocentini.github.io/post/2026-01-12-igraph-paper/</link><pubDate>Sun, 01 Jan 2006 16:12:22 +0100</pubDate><dc:creator>Massimo Nocentini</dc:creator><guid>https://massimo-nocentini.github.io/post/2026-01-12-igraph-paper/</guid></item><item><title>Final shift for call/cc</title><link>https://massimo-nocentini.github.io/post/2002-09-17-final-shift-for-callcc/</link><pubDate>Tue, 17 Sep 2002 18:33:23 +0100</pubDate><dc:creator>Martin Gasbichler, Michael Sperber</dc:creator><guid>https://massimo-nocentini.github.io/post/2002-09-17-final-shift-for-callcc/</guid></item><item><title>Call with Current Continuation Patterns</title><link>https://massimo-nocentini.github.io/post/2001-02-01-callcc-patterns/</link><pubDate>Thu, 01 Feb 2001 18:33:23 +0100</pubDate><dc:creator>Darrell Ferguson, Dwight Deugo</dc:creator><guid>https://massimo-nocentini.github.io/post/2001-02-01-callcc-patterns/</guid></item><item><title>Cogen in six lines</title><link>https://massimo-nocentini.github.io/post/1996-06-15-thiemann-cogen-in-six-lines/</link><pubDate>Sat, 15 Jun 1996 08:59:04 +0100</pubDate><dc:creator>Peter J. Thiemann</dc:creator><guid>https://massimo-nocentini.github.io/post/1996-06-15-thiemann-cogen-in-six-lines/</guid></item><item><title>The Seasoned Schemer</title><link>https://massimo-nocentini.github.io/post/1996-01-31-the-seasoned-schemer/</link><pubDate>Wed, 31 Jan 1996 18:33:23 +0100</pubDate><dc:creator>Daniel P. Friedman, Matthias Felleisen</dc:creator><guid>https://massimo-nocentini.github.io/post/1996-01-31-the-seasoned-schemer/</guid></item><item><title>The Little Schemer</title><link>https://massimo-nocentini.github.io/post/1996-01-31-the-little-schemer/</link><pubDate>Tue, 30 Jan 1996 18:33:23 +0100</pubDate><dc:creator>Daniel P. Friedman, Matthias Felleisen</dc:creator><guid>https://massimo-nocentini.github.io/post/1996-01-31-the-little-schemer/</guid></item><item><title>Adding generic functions to Scheme</title><link>https://massimo-nocentini.github.io/post/1995-04-01-tessman-scheme-generic-functions/</link><pubDate>Sat, 01 Apr 1995 08:59:04 +0100</pubDate><dc:creator>Thant Tessman</dc:creator><guid>https://massimo-nocentini.github.io/post/1995-04-01-tessman-scheme-generic-functions/</guid></item><item><title>Representing monads</title><link>https://massimo-nocentini.github.io/post/1994-02-01-filinski-representing-monads/</link><pubDate>Tue, 01 Feb 1994 18:33:23 +0100</pubDate><dc:creator>Andrzej Filinski</dc:creator><guid>https://massimo-nocentini.github.io/post/1994-02-01-filinski-representing-monads/</guid></item><item><title>Handling control</title><link>https://massimo-nocentini.github.io/post/1993-06-01-sitaram-handling-control/</link><pubDate>Tue, 01 Jun 1993 08:59:04 +0100</pubDate><dc:creator>Dorai Sitaram</dc:creator><guid>https://massimo-nocentini.github.io/post/1993-06-01-sitaram-handling-control/</guid></item></channel></rss>