Fixpoint unary_preserv (e : BC) : bool :=
match e with
| zero => true
| proj n s j => true
| succ b => b
| pred => true
| cond => true
| rec g h0 h1 => unary_preserv g  &&
unary_preserv h0 &&
unary_preserv h1
| comp _ _ h nl sl => unary_preserv h &&
forallb unary_preserv nl &&
forallb unary_preserv sl
end.
(** * Zero  - with any arities (n, s) *)
(** * One  - with any arities (n, s) *)
Definition one_e (n s:nat) : BC :=
comp n s (comp 0 0 (succ true) nil (zero :: nil)) nil nil.
(** * Successor  - arities: (1, 0) *)
Definition succ_e : BC := succ true.
(** * Conversion from [nat] to [BC]  - with any arities (n, s) *)
Fixpoint nat2BC (n s x:nat) : BC :=
match x with
| 0 => zero_e n s
| S x' => comp n s succ_e nil [nat2BC n s x']
end.
Opaque succ_e.
(** * Addition  - arities: (1,1) *)
Definition plus_e : BC :=
rec (proj 0 1 0)
(comp 1 2 succ_e nil ((proj 1 2 1) :: nil))
(comp 1 2 succ_e nil ((proj 1 2 1) :: nil)).
Opaque plus_e.
Fixpoint plusl_e (n:nat)(el:list BC) : BC :=
match el with
| nil => zero_e n 0
| e' :: el' => comp n 0 plus_e [e'] [plusl_e n el']
end.
(** * Logical or  - arities: (1,1) *)
Notation or_e := plus_e (only parsing).
(** * Multiplication  - arities: (2,0) *)
Definition mult_e : BC :=
rec (zero_e 1 0)
(comp 2 1 plus_e ((proj 2 0 1) :: nil) ((proj 2 1 2) :: nil))
(comp 2 1 plus_e ((proj 2 0 1) :: nil) ((proj 2 1 2) :: nil)).
Opaque mult_e.
(** Logical and  - arities: (2,0) *)
Notation and_e := mult_e (only parsing).
(** * Minus (with reversed arguments)  - arities: (1,1) *)
Definition minus_rev_e : BC :=
rec (proj 0 1 0)
(comp 1 2 pred nil ((proj 1 2 1) :: nil))
(comp 1 2 pred nil ((proj 1 2 1) :: nil)).

Lemma minus_rev_correct :
forall m n, length (sem minus_rev_e [n] [m]) = (length m) - (length n).