Threesomes, with and without blame

DOI10.1145/1706299.1706342zbMath1312.68138OpenAlexW2034355944MaRDI QIDQ5255094

Philip Wadler, Jeremy G. Siek

Publication date: 11 June 2015

Published in: Proceedings of the 37th 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/1706299.1706342

zbMATH Keywords

lambda-calculuscoercionscastsblame tracking

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Semantics in the theory of computing (68Q55) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (9)

Gradual typing using union typing with records ⋮ Unnamed Item ⋮ Call-by-name Gradual Type Theory ⋮ Session Types with Gradual Typing ⋮ How to evaluate the performance of gradual type systems ⋮ Blame and coercion: Together again for the first time ⋮ Gradual type theory ⋮ Taming the Merge Operator ⋮ Parameterized cast calculi and reusable meta-theory for gradually typed lambda calculi

This page was built for publication: Threesomes, with and without blame