% For the computation (little step) semantics of the lambda calculus, do

	#load "abstract_syntax.mod", "substitution.mod", "normal_form.mod", 
               "reductions.mod", "rtc.mod".
	#query abstract_syntax, substitution, normal_form,
		reductions, rtc.

% and then type in, for example,

  (rtc reducesto) (ap (lambda "x" (ap (var "f") (var "y"))) (var "z")) Answer.

% and type a

	;

% to see each step of the reduction sequence.


% If you want to force normal-order evaluation, do

	#load "abstract_syntax.mod", "substitution.mod", "normal_form.mod", 
               "computation_call_by_name.mod", "rtc.mod".
	#query abstract_syntax, substitution, normal_form,
	       computation_call_by_name, rtc.

% first and then proceed as above.

% Hint: use concrete strings for variables, (var "x"), not logical variables.