How to evaluate the performance of gradual type systems
From MaRDI portal
Publication:4972071
DOI10.1017/S0956796818000217zbMATH Open1493.68087WikidataQ128358614 ScholiaQ128358614MaRDI QIDQ4972071FDOQ4972071
Authors: Ben Greenman, Asumu Takikawa, Max New, Daniel Feltey, Robert Bruce Findler, Jan Vitek, Matthias Felleisen 
Publication date: 22 November 2019
Published in: Journal of Functional Programming (Search for Journal in Brave)
Recommendations
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Complete monitors for behavioral contracts
- The design and implementation of Typed Scheme
- Operational semantics for multi-language programs
- Space-efficient gradual typing
- Safe \& efficient gradual typing for TypeScript
- Constraining Delimited Control with Contracts
- Abstracting gradual typing
- Threesomes, with and without blame
- Practical Variable-Arity Polymorphism
- Monotonic references for efficient gradual typing
- Soft contract verification
- Space-efficient manifest contracts
- Principal type schemes for gradual programs
- Blame and coercion: Together again for the first time
- How to evaluate the performance of gradual type systems
- Calculating threesomes, with blame
- Big types in little runtime: open-world soundness and collaborative blame for gradual type systems
Cited In (4)
Uses Software
This page was built for publication: How to evaluate the performance of gradual type systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4972071)
