[Haskell-cafe] ANNOUNCE: LambdaINet-0.1.0, Graphical Interaction
Net Evaluator for Optimal Evaluation
ninegua at gmail.com
Mon Sep 14 22:08:44 EDT 2009
I just bumped the version to 0.1.1 that fixes an embarrassing bug,
i.e., the first example shown on the screen was actually wrong.
I took a screenshot of the interaction net showing (church 2) f x,
i.e., (\f x -> f (f x)) f x together with on-screen help messages. It
is the first example right after you start the LambdaINet application,
and erase redundant nodes, relayout, and auto zoom (key sequence E, L,
Space"). It will reduce to f (f x) if you hit R key, or if you want to
see the step by step outermost reduction, just keep hitting O key.
The picture is here http://www.thev.net/download/church_2_f_x-with-helpmsg.jpg
Pressing 1 to 9 will show a more complicated example that actually
demonstrates the power of optimal evaluation: opt n = (church n)
(church 2) i i. Standard call-by-need takes 37 beta reductions to
evaluate opt 4, but optimal only needs 15.
On 9/14/09, Bas van Dijk <v.dijk.bas at gmail.com> wrote:
> On Mon, Sep 14, 2009 at 7:36 AM, Paul L <ninegua at gmail.com> wrote:
>> It's available on Hackage DB at
> Nice! Screenshots anywhere?
Yale Haskell Group
More information about the Haskell-Cafe