{"title":"A Certified Distributed Security Logic for Authorizing Code","authors":"N. Whitehead","doi":"10.1007/978-3-540-74464-1_17","DOIUrl":"https://doi.org/10.1007/978-3-540-74464-1_17","url":null,"abstract":"","PeriodicalId":131421,"journal":{"name":"Types for Proofs and Programs","volume":"112 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-04-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115953200","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}
{"title":"Fast Reflexive Arithmetic Tactics the Linear Case and Beyond","authors":"Frédéric Besson","doi":"10.1007/978-3-540-74464-1_4","DOIUrl":"https://doi.org/10.1007/978-3-540-74464-1_4","url":null,"abstract":"","PeriodicalId":131421,"journal":{"name":"Types for Proofs and Programs","volume":"95 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-04-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122563839","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}
J. Filliâtre, Christine Paulin-Mohring, Benjamin Werner
{"title":"Types for Proofs and Programs, International Workshop, TYPES 2004, Jouy-en-Josas, France, December 15-18, 2004, Revised Selected Papers","authors":"J. Filliâtre, Christine Paulin-Mohring, Benjamin Werner","doi":"10.1007/11617990","DOIUrl":"https://doi.org/10.1007/11617990","url":null,"abstract":"","PeriodicalId":131421,"journal":{"name":"Types for Proofs and Programs","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122074268","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}
{"title":"Surreal Numbers in Coq","authors":"L. Mamane","doi":"10.1007/11617990_11","DOIUrl":"https://doi.org/10.1007/11617990_11","url":null,"abstract":"","PeriodicalId":131421,"journal":{"name":"Types for Proofs and Programs","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126857509","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}
{"title":"A Tool for Automated Theorem Proving in Agda","authors":"Fredrik Lindblad, Marcin Benke","doi":"10.1007/11617990_10","DOIUrl":"https://doi.org/10.1007/11617990_10","url":null,"abstract":"","PeriodicalId":131421,"journal":{"name":"Types for Proofs and Programs","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130854778","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}
{"title":"On Constructive Existence","authors":"M. Parigot","doi":"10.1007/11617990_17","DOIUrl":"https://doi.org/10.1007/11617990_17","url":null,"abstract":"","PeriodicalId":131421,"journal":{"name":"Types for Proofs and Programs","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114798979","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}
{"title":"Tactic-Based Optimized Compilation of Functional Programs","authors":"T. Meyer, B. Wolff","doi":"10.1007/11617990_13","DOIUrl":"https://doi.org/10.1007/11617990_13","url":null,"abstract":"","PeriodicalId":131421,"journal":{"name":"Types for Proofs and Programs","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129126878","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}
{"title":"lamda-Z: Zermelo's Set Theory as a PTS with 4 Sorts","authors":"Alexandre Miquel","doi":"10.1007/11617990_15","DOIUrl":"https://doi.org/10.1007/11617990_15","url":null,"abstract":"","PeriodicalId":131421,"journal":{"name":"Types for Proofs and Programs","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121669740","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}
{"title":"A Structured Approach to Proving Compiler Optimizations Based on Dataflow Analysis","authors":"Yves Bertot, B. Grégoire, X. Leroy","doi":"10.1007/11617990_5","DOIUrl":"https://doi.org/10.1007/11617990_5","url":null,"abstract":"","PeriodicalId":131421,"journal":{"name":"Types for Proofs and Programs","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121048286","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}
{"title":"Interfaces as Games, Programs as Strategies","authors":"M. Michelbrink","doi":"10.1007/11617990_14","DOIUrl":"https://doi.org/10.1007/11617990_14","url":null,"abstract":"","PeriodicalId":131421,"journal":{"name":"Types for Proofs and Programs","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121233924","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}