Calculating threesomes, with blame

DOI10.1145/2500365.2500603MaRDI QIDQ5244820zbMATH OpenOpenAlexFDO

Authors Ronald Garcia

Publication date 30 March 2015

Published in Proceedings of the 18th ACM SIGPLAN international conference on Functional programming (Search for Journal in Brave)

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

zbMATH Keywords

castscoercionslabeled typesspace efficiencythreesomes

Mathematics Subject Classification ID

Theory of programming languages (68N15)

Recommendations

• Threesomes, with and without blame
• Exploring the Design Space of Higher-Order Casts
• Shifting the blame. A blame calculus with delimited control
• Well-Typed Programs Can’t Be Blamed
• Blame for all

Cited in

(7)

• Exploring the Design Space of Higher-Order Casts
• How to evaluate the performance of gradual type systems
• Blame and coercion: Together again for the first time
• Parameterized cast calculi and reusable meta-theory for gradually typed lambda calculi
• Threesomes, with and without blame
• Pragmatic gradual polymorphism with references
• Type-directed operational semantics for gradual typing

This page was built for publication: Calculating threesomes, with blame

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