Blame and coercion: Together again for the first time
From MaRDI portal
Publication:5019015
DOI10.1017/S0956796821000101OpenAlexW3205670054MaRDI QIDQ5019015
Peter Thiemann, Jeremy G. Siek, Philip Wadler
Publication date: 27 December 2021
Published in: Journal of Functional Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s0956796821000101
Related Items (3)
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
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Space-efficient gradual typing
- Dynamic typing: Syntax and proof theory
- Session Types with Gradual Typing
- Safe & Efficient Gradual Typing for TypeScript
- Space-Efficient Manifest Contracts
- Complete Monitors for Behavioral Contracts
- Contracts for higher-order functions
- Operational semantics for multi-language programs
- The design and implementation of typed scheme
- Typed Contracts for Functional Programming
- Contracts as Pairs of Projections
- Well-Typed Programs Can’t Be Blamed
- Exploring the Design Space of Higher-Order Casts
- Blame and coercion: Together again for the first time
- Practical typed lazy contracts
- Temporal higher-order contracts
- Calculating threesomes, with blame
- Contracts made manifest
- Threesomes, with and without blame
- Hybrid type checking
- Big types in little runtime: open-world soundness and collaborative blame for gradual type systems
- Gradual typing embedded securely in JavaScript
- Blame for all
- Correct blame for contracts
- Sound and complete models of contracts
- An axiomatic basis for computer programming
This page was built for publication: Blame and coercion: Together again for the first time