proposition: Lemma gword_to_word_cut n w: gword_to_word n w = atom_to_word n (thead w) ++ gword_to_word' w.
proof: Proof. destruct w. now rewrite app_nil_r. reflexivity. Qed.
imports: Coq.PArith.BinPosDef denum lset sums normalisation kat ka_completeness untyping regex gregex lsyntax syntax lang glang boolean atoms