[isabelle] the height of a Dyck path codified by balanced parentheses



Hello,
  I need to mechanize a theorem involving the height of a Dyck path
codified by balanced parentheses, i.e., the maximum depth of nested
parenthesis in a string. Do you know some library that could be useful for
this task? Thank you in advance.
José M.



This archive was generated by a fusion of Pipermail (Mailman edition) and MHonArc.