Proceedings of the 5th ACM SIGPLAN International Workshop on Type-Driven Development最新文献

筛选

英文中文

Strongly bounded termination with applications to security and hardware synthesis 具有安全性和硬件合成应用程序的强边界终止

Proceedings of the 5th ACM SIGPLAN International Workshop on Type-Driven Development Pub Date : 2020-08-23 DOI: 10.1145/3406089.3409029

Thomas N. Reynolds, W. Harrison, Rohit Chadha, G. Allwein

引用次数: 1

Practical dependent type checking using twin types 使用孪生类型的实际依赖类型检查

Proceedings of the 5th ACM SIGPLAN International Workshop on Type-Driven Development Pub Date : 2020-08-09 DOI: 10.1145/3406089.3409030

Víctor López Juan, Nils Anders Danielsson

{"title":"Practical dependent type checking using twin types","authors":"Víctor López Juan, Nils Anders Danielsson","doi":"10.1145/3406089.3409030","DOIUrl":"https://doi.org/10.1145/3406089.3409030","url":null,"abstract":"People writing proofs or programs in dependently typed languages can omit some function arguments in order to decrease the code size and improve readability. Type checking such a program involves filling in each of these implicit arguments in a type-correct way. This is typically done using some form of unification. One approach to unification, taken by Agda, involves sometimes starting to unify terms before their types are known to be equal: in some cases one can make progress on unifying the terms, and then use information gleaned in this way to unify the types. This flexibility allows Agda to solve implicit arguments that are not found by several other systems. However, Agda's implementation is buggy: sometimes the solutions chosen are ill-typed, which can cause the type checker to crash. With Gundry and McBride's twin variable technique one can also start to unify terms before their types are known to be equal, and furthermore this technique is accompanied by correctness proofs. However, so far this technique has not been tested in practice as part of a full type checker. We have reformulated Gundry and McBride's technique without twin variables, using only twin types, with the aim of making the technique easier to implement in existing type checkers (in particular Agda). We have also introduced a type-agnostic syntactic equality rule that seems to be useful in practice. The reformulated technique has been tested in a type checker for a tiny variant of Agda. This type checker handles at least one example that Coq, Idris, Lean and Matita cannot handle, and does so in time and space comparable to that used by Agda. This suggests that the reformulated technique is usable in practice.","PeriodicalId":207693,"journal":{"name":"Proceedings of the 5th ACM SIGPLAN International Workshop on Type-Driven Development","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-08-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125530656","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

Proceedings of the 5th ACM SIGPLAN International Workshop on Type-Driven Development 第五届ACM SIGPLAN类型驱动发展国际研讨会论文集

Proceedings of the 5th ACM SIGPLAN International Workshop on Type-Driven Development Pub Date : 1900-01-01 DOI: 10.1145/3406089

引用次数: 0