How to evaluate the performance of gradual type systems
From MaRDI portal
Publication:4972071
DOI10.1017/S0956796818000217zbMath1493.68087WikidataQ128358614 ScholiaQ128358614MaRDI QIDQ4972071
Robert Bruce Findler, Max New, Jan Vitek, Asumu Takikawa, Matthias Felleisen, Ben Greenman, Daniel Feltey
Publication date: 22 November 2019
Published in: Journal of Functional Programming (Search for Journal in Brave)
Related Items
Migrating gradual types ⋮ How to evaluate the performance of gradual type systems ⋮ Gradual type theory ⋮ Parameterized cast calculi and reusable meta-theory for gradually typed lambda calculi
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Space-efficient gradual typing
- Monotonic References for Efficient Gradual Typing
- Soft contract verification
- Safe & Efficient Gradual Typing for TypeScript
- Space-Efficient Manifest Contracts
- Principal Type Schemes for Gradual Programs
- Abstracting gradual typing
- Complete Monitors for Behavioral Contracts
- Operational semantics for multi-language programs
- The design and implementation of typed scheme
- Practical Variable-Arity Polymorphism
- How to evaluate the performance of gradual type systems
- Blame and coercion: Together again for the first time
- Calculating threesomes, with blame
- Threesomes, with and without blame
- Constraining Delimited Control with Contracts
- Big types in little runtime: open-world soundness and collaborative blame for gradual type systems
