Some tuning:
- finite now uses rev_append (tail recursive!) to append stopper, because @
needs to much stack space for large strings
- repeat is now tail recursive
consts bool2if :: boolex => ifex
primrec
"bool2if (Const b) = CIF b"
"bool2if (Var x) = VIF x"
"bool2if (Neg b) = IF (bool2if b) (CIF False) (CIF True)"
"bool2if (And b c) = IF (bool2if b) (bool2if c) (CIF False)"