Well-Typed Programs Can’t Be Blamed
From MaRDI portal
Publication:3617686
Recommendations
Cited in
(27)- Static blame for gradual typing
- Dependently typed array programs don't go wrong
- Session-typed concurrent contracts
- An extended account of contract monitoring strategies as patterns of communication
- Calculating threesomes, with blame
- The recursive union of some gradual types
- scientific article; zbMATH DE number 2061709 (Why is no real title available?)
- Exploring the Design Space of Higher-Order Casts
- Polymorphic contracts
- A delta for hybrid type checking
- Gradual type theory
- Parameterized cast calculi and reusable meta-theory for gradually typed lambda calculi
- Blame and coercion: Together again for the first time
- Taming the merge operator
- Blame assignment for higher-order contracts with intersection and union
- Reconciling method overloading and dynamically typed scripting languages
- Pragmatic gradual polymorphism with references
- Call-by-name gradual type theory
- Migrating gradual types
- Blame for all
- Shifting the blame. A blame calculus with delimited control
- Typed SLD-resolution: dynamic typing for logic programming
- Call-by-name gradual type theory
- Gradual tensor shape checking
- Manifest contracts with intersection types
- Session Types with Gradual Typing
- The interaction of contracts and laziness
This page was built for publication: Well-Typed Programs Can’t Be Blamed
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3617686)