Automata theory; Programmable logic controllers; Theorem proving; Calculus of inductive constructions; Computer-aided proofs; Higher-order abstract syntax; Interactive development; Natural deduction proofs; Problematic issues; Proof system

Formalizing a lazy substitution proof system for μ-calculus in the Calculus of Inductive Constructions

We present a Natural Deduction proof system for the pro- positional modal μ-calculus, and its formalization in the Calculus of In- ductive Constructions. We address several problematic issues, such as the use of higher-order abstract syntax in …