For testing automated theorem provers we have Seventy-Five Problems for TestingAutomatic Theorem Provers by Pelletier.Are there any such standard/well regarded tests for a -calculus that verify the evaluation?EDITThe best -Calculus evaluator I have found so far is:Lambda calculus reduction workbench with info here.I like this one because1. It is a working example that seems to corretly pass every example I can find.2. Has a trace option for the output.3. Can do multiple reduction strategies    * normal order    * call-by-name    * head spine reduction    * call-by-value    * applicative order    * hybrid normal order    * hybrid applicative order4. Has a list of pre defined abbreavtions such as    * S, K, I    * 0 - 5    * pair    * pred    * succ    * add    * mul5. Has source code in SML  
Test cases for -Calculus
reference request;lambda calculus;software testing