The paper presents a refined method of extracting reasonable and sometimes unexpected programs from classical proofs of formulas of the form . We also generalize previously known results, since no longer needs to be quantifier-free, but only has to belong to a strictly larger class of so-called “goal formulas”. Furthermore we allow unproven lemmas in the proof of , where is a so-called “definite” formula.