<?xml version="1.0" encoding="utf-8"?>
<!-- generator="FeedCreator 1.7.2-ppt DokuWiki" -->
<?xml-stylesheet href="http://www-ps.informatik.uni-kiel.de/currywiki/lib/exe/css.php?s=feed" type="text/css"?>
<rss version="2.0">
    <channel>
        <title>curryWiki fun</title>
        <description></description>
        <link>http://www-ps.informatik.uni-kiel.de/currywiki/</link>
        <lastBuildDate>Sat, 21 Nov 2009 17:43:51 +0100</lastBuildDate>
        <generator>FeedCreator 1.7.2-ppt DokuWiki</generator>
        <image>
            <url>http://www-ps.informatik.uni-kiel.de/currywiki/lib/images/favicon.ico</url>
            <title>curryWiki</title>
            <link>http://www-ps.informatik.uni-kiel.de/currywiki/</link>
        </image>
        <item>
            <title>Implementing Least-Strict Natural Numbers</title>
            <link>http://www-ps.informatik.uni-kiel.de/currywiki/fun/naturals?rev=1220338973</link>
            <description>Introduction

 On this page I want to summarize some insights about the behaviour of natural number implementations (in respect to non-strictness). I have gained these by using a tool called StrictCheck. StrictCheck was developed by Olaf Chitil and is supposed to test whether a function is unnecessarily strict. In the long term my goal is to improve the suggestions made by StrictCheck because in some cases StrictCheck is too ambitious. More Information about the development of StrictCheck can be…</description>
            <pubDate>Tue, 02 Sep 2008 09:02:53 +0100</pubDate>
        </item>
        <item>
            <title>Enumerating the Rationals, logically</title>
            <link>http://www-ps.informatik.uni-kiel.de/currywiki/fun/rationals?rev=1220343017</link>
            <description>This is a view at the Functional Pearl &quot;Enumerating the Rationals&quot; from a (functional) logical point of view. 

Boolean Lists

 We start with the implementation of igcd. This function takes a rational number which is represented by a denominator and a numerator and yields a list of booleans. This list represents the decisions that would be made in Euclid's subtractive algorithm for computing greatest common divisor.</description>
            <pubDate>Tue, 02 Sep 2008 10:10:17 +0100</pubDate>
        </item>
    </channel>
</rss>
