fact: Definition pl (p: positive): letter := match get_sum p with | inl p => match get_sum p with | inl p => let '(n,p) := get_pair p in match get_ord _ p with None => l_var 1 | Some x => l_pos n x end | inr p => let '(n,p) := get_pair p in match get_ord _ p with None => l_var 1 | Some x => l_neg n x end end | inr i => l_var i end.
imports: Coq.PArith.BinPosDef denum lset sums normalisation kat ka_completeness untyping regex gregex lsyntax syntax lang glang boolean atoms