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

DOI10.1145/3009837.3009849zbMath1380.68088OpenAlexW2561856298MaRDI QIDQ5370910

Cameron Swords, Michael M. Vitousek, 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) Logic in computer science (03B70) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (4)

How to evaluate the performance of gradual type systems ⋮ Blame and coercion: Together again for the first time ⋮ Gradual type theory ⋮ Parameterized cast calculi and reusable meta-theory for gradually typed lambda calculi

Uses Software

• Python

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