[plt-scheme] redex is great

From: Jos Koot (jos.koot at telefonica.net)
Date: Sun Feb 22 15:14:30 EST 2009

My pleasure.

Leftmost beta-reduction:

Complete tree of beta-eta reduction with procedures for shortest 
reductions-paths and equality of terms.

Thanks for your interest.
Thanks again to Robby for Redex and his patient and expert help.
Thanks to the PLT team for PLT Scheme.

----- Original Message ----- 
From: "Prabhakar Ragde" <plragde at uwaterloo.ca>
To: <plt-scheme at list.cs.brown.edu>
Sent: Sunday, February 22, 2009 8:05 PM
Subject: Re: [plt-scheme] redex is great

> Jos Koot wrote:
>> I forgot the line ((nf1? V) #t) in nf1?.
>> I should have tested nf1? and nf2?  :) Even testing procedures must be 
>> tested.
> The testing procedure is testing a metafunction, so it should be called a 
> metatest. Then the test of the testing procedure is ... a meta-metatest?
> Can you post a final commented version of everything? One can probably 
> recreate it from this interesting series of posts, but it would be easier 
> not to have to do so. Thanks! --PR
> _________________________________________________
>  For list-related administrative tasks:
>  http://list.cs.brown.edu/mailman/listinfo/plt-scheme 

Posted on the users mailing list.