Hvitved is a great writer, and his Chapter 2 has a few good ideas -- blame assignment, obligation vs breach distinction, assignment of a deadline to every obligation, runtime monitoring. But the vast majority of it is the formulaic fluff and trivial proofs of the CMU school of computer scientists that call themselves "type theorists". Also known as "Theory B" in complexity theory and algorithms circles. I got sucked into that mess in my last couple years as an undergrad at McGill.
Despite being executable, which is great, I think CSL is worse overall than plain-English legal drafting. Maybe it is better overall than typical legalese. If there is interest, I can show you how I think Hvitved's examples should be written up. I think I can do it, without much trouble, in a decidable SMT theory without sacrificing readability, in which case you'll be able to pose questions that get answered instantly.
Formalized law need not look any more obscure than English + a few more parentheses + a few bound variables (which can usually be replaced with a formal analogue of pronouns).