Blame and coercion: Together again for the first time
From MaRDI portal
Publication:5019015
Cites work
- scientific article; zbMATH DE number 2163037 (Why is no real title available?)
- scientific article; zbMATH DE number 3302923 (Why is no real title available?)
- An axiomatic basis for computer programming
- Big types in little runtime: open-world soundness and collaborative blame for gradual type systems
- Blame and coercion: Together again for the first time
- Blame for all
- Calculating threesomes, with blame
- Complete monitors for behavioral contracts
- Contracts as Pairs of Projections
- Contracts for higher-order functions
- Contracts made manifest
- Correct blame for contracts, no more scapegoating
- Dynamic typing: Syntax and proof theory
- Exploring the Design Space of Higher-Order Casts
- Gradual typing embedded securely in JavaScript
- Hybrid type checking
- Operational semantics for multi-language programs
- Practical typed lazy contracts
- Safe \& efficient gradual typing for TypeScript
- Session Types with Gradual Typing
- Sound and complete models of contracts
- Space-efficient gradual typing
- Space-efficient manifest contracts
- Temporal higher-order contracts
- The design and implementation of Typed Scheme
- Threesomes, with and without blame
- Typed Contracts for Functional Programming
- Types and programing languages
- Well-Typed Programs Can’t Be Blamed
Cited in
(5)- scientific article; zbMATH DE number 1497808 (Why is no real title available?)
- How to evaluate the performance of gradual type systems
- Parameterized cast calculi and reusable meta-theory for gradually typed lambda calculi
- Blame and coercion: Together again for the first time
- Pragmatic gradual polymorphism with references
This page was built for publication: Blame and coercion: Together again for the first time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5019015)
