F. Blanqui, Gilles Dowek, Émilie Grienenberger, Gabriel Hondet, Franccois Thir'e
{"title":"类型理论的模块化构造","authors":"F. Blanqui, Gilles Dowek, Émilie Grienenberger, Gabriel Hondet, Franccois Thir'e","doi":"10.46298/lmcs-19(1:12)2023","DOIUrl":null,"url":null,"abstract":"The lambda-Pi-calculus modulo theory is a logical framework in which many\ntype systems can be expressed as theories. We present such a theory, the theory\nU, where proofs of several logical systems can be expressed. Moreover, we\nidentify a sub-theory of U corresponding to each of these systems, and prove\nthat, when a proof in U uses only symbols of a sub-theory, then it is a proof\nin that sub-theory.","PeriodicalId":314387,"journal":{"name":"Log. Methods Comput. Sci.","volume":"86 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"A modular construction of type theories\",\"authors\":\"F. Blanqui, Gilles Dowek, Émilie Grienenberger, Gabriel Hondet, Franccois Thir'e\",\"doi\":\"10.46298/lmcs-19(1:12)2023\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The lambda-Pi-calculus modulo theory is a logical framework in which many\\ntype systems can be expressed as theories. We present such a theory, the theory\\nU, where proofs of several logical systems can be expressed. Moreover, we\\nidentify a sub-theory of U corresponding to each of these systems, and prove\\nthat, when a proof in U uses only symbols of a sub-theory, then it is a proof\\nin that sub-theory.\",\"PeriodicalId\":314387,\"journal\":{\"name\":\"Log. Methods Comput. Sci.\",\"volume\":\"86 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-10-31\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Log. Methods Comput. Sci.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.46298/lmcs-19(1:12)2023\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Log. Methods Comput. Sci.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.46298/lmcs-19(1:12)2023","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
The lambda-Pi-calculus modulo theory is a logical framework in which many
type systems can be expressed as theories. We present such a theory, the theory
U, where proofs of several logical systems can be expressed. Moreover, we
identify a sub-theory of U corresponding to each of these systems, and prove
that, when a proof in U uses only symbols of a sub-theory, then it is a proof
in that sub-theory.