What Sequential Games, the Tychonoff Theorem and the Double-Negation Shift have in Common

Cantor Set by Kevin van Aelst
A recent paper by Escardo and Oliva, to appear in MSFP 2010, relates diverse aspects of computing, in the form of a literate Haskell program. I've written a further note inspired by theirs, also as a literate Haskell program. My code improves on theirs in a few ways, notably by using type classes to characterize valuation types, and by using QuickCheck to describe and check relevant properties. My note can be read stand-alone, but is best read in conjunction with Escardo and Oliva's paper. (The photo above is Cantor Set by Kevin van Aelst.)

Today I posted an updated version of my note, which adds a little intuition to explain how it succeeds in finding the supremum of an infinite list in finite time.
In case you won't see Kalani Thielen's bug report: http://lambda-the-ultimate.org/node/4037#comment-61729
A new reference:

Martin Escardo and Paulo Oliva, Sequential Games and optimal
strategies, Proceedings of the Royal Society A, published online 1 December 2010. http://rspa.royalsocietypublishing.org/content/early/2010/11/26/rspa.2010.0471
Post a Comment

<< Home

This page is powered by Blogger. Isn't yours?