fact: Definition lp (l: letter): positive := match l with | l_pos n x => mk_sum (inl (mk_sum (inl (mk_pair (n, mk_ord x))))) | l_neg n x => mk_sum (inl (mk_sum (inr (mk_pair (n, mk_ord x))))) | l_var i => mk_sum (inr i) end.
imports: Coq.PArith.BinPosDef denum lset sums normalisation kat ka_completeness untyping regex gregex lsyntax syntax lang glang boolean atoms