{"title":"Automatically Deriving Schematic Theorems for Dynamic Contexts","authors":"Olivier Savary Bélanger, Kaustuv Chaudhuri","doi":"10.1145/2631172.2631181","DOIUrl":null,"url":null,"abstract":"Hypothetical judgments go hand-in-hand with higher-order abstract syntax for meta-theoretic reasoning. The dynamic assumptions of these judgments often have a simple regular structure of repetitions of related assumptions; reflecting on this regular structure can let us derive a number of structural properties about the elements of the context automatically. We present an extension of the Abella theorem prover with a new mechanism for defining particular kinds of regular context relations, called schemas, and tacticals to derive theorems from these schemas as needed. Importantly, our extension leaves the trusted kernel of Abella unchanged. We show that these tacticals can eliminate many commonly encountered kinds of administrative lemmas that would otherwise have to be proven manually, which is a common source of complaints from Abella users.","PeriodicalId":262518,"journal":{"name":"International Workshop on Logical Frameworks and Meta-Languages: Theory and Practice","volume":"12 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-07-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Workshop on Logical Frameworks and Meta-Languages: Theory and Practice","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/2631172.2631181","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 8
Abstract
Hypothetical judgments go hand-in-hand with higher-order abstract syntax for meta-theoretic reasoning. The dynamic assumptions of these judgments often have a simple regular structure of repetitions of related assumptions; reflecting on this regular structure can let us derive a number of structural properties about the elements of the context automatically. We present an extension of the Abella theorem prover with a new mechanism for defining particular kinds of regular context relations, called schemas, and tacticals to derive theorems from these schemas as needed. Importantly, our extension leaves the trusted kernel of Abella unchanged. We show that these tacticals can eliminate many commonly encountered kinds of administrative lemmas that would otherwise have to be proven manually, which is a common source of complaints from Abella users.