How to evaluate blame for gradual types-Reference-Cited by-同舟云学术

How to evaluate blame for gradual types

Published:2021-08-22 Issue:ICFP Volume:5 Page:1-29
ISSN:2475-1421
Container-title:Proceedings of the ACM on Programming Languages
language:en
Short-container-title:Proc. ACM Program. Lang.

Author:

Lazarek Lukas¹,Greenman Ben²,Felleisen Matthias²,Dimoulas Christos¹

Affiliation:

1. Northwestern University, USA

2. Northeastern University, USA

Abstract

Programming language theoreticians develop blame assignment systems and prove blame theorems for gradually typed programming languages. Practical implementations of gradual typing almost completely ignore the idea of blame assignment. This contrast raises the question whether blame provides any value to the working programmer and poses the challenge of how to evaluate the effectiveness of blame assignment strategies. This paper contributes (1) the first evaluation method for blame assignment strategies and (2) the results from applying it to three different semantics for gradual typing. These results cast doubt on the theoretical effectiveness of blame in gradual typing. In most scenarios, strategies with imprecise blame assignment are as helpful to a rationally acting programmer as strategies with provably correct blame.

Funder

NSF

Publisher

Association for Computing Machinery (ACM)

Subject

Safety, Risk, Reliability and Quality,Software

Link

https://dl.acm.org/doi/pdf/10.1145/3473573

Reference40 articles.

1. Taming type annotations in gradual typing

2. Gradual typing with union and intersection types

3. Hints on Test Data Selection: Help for the Practicing Programmer

4. Asger Feldthaus and Anders Møller. 2014. Checking Correctness of TypeScript Interfaces for JavaScript Libraries. In OOPSLA. 1–16. https://doi.org/10.1145/2660193.2660215 10.1145/2660193.2660215 Asger Feldthaus and Anders Møller. 2014. Checking Correctness of TypeScript Interfaces for JavaScript Libraries. In OOPSLA. 1–16. https://doi.org/10.1145/2660193.2660215 10.1145/2660193.2660215

5. Robert Bruce Findler and Matthias Felleisen. 2002. Contracts for Higher-Order Functions. In ICFP. 48–59. https://doi.org/10.1145/581478.581484 10.1145/581478.581484 Robert Bruce Findler and Matthias Felleisen. 2002. Contracts for Higher-Order Functions. In ICFP. 48–59. https://doi.org/10.1145/581478.581484 10.1145/581478.581484

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. How Profilers Can Help Navigate Type Migration;Proceedings of the ACM on Programming Languages;2023-10-16

2. How to Evaluate Blame for Gradual Types, Part 2;Proceedings of the ACM on Programming Languages;2023-08-30

3. GTP Benchmarks for Gradual Typing Performance;Proceedings of the 2023 ACM Conference on Reproducibility and Replicability;2023-06-27

4. Deep and shallow types for gradual languages;Proceedings of the 43rd ACM SIGPLAN International Conference on Programming Language Design and Implementation;2022-06-09