HaskellTaming Selective Strictness

This tool allows you to experiment with the method described in the article “Refined Typing to Localize the Impact of Forced Strictness on Free Theorems” (Acta Informatica, to appear) by Daniel Seidel and Janis Voigtländer.

You may also want to try the following related tools:

To get a quick impression about the influence of strictness, toggle the let expressions between strict let! and non-strict let.

You can also enter your own term, e.g. “/\a.\x::a.\f::forall b.b->Int.seq f_{Int} (f_{a} x)” or “\x::a.[]_{Int}”.

Note that recursive let expressions are not allowed.

You can download the source code of the underlying library and of the webinterface itself.

© 2009-2011 Daniel Seidel <ds@iai.uni-bonn.de>