Abstract

AbstractThe theory of institutions provides an abstract mathematical framework for specifying logical systems and their semantic relationships. Institutions are based on category theory and have deep roots in a well-developed branch of algebraic specification. However, there are no machine-assisted proofs of correctness for institution-theoretic constructions, making them difficult to incorporate into mainstream formal methods. This paper provides an overview of our approach to formalizing the theory of institutions in the Coq proof assistant. We instantiate this framework with the institutions \( FOPEQ \) for first-order predicate logic and \( EVT \) for the Event-B specification language.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call