Big types in little runtime: open-world soundness and collaborative blame for gradual type systems

DOI10.1145/3009837.3009849MaRDI QIDQ5370910zbMATH OpenOpenAlexFDO

Authors Michael M. Vitousek, Cameron Swords, Jeremy G. Siek

Publication date 20 October 2017

Published in Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/3009837.3009849

zbMATH Keywords

semanticstype systemsinteroperabilitygradual typing

Mathematics Subject Classification ID

Theory of programming languages (68N15) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Logic in computer science (03B70)

Recommendations

• Space-efficient gradual typing
• Gradual type theory
• Abstracting gradual typing
• Principal type schemes for gradual programs
• Safe \& efficient gradual typing for TypeScript

Cited in

(8)

• Static blame for gradual typing
• How to evaluate the performance of gradual type systems
• Monotonic references for efficient gradual typing
• Gradual type theory
• Parameterized cast calculi and reusable meta-theory for gradually typed lambda calculi
• Blame and coercion: Together again for the first time
• Well-Typed Programs Can’t Be Blamed
• Space-efficient gradual typing

Describes a project that uses

Uses Software

• Python

This page was built for publication: Big types in little runtime: open-world soundness and collaborative blame for gradual type systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5370910)