发布求助
文献互助 智能选刊 最新文献

Types for Proofs and Programs最新文献

筛选
英文 中文
Stateless HOL
Types for Proofs and Programs Pub Date : 2011-03-16 DOI: 10.4204/EPTCS.53.4
F. Wiedijk
{"title":"Stateless HOL","authors":"F. Wiedijk","doi":"10.4204/EPTCS.53.4","DOIUrl":"https://doi.org/10.4204/EPTCS.53.4","url":null,"abstract":"We present a version of the HOL Light system that supports und oing definitions in such a way that this does not compromise the soundness of the logic. In our sy stem the code that keeps track of the constants that have been defined thus far has been moved out of the kernel. This means that the kernel now is purely functional. The changes to the system are small. All existing HOL Light de velopments can be run by the stateless system with only minor changes. The basic principle behind the system is not to name constant s by strings, but bypairsconsisting of a string and adefinition. This means that the data structures for the terms are all mer ged into one big graph. OCaml – the implementation language of the sys tem – can use pointer equality to establish equality of data structures fast. This allows the system to run at acceptable speeds. Our system runs at about 85% of the speed of the stateful version o f HOL Light.","PeriodicalId":131421,"journal":{"name":"Types for Proofs and Programs","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126358447","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 15
Superposition as a logical glue 作为逻辑粘合剂的叠加
Types for Proofs and Programs Pub Date : 2011-03-16 DOI: 10.4204/EPTCS.53.1
A. Asperti, E. Tassi
{"title":"Superposition as a logical glue","authors":"A. Asperti, E. Tassi","doi":"10.4204/EPTCS.53.1","DOIUrl":"https://doi.org/10.4204/EPTCS.53.1","url":null,"abstract":"The typical mathematical language systematically exploits notational and logical abuses whose resolution requires not just the knowledge of domain specific notation and conventions, but not trivial skills in the given mathematical discipline. A large part of this background knowledge is expressed in form of equalities and isomorphisms, allowing mathematicians to freely move between different incarnations of the same entity without even mentioning the transformation. Providing ITP-systems with similar capabilities seems to be a major way to improve their intelligence, and to ease the communication between the user and the machine. The present paper discusses our experience of integration of a superposition calculus within the Matita interactive prover, providing in particular a very flexible, \"smart\" application tactic, and a simple, innovative approach to automation.","PeriodicalId":131421,"journal":{"name":"Types for Proofs and Programs","volume":"74 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124193498","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 4
Nonuniform Coercions via Unification Hints 通过统一提示的非一致强制
Types for Proofs and Programs Pub Date : 2011-03-16 DOI: 10.4204/EPTCS.53.2
C. Coen, E. Tassi
{"title":"Nonuniform Coercions via Unification Hints","authors":"C. Coen, E. Tassi","doi":"10.4204/EPTCS.53.2","DOIUrl":"https://doi.org/10.4204/EPTCS.53.2","url":null,"abstract":"We introduce the notion of nonuniform coercion, which is the promotion of a value of one type to an enriched value of a different type via a nonuniform procedure. Nonuniform coercions are a generalization of the (uniform) coercions known in the literature and they arise naturally when formalizing mathematics in an higher order interactive theorem prover using convenient devices like canonical structures, type classes or unification hints. We also show how nonuniform coercions can be naturally implemented at the user level in an interactive theorem prover that allows unification hints.","PeriodicalId":131421,"journal":{"name":"Types for Proofs and Programs","volume":"96 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134364703","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 8
Typed Operational Semantics for Dependent Record Types 依赖记录类型的类型化操作语义
Types for Proofs and Programs Pub Date : 2011-03-01 DOI: 10.4204/EPTCS.53.3
Yangyue Feng, Zhaohui Luo
{"title":"Typed Operational Semantics for Dependent Record Types","authors":"Yangyue Feng, Zhaohui Luo","doi":"10.4204/EPTCS.53.3","DOIUrl":"https://doi.org/10.4204/EPTCS.53.3","url":null,"abstract":"Typed operational semantics is a method developed by H. Goguen to prove meta-theoretic properties of type systems. This paper studies the metatheory of a type system with dependent record types, using the approach of typed operational semantics. In particular, the metatheoretical properties we have proved include strong normalisation, Church-Rosser and subject reduction.","PeriodicalId":131421,"journal":{"name":"Types for Proofs and Programs","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122697390","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 8
Axiom Directed Focusing 公理定向聚焦
Types for Proofs and Programs Pub Date : 2009-06-07 DOI: 10.1007/978-3-642-02444-3_11
C. Houtmann
{"title":"Axiom Directed Focusing","authors":"C. Houtmann","doi":"10.1007/978-3-642-02444-3_11","DOIUrl":"https://doi.org/10.1007/978-3-642-02444-3_11","url":null,"abstract":"","PeriodicalId":131421,"journal":{"name":"Types for Proofs and Programs","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121896500","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 10
First-Class Object Sets 第一类对象集
Types for Proofs and Programs Pub Date : 2009-06-07 DOI: 10.1007/978-3-642-02444-3_6
Erik Ernst
{"title":"First-Class Object Sets","authors":"Erik Ernst","doi":"10.1007/978-3-642-02444-3_6","DOIUrl":"https://doi.org/10.1007/978-3-642-02444-3_6","url":null,"abstract":"","PeriodicalId":131421,"journal":{"name":"Types for Proofs and Programs","volume":"95 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117000269","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Some Complexity and Expressiveness Results on Multimodal and Stratified Proof Nets 多模态分层证明网的一些复杂性和表达性结果
Types for Proofs and Programs Pub Date : 2009-06-07 DOI: 10.1007/978-3-642-02444-3_19
Luca Roversi, Luca Vercelli
{"title":"Some Complexity and Expressiveness Results on Multimodal and Stratified Proof Nets","authors":"Luca Roversi, Luca Vercelli","doi":"10.1007/978-3-642-02444-3_19","DOIUrl":"https://doi.org/10.1007/978-3-642-02444-3_19","url":null,"abstract":"","PeriodicalId":131421,"journal":{"name":"Types for Proofs and Programs","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128202096","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 6
Types for Proofs and Programs, International Conference, TYPES 2008, Torino, Italy, March 26-29, 2008, Revised Selected Papers 证明和程序的类型，国际会议，Types 2008，都灵，意大利，2008年3月26-29日，修订论文选集
Types for Proofs and Programs Pub Date : 2009-06-07 DOI: 10.1007/978-3-642-02444-3
S. Berardi, Ferruccio Damiani, Ugo de'Liguoro
{"title":"Types for Proofs and Programs, International Conference, TYPES 2008, Torino, Italy, March 26-29, 2008, Revised Selected Papers","authors":"S. Berardi, Ferruccio Damiani, Ugo de'Liguoro","doi":"10.1007/978-3-642-02444-3","DOIUrl":"https://doi.org/10.1007/978-3-642-02444-3","url":null,"abstract":"","PeriodicalId":131421,"journal":{"name":"Types for Proofs and Programs","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127416030","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 3
Manifest Fields and Module Mechanisms in Intensional Type Theory 内涵类型理论中的显化场与模块机制
Types for Proofs and Programs Pub Date : 2009-06-07 DOI: 10.1007/978-3-642-02444-3_15
Zhaohui Luo
{"title":"Manifest Fields and Module Mechanisms in Intensional Type Theory","authors":"Zhaohui Luo","doi":"10.1007/978-3-642-02444-3_15","DOIUrl":"https://doi.org/10.1007/978-3-642-02444-3_15","url":null,"abstract":"","PeriodicalId":131421,"journal":{"name":"Types for Proofs and Programs","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123361510","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 26
Type Inference by Coinductive Logic Programming 基于共归纳逻辑规划的类型推断
Types for Proofs and Programs Pub Date : 2009-06-07 DOI: 10.1007/978-3-642-02444-3_1
D. Ancona, Giovanni Lagorio, E. Zucca
{"title":"Type Inference by Coinductive Logic Programming","authors":"D. Ancona, Giovanni Lagorio, E. Zucca","doi":"10.1007/978-3-642-02444-3_1","DOIUrl":"https://doi.org/10.1007/978-3-642-02444-3_1","url":null,"abstract":"","PeriodicalId":131421,"journal":{"name":"Types for Proofs and Programs","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121200007","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 17
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信