http://www-ps.informatik.uni-kiel.de/currywiki/ Sun, 07 Sep 2008 23:52:50 +0200 FeedCreator 1.7.2-ppt DokuWiki http://www-ps.informatik.uni-kiel.de/currywiki/lib/images/favicon.ico http://www-ps.informatik.uni-kiel.de/currywiki/ http://www-ps.informatik.uni-kiel.de/currywiki/tools/strictcheck?rev=1220629855&do=diff Introduction StrictCheck was developed by Olaf Chitil and is supposed to test whether a function is unnecessarily strict. There is a separate page which demonstrates the necessity of a tool like StrictCheck via implementations of natural numbers. In the long term my goal is to improve the suggestions made by StrictCheck because in some cases StrictCheck is too ambitious. We consider the functional logic programming language Curry here because the usefulness of least strictness is more evident … Jan Christiansen tools Fri, 05 Sep 2008 17:50:55 +0200 http://www-ps.informatik.uni-kiel.de/currywiki/fun/rationals?rev=1220343017&do=diff This is a view at the Functional Pearl "Enumerating the Rationals" 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. Jan Christiansen fun Tue, 02 Sep 2008 10:10:17 +0200 http://www-ps.informatik.uni-kiel.de/currywiki/fun/naturals?rev=1220338973&do=diff 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… Jan Christiansen fun Tue, 02 Sep 2008 09:02:53 +0200 http://www-ps.informatik.uni-kiel.de/currywiki/documentation/tutorial?rev=1220282104&do=diff This web page contains a tutorial introduction to the declarative programming language Curry. Note that the tutorial is not yet finalized. However, it might be already useful for people who want to learn programming with Curry. For a detailed definition of all features of Curry, you should look into the Curry Report. Michael Hanus documentation Mon, 01 Sep 2008 17:15:04 +0200 http://www-ps.informatik.uni-kiel.de/currywiki/start?rev=1220281462&do=diff A Truly Integrated Functional Logic Language Curry is a universal programming language aiming to amalgamate the most important declarative programming paradigms, namely functional programming and logic programming. Moreover, it also covers the most important operational principles developed in the area of integrated functional logic languages: “residuation” and “narrowing” (there is an older survey and a newer survey on functional logic programming). Michael Hanus Mon, 01 Sep 2008 17:04:22 +0200