[Haskell-cafe] Program for displaying graph state in lambda interpreter?

[Ertugrul Söylemez]

Benjamin Redelings <benjamin.redelings at duke.edu> wrote:

>      However, it would be nice to know of any programs that are better
> suited for this.  For example, if I could write <>*<> and draw arrows
> from the placeholders "<>" to the memory location being referenced,
> that would be easier to read.  This is done here
> http://en.wikibooks.org/wiki/Haskell/Graph_reduction to illustrate
> that 'square (1+2)' doesn't evaluate 1+2 twice.  Any ideas?

Have a look at Brent Yorgey's 'diagrams' package:

    <http://projects.haskell.org/diagrams/>

It does not do the automatic balancing that Graphviz does, but is a nice
generic drawing library for diagrams.  In particular I assume that the
initial graph of your programs is actually a tree, for which diagrams
should be very well suitable.


Greets,
Ertugrul

-- 
Key-ID: E5DD8D11 "Ertugrul Soeylemez <es at ertes.de>"
FPrint: BD28 3E3F BE63 BADD 4157  9134 D56A 37FA E5DD 8D11
Keysrv: hkp://subkeys.pgp.net/
-------------- next part --------------
A non-text attachment was scrubbed...
Name: signature.asc
Type: application/pgp-signature
Size: 836 bytes
Desc: not available
URL: <http://www.haskell.org/pipermail/haskell-cafe/attachments/20120602/a5f2a4cb/attachment.pgp>