Both iterative and recursive programs for computing generalizations of functions which obtain the factorial of an integer, which reverse the order of symbols on a list and which obtain the approximate integral of a function are given as recursive definitions using conditional expressions. The equivalence of the iterative and recursive definitions are proved and a general theorem on equivalence, from which some of the results may be deduced, is stated and proved.†