Dependent type theory is a powerful and expressive language for writing mathematical expressions and proofs, but careful design, engineering, and hard work are needed to put the theory into practice. In this talk, I will discuss some of the ideas and techniques that have been used in the design of the Lean theorem prover, a new proof system based on dependent type theory that aims to make the theorem proving process more natural, convenient, and efficient.
{"title":"Dependent type practice (invited talk)","authors":"L. D. Moura","doi":"10.1145/2854065.2858809","DOIUrl":"https://doi.org/10.1145/2854065.2858809","url":null,"abstract":"Dependent type theory is a powerful and expressive language for writing mathematical expressions and proofs, but careful design, engineering, and hard work are needed to put the theory into practice. In this talk, I will discuss some of the ideas and techniques that have been used in the design of the Lean theorem prover, a new proof system based on dependent type theory that aims to make the theorem proving process more natural, convenient, and efficient.","PeriodicalId":129494,"journal":{"name":"Certified Programs and Proofs","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-01-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122555647","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}
Pub Date : 2013-12-11DOI: 10.1007/978-3-319-03545-1_11
A. Asperti
{"title":"A Formal Proof of Borodin-Trakhtenbrot's Gap Theorem","authors":"A. Asperti","doi":"10.1007/978-3-319-03545-1_11","DOIUrl":"https://doi.org/10.1007/978-3-319-03545-1_11","url":null,"abstract":"","PeriodicalId":129494,"journal":{"name":"Certified Programs and Proofs","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114966173","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}
Pub Date : 2013-12-11DOI: 10.1007/978-3-319-03545-1_6
C. Doczkal, Jan-Oliver Kaiser, G. Smolka
{"title":"A Constructive Theory of Regular Languages in Coq","authors":"C. Doczkal, Jan-Oliver Kaiser, G. Smolka","doi":"10.1007/978-3-319-03545-1_6","DOIUrl":"https://doi.org/10.1007/978-3-319-03545-1_6","url":null,"abstract":"","PeriodicalId":129494,"journal":{"name":"Certified Programs and Proofs","volume":"72 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123167341","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}
Pub Date : 2013-12-11DOI: 10.1007/978-3-319-03545-1_16
Olivier Savary Bélanger, Stefan Monnier, B. Pientka
{"title":"Programming Type-Safe Transformations Using Higher-Order Abstract Syntax","authors":"Olivier Savary Bélanger, Stefan Monnier, B. Pientka","doi":"10.1007/978-3-319-03545-1_16","DOIUrl":"https://doi.org/10.1007/978-3-319-03545-1_16","url":null,"abstract":"","PeriodicalId":129494,"journal":{"name":"Certified Programs and Proofs","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116886416","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}
Pub Date : 2013-12-11DOI: 10.1007/978-3-319-03545-1_19
Chunhan Wu, Xingyuan Zhang, Christian Urban
{"title":"A Formal Model and Correctness Proof for an Access Control Policy Framework","authors":"Chunhan Wu, Xingyuan Zhang, Christian Urban","doi":"10.1007/978-3-319-03545-1_19","DOIUrl":"https://doi.org/10.1007/978-3-319-03545-1_19","url":null,"abstract":"","PeriodicalId":129494,"journal":{"name":"Certified Programs and Proofs","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128806877","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}
Pub Date : 2013-12-11DOI: 10.1007/978-3-319-03545-1_5
Magnus O. Myreen, Gregorio Curello
{"title":"Proof Pearl: A Verified Bignum Implementation in x86-64 Machine Code","authors":"Magnus O. Myreen, Gregorio Curello","doi":"10.1007/978-3-319-03545-1_5","DOIUrl":"https://doi.org/10.1007/978-3-319-03545-1_5","url":null,"abstract":"","PeriodicalId":129494,"journal":{"name":"Certified Programs and Proofs","volume":"69 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132046653","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}
Pub Date : 2013-12-11DOI: 10.1007/978-3-319-03545-1_2
J. Dodds, A. Appel
{"title":"Mostly Sound Type System Improves a Foundational Program Verifier","authors":"J. Dodds, A. Appel","doi":"10.1007/978-3-319-03545-1_2","DOIUrl":"https://doi.org/10.1007/978-3-319-03545-1_2","url":null,"abstract":"","PeriodicalId":129494,"journal":{"name":"Certified Programs and Proofs","volume":"283 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132024381","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}
Pub Date : 2013-12-11DOI: 10.1007/978-3-319-03545-1_4
R. Krebbers
{"title":"Aliasing Restrictions of C11 Formalized in Coq","authors":"R. Krebbers","doi":"10.1007/978-3-319-03545-1_4","DOIUrl":"https://doi.org/10.1007/978-3-319-03545-1_4","url":null,"abstract":"","PeriodicalId":129494,"journal":{"name":"Certified Programs and Proofs","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131242525","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：