Abstracting gradual typing

DOI10.1145/2837614.2837670zbMath1347.68081OpenAlexW2295283668MaRDI QIDQ2828288

Ronald Garcia, Éric Tanter, Alison M. Clark

Publication date: 24 October 2016

Published in: Proceedings of the 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (Search for Journal in Brave)

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

zbMATH Keywords

subtypingabstract interpretationgradual typing

Mathematics Subject Classification ID

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

Related Items (12)

Gradual typing using union typing with records ⋮ Migrating gradual types ⋮ Unnamed Item ⋮ Static type checking without downcast operator ⋮ Foundations of dependent interoperability ⋮ Type Inference for Rank 2 Gradual Intersection Types ⋮ Gradual type-and-effect systems ⋮ Constructive Galois Connections ⋮ How to evaluate the performance of gradual type systems ⋮ Linear capabilities for fully abstract compilation of separation-logic-verified code ⋮ Gradual type theory ⋮ Parameterized cast calculi and reusable meta-theory for gradually typed lambda calculi

This page was built for publication: Abstracting gradual typing