Monotonic references for efficient gradual typing

DOI10.1007/978-3-662-46669-8_18MaRDI QIDQ2802447zbMATH OpenOpenAlexFDO

Authors Jeremy G. Siek, Michael M. Vitousek, Matteo Cimini, Sam Tobin-Hochstadt, Ronald Garcia

Publication date 26 April 2016

Published in Programming Languages and Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-662-46669-8_18

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Functional programming and lambda calculus (68N18) Semantics in the theory of computing (68Q55)

Recommendations

• Gradual type theory
• Abstracting gradual typing
• Space-efficient gradual typing
• Principal type schemes for gradual programs
• Big types in little runtime: open-world soundness and collaborative blame for gradual type systems

Cited in

(8)

• Static blame for gradual typing
• How to evaluate the performance of gradual type systems
• Parameterized cast calculi and reusable meta-theory for gradually typed lambda calculi
• Pragmatic gradual polymorphism with references
• Call-by-name gradual type theory
• Migrating gradual types
• Call-by-name gradual type theory
• Safe \& efficient gradual typing for TypeScript

This page was built for publication: Monotonic references for efficient gradual typing

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