TY - GEN
T1 - Towards logical frameworks in the heterogeneous tool set hets
AU - Codescu, Mihai
AU - Horozal, Fulya
AU - Kohlhase, Michael
AU - Mossakowski, Till
AU - Rabe, Florian
AU - Sojakova, Kristina
PY - 2012
Y1 - 2012
N2 - LF is a meta-logical framework that has become a standard tool for representing logics and studying their properties. Its focus is proof theoretic, employing the Curry-Howard isomorphism: propositions are represented as types, and proofs as terms. Hets is an integration tool for logics, logic translations and provers, with a model theoretic focus, based on the meta-framework of institutions, a formalisation of the notion of logical system. In this work, we combine these two worlds. The benefit for LF is that logics represented in LF can be (via Hets) easily connected to various interactive and automated theorem provers, model finders, model checkers, and conservativity checkers - thus providing much more efficient proof support than mere proof checking as is done by systems like Twelf. The benefit for Hets is that (via LF) logics become represented formally, and hence trustworthiness of the implementation of logics is increased, and correctness of logic translations can be mechanically verified. Moreover, since logics and logic translations are now represented declaratively, the effort of adding new logics or translations to Hets is greatly reduced. This work is part of a larger effort of building an atlas of logics and translations used in computer science and mathematics. © 2012 Springer-Verlag.
AB - LF is a meta-logical framework that has become a standard tool for representing logics and studying their properties. Its focus is proof theoretic, employing the Curry-Howard isomorphism: propositions are represented as types, and proofs as terms. Hets is an integration tool for logics, logic translations and provers, with a model theoretic focus, based on the meta-framework of institutions, a formalisation of the notion of logical system. In this work, we combine these two worlds. The benefit for LF is that logics represented in LF can be (via Hets) easily connected to various interactive and automated theorem provers, model finders, model checkers, and conservativity checkers - thus providing much more efficient proof support than mere proof checking as is done by systems like Twelf. The benefit for Hets is that (via LF) logics become represented formally, and hence trustworthiness of the implementation of logics is increased, and correctness of logic translations can be mechanically verified. Moreover, since logics and logic translations are now represented declaratively, the effort of adding new logics or translations to Hets is greatly reduced. This work is part of a larger effort of building an atlas of logics and translations used in computer science and mathematics. © 2012 Springer-Verlag.
UR - https://www.scopus.com/pages/publications/84857744938
UR - https://www.scopus.com/inward/citedby.url?scp=84857744938&partnerID=8YFLogxK
U2 - 10.1007/978-3-642-28412-0_10
DO - 10.1007/978-3-642-28412-0_10
M3 - Conference contribution
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 139
EP - 159
BT - Recent Trends in Algebraic Development Techniques - 20th International Workshop, WADT 2010, Revised Selected Papers
T2 - 20th International Workshop on Algebraic Development Techniques, WADT 2010
Y2 - 1 July 2010 through 4 July 2010
ER -