<?xml version='1.0' encoding='ISO-8859-1'?>
<!DOCTYPE rss
[<!ENTITY % HTMLlat1 PUBLIC "-//W3C//ENTITIES Latin 1 for XHTML//EN"
 "http://www.w3.org/TR/xhtml1/DTD/xhtml-lat1.ent">]><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>okmij.org</title>
<description>okmij.org</description>
<language>en-us</language>
<ttl>21600</ttl>
<generator>HSXML-&gt;RSS</generator>
<pubDate>5 May 2013 12:00:00 GMT</pubDate>
<link>http://okmij.org/ftp/README.html</link>
<atom:link href="http://okmij.org/ftp/rss.xml" rel="self" type="application/rss+xml"/>
<item><title>Constant-space XML processing with well-formedness check</title>
<description>Ibid.</description>
<link>http://okmij.org/ftp/Streams.html#xml-incr</link>
<guid>http://okmij.org/ftp/Streams.html#xml-incr</guid>
<pubDate>5 May 2013 12:00:00 GMT</pubDate></item>
<item><title>A sharper example of Breaking referential transparency with unsafeInterleaveST</title>
<description>Ibid.</description>
<link>http://okmij.org/ftp/Haskell/index.html#unsafeInterleaveST</link>
<guid>http://okmij.org/ftp/Haskell/index.html#unsafeInterleaveST</guid>
<pubDate>5 May 2013 12:00:00 GMT</pubDate></item>
<item><title>Better examples of Lazy IO breaking equational reasoning</title>
<description>Ibid.</description>
<link>http://okmij.org/ftp/Haskell/index.html#lazyIO-not-True</link>
<guid>http://okmij.org/ftp/Haskell/index.html#lazyIO-not-True</guid>
<pubDate>5 May 2013 12:00:00 GMT</pubDate></item>
<item><title>Lazy IO breaks equational reasoning</title>
<description>Ibid.</description>
<link>http://okmij.org/ftp/Haskell/index.html#lazyIO-not-True?</link>
<guid>http://okmij.org/ftp/Haskell/index.html#lazyIO-not-True?</guid>
<pubDate>5 Apr 2013 12:00:00 GMT</pubDate></item>
<item><title>MetaOCaml as a domain-specific optimizer: Shonan Challenge 1</title>
<description>Ibid.</description>
<link>http://okmij.org/ftp/meta-programming/Shonan1.html</link>
<guid>http://okmij.org/ftp/meta-programming/Shonan1.html</guid>
<pubDate>5 Apr 2013 12:00:00 GMT</pubDate></item>
<item><title>Efficient and insightful type generalization</title>
<description>Ibid.</description>
<link>http://okmij.org/ftp/ML/generalization.html</link>
<guid>http://okmij.org/ftp/ML/generalization.html</guid>
<pubDate>7 Mar 2013 12:00:00 GMT</pubDate></item>
<item><title>What polymorphism and garbage collection have in common</title>
<description>Ibid.</description>
<link>http://okmij.org/ftp/ML/generalization.html#gen-mismanagement</link>
<guid>http://okmij.org/ftp/ML/generalization.html#gen-mismanagement</guid>
<pubDate>7 Mar 2013 12:00:00 GMT</pubDate></item>
<item><title>History of discovery of type levels</title>
<description>Ibid.</description>
<link>http://okmij.org/ftp/ML/generalization.html#history</link>
<guid>http://okmij.org/ftp/ML/generalization.html#history</guid>
<pubDate>7 Mar 2013 12:00:00 GMT</pubDate></item>
<item><title>Understanding parts of the OCaml type checker</title>
<description>Ibid.</description>
<link>http://okmij.org/ftp/ML/generalization.html#levels-OCaml</link>
<guid>http://okmij.org/ftp/ML/generalization.html#levels-OCaml</guid>
<pubDate>7 Mar 2013 12:00:00 GMT</pubDate></item>
<item><title>Re-implemented BER MetaOCaml N100 for OCaml 4.00.1</title>
<description>Ibid.</description>
<link>http://okmij.org/ftp/ML/MetaOCaml.html</link>
<guid>http://okmij.org/ftp/ML/MetaOCaml.html</guid>
<pubDate>5 Feb 2013 12:00:00 GMT</pubDate></item>
<item><title>Shonan Challenge for Generative Programming: PEPM 2013 paper</title>
<description>Ibid.</description>
<link>http://okmij.org/ftp/meta-programming/HPC.html#shonan-challenge</link>
<guid>http://okmij.org/ftp/meta-programming/HPC.html#shonan-challenge</guid>
<pubDate>5 Feb 2013 12:00:00 GMT</pubDate></item>
<item><title>Simple Generators v. Lazy Evaluation</title>
<description>Ibid.</description>
<link>http://okmij.org/ftp/continuations/PPYield/index.html</link>
<guid>http://okmij.org/ftp/continuations/PPYield/index.html</guid>
<pubDate>1 Jan 2013 12:00:00 GMT</pubDate></item>
<item><title>Simple generators in Haskell</title>
<description>Ibid.</description>
<link>http://okmij.org/ftp/continuations/PPYield/index.html#gen-Haskell</link>
<guid>http://okmij.org/ftp/continuations/PPYield/index.html#gen-Haskell</guid>
<pubDate>1 Jan 2013 12:00:00 GMT</pubDate></item>
<item><title>Incremental, Linear Pretty-printing</title>
<description>Ibid.</description>
<link>http://okmij.org/ftp/continuations/PPYield/index.html#pp</link>
<guid>http://okmij.org/ftp/continuations/PPYield/index.html#pp</guid>
<pubDate>1 Jan 2013 12:00:00 GMT</pubDate></item>
<item><title>Non-deterministic choice in a conventional programming language: Enough for logic programming?</title>
<description>Ibid.</description>
<link>http://okmij.org/ftp/kakuritu/logic-programming.html#vs-prolog</link>
<guid>http://okmij.org/ftp/kakuritu/logic-programming.html#vs-prolog</guid>
<pubDate>1 Jan 2013 12:00:00 GMT</pubDate></item>
<item><title>BER MetaOCaml, version N004</title>
<description>Ibid.</description>
<link>http://okmij.org/ftp/ML/index.html#ber-metaocaml</link>
<guid>http://okmij.org/ftp/ML/index.html#ber-metaocaml</guid>
<pubDate>1 Jan 2013 12:00:00 GMT</pubDate></item>
<item><title>Delimited control in OCaml, abstractly and concretely: The greatly expanded, journal version of the paper</title>
<description>Ibid.</description>
<link>http://okmij.org/ftp/continuations/implementations.html#delimcc-paper</link>
<guid>http://okmij.org/ftp/continuations/implementations.html#delimcc-paper</guid>
<pubDate>1 Jan 2013 12:00:00 GMT</pubDate></item>
<item><title>Typed Tagless Final Interpreters: published lecture notes</title>
<description>Ibid.</description>
<link>http://okmij.org/ftp/tagless-final/course/index.html#lecture</link>
<guid>http://okmij.org/ftp/tagless-final/course/index.html#lecture</guid>
<pubDate>1 Jan 2013 12:00:00 GMT</pubDate></item>
<item><title>Genuine dependent types and faking them on the example of type-safe printf</title>
<description>Ibid.</description>
<link>http://okmij.org/ftp/typed-formatting/index.html#dep-type</link>
<guid>http://okmij.org/ftp/typed-formatting/index.html#dep-type</guid>
<pubDate>1 Dec 2012 12:00:00 GMT</pubDate></item>
<item><title>Incremental XML parsing with Iteratees</title>
<description>Ibid.</description>
<link>http://okmij.org/ftp/Streams.html#xml</link>
<guid>http://okmij.org/ftp/Streams.html#xml</guid>
<pubDate>1 Dec 2012 12:00:00 GMT</pubDate></item>
<item><title>A new version of the HList library, with fancier kinds and more type-level computations with no run-time overhead</title>
<description>Ibid.</description>
<link>http://okmij.org/ftp/Haskell/types.html#HList</link>
<guid>http://okmij.org/ftp/Haskell/types.html#HList</guid>
<pubDate>1 Dec 2012 12:00:00 GMT</pubDate></item>
<item><title>Maximal munch, committed choice and nested inference</title>
<description>Ibid.</description>
<link>http://okmij.org/ftp/kakuritu/logic-programming.html#many</link>
<guid>http://okmij.org/ftp/kakuritu/logic-programming.html#many</guid>
<pubDate>5 Nov 2012 12:00:00 GMT</pubDate></item>
<item><title>Impredicativity Bites Further</title>
<description>Ibid.</description>
<link>http://okmij.org/ftp/Haskell/impredicativity-bites.html</link>
<guid>http://okmij.org/ftp/Haskell/impredicativity-bites.html</guid>
<pubDate>5 Nov 2012 12:00:00 GMT</pubDate></item>
<item><title>Guess Lazily! Making a program guess, and guess well</title>
<description>Ibid.</description>
<link>http://okmij.org/ftp/kakuritu/logic-programming.html#StrangeLoop</link>
<guid>http://okmij.org/ftp/kakuritu/logic-programming.html#StrangeLoop</guid>
<pubDate>9 Oct 2012 12:00:00 GMT</pubDate></item>
<item><title>`Reversible&apos; parser combinators</title>
<description>Ibid.</description>
<link>http://okmij.org/ftp/kakuritu/logic-programming.html#parsec</link>
<guid>http://okmij.org/ftp/kakuritu/logic-programming.html#parsec</guid>
<pubDate>9 Oct 2012 12:00:00 GMT</pubDate></item>
<item><title>Generating optimal stencil code: improved and simplified version. The generated code assuredly has no array-bound errors.</title>
<description>Ibid.</description>
<link>http://okmij.org/ftp/meta-programming/HPC.html#stencil</link>
<guid>http://okmij.org/ftp/meta-programming/HPC.html#stencil</guid>
<pubDate>9 Oct 2012 12:00:00 GMT</pubDate></item>
<item><title>Generating optimal stencil code: solving a Shonan Challenge problem</title>
<description>Ibid.</description>
<link>http://okmij.org/ftp/meta-programming/HPC.html</link>
<guid>http://okmij.org/ftp/meta-programming/HPC.html</guid>
<pubDate>1 Sep 2012 12:00:00 GMT</pubDate></item>
<item><title>Breaking referential transparency with unsafeInterleaveST</title>
<description>Ibid.</description>
<link>http://okmij.org/ftp/Haskell/misc.html#unsafeInterleaveST</link>
<guid>http://okmij.org/ftp/Haskell/misc.html#unsafeInterleaveST</guid>
<pubDate>1 Sep 2012 12:00:00 GMT</pubDate></item>
<item><title>Observing strictness</title>
<description>Ibid.</description>
<link>http://okmij.org/ftp/Haskell/misc.html#observe-strictness</link>
<guid>http://okmij.org/ftp/Haskell/misc.html#observe-strictness</guid>
<pubDate>1 Sep 2012 12:00:00 GMT</pubDate></item>
<item><title>An argument against call/cc</title>
<description>Ibid.</description>
<link>http://okmij.org/ftp/continuations/against-callcc.html</link>
<guid>http://okmij.org/ftp/continuations/against-callcc.html</guid>
<pubDate>9 Aug 2012 12:00:00 GMT</pubDate></item>
<item><title>call/cc implements shift? A good question</title>
<description>Ibid.</description>
<link>http://okmij.org/ftp/continuations/against-callcc.html#traps</link>
<guid>http://okmij.org/ftp/continuations/against-callcc.html#traps</guid>
<pubDate>9 Aug 2012 12:00:00 GMT</pubDate></item>
<item><title>A new version of HSXML: Typed SXML with overloaded string literals and many simplifications</title>
<description>Ibid.</description>
<link>http://okmij.org/ftp/Scheme/xml.html#typed-SXML</link>
<guid>http://okmij.org/ftp/Scheme/xml.html#typed-SXML</guid>
<pubDate>9 Aug 2012 12:00:00 GMT</pubDate></item></channel></rss>