Well-Typed Programs Can’t Be Blamed
From MaRDI portal
Publication:3617686
DOI10.1007/978-3-642-00590-9_1zbMath1234.68063OpenAlexW2150998213MaRDI QIDQ3617686
Philip Wadler, Robert Bruce Findler
Publication date: 31 March 2009
Published in: Programming Languages and Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-00590-9_1
Related Items (16)
Migrating gradual types ⋮ Unnamed Item ⋮ The Recursive Union of Some Gradual Types ⋮ A Delta for Hybrid Type Checking ⋮ An extended account of contract monitoring strategies as patterns of communication ⋮ Typed SLD-resolution: dynamic typing for logic programming ⋮ Call-by-name Gradual Type Theory ⋮ Polymorphic Contracts ⋮ The interaction of contracts and laziness ⋮ Reconciling method overloading and dynamically typed scripting languages ⋮ Session Types with Gradual Typing ⋮ Session-typed concurrent contracts ⋮ 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: Well-Typed Programs Can’t Be Blamed
