Hello dainichi,
Monday, February 25, 2008, 2:46:20 AM, you wrote:
Jersey. (Sorry, this will probably make me unpopular here on
Haskell-cafe, but the ability to use references was just too tempting,
and I'm not too experienced with purely functional data structures).
we have references,
On 2/24/08, [EMAIL PROTECTED] [EMAIL PROTECTED] wrote:
(define nth (lambda (n xs) (if (= n 0)(head xs)(nth (- n 1) (tail xs)
nth n (x:xs) = if n == 0 then x else nth (n-1) xs
I'm guessing it's some kind of lisp variant?
(define nth (lambda (n xs) (cond ((consp xs) (if (= n 0) (head xs)
Kai wrote:
Thank you all for showing interest and responding.
Check out http://thyer.name/lambda-animator/. Requires Java.
Wow, this is SUCH a cool tool. Best discovery in a long time! I think
I need to brush up on my lambda-calculus, because it took me some time
to figure out what settings
I think HOPS is what you are looking for
http://www.cas.mcmaster.ca/~kahl/HOPS/
It may advertize itself otherwise, but the main thing you 'see' when
running programs in fully explicit mode is exactly all the graph reductions.
Jacques
___
Is there any place that can we download the HOPS program itself? It
unfortunately doesn't seem available from that page.
On 24/02/2008, Jacques Carette [EMAIL PROTECTED] wrote:
I think HOPS is what you are looking for
http://www.cas.mcmaster.ca/~kahl/HOPS/
It may advertize itself otherwise,
Thank you all for showing interest and responding.
Check out http://thyer.name/lambda-animator/. Requires Java.
Wow, this is SUCH a cool tool. Best discovery in a long time! I think
I need to brush up on my lambda-calculus, because it took me some time
to figure out what settings to use to get
dainichi wrote:
Now to the point: Wouldn't it be great if I had a visual tool that
visually
showed me the graph while the above evaluation unfolded? I could use it to
show some of my co-workers to whom laziness is a mystery, what it's all
about.
Check out
Hi Haskell-Cafe,
I'm relatively new to Haskell, but have a background with SML. One of the
things that amaze me about Haskell is lazy graph reduction, e.g. how the
graph unfolds during the evaluation of, say,
let fibs = 1 : 1 : zipWith (+) fibs (tail fibs) in take 10 fibs
Lazy lists can be
2008/2/22 [EMAIL PROTECTED]:
Does anybody know if such a tool exists? I'd be grateful for pointers if it
does. I very much doubt that I'm the first person who has thoughts like
this, but then again, who knows. People who really know Haskell might think
this is too trivial a task to really be
Hello dainichi,
Friday, February 22, 2008, 6:55:54 PM, you wrote:
If nothing similar exists, I was thinking about creating such a
tool (i.e. an interpreter with additional graph-displaying features)
not exactly this, but now i'm reading introduction into Q language [1]
which says on p.11 The
10 matches
Mail list logo
