Migrating gradual types
From MaRDI portal
Publication:5051992
DOI10.1017/S0956796822000089OpenAlexW2899089688MaRDI QIDQ5051992
Martin Erwig, Eric Walkingshaw, Sheng Chen, John Peter Campora III
Publication date: 18 November 2022
Published in: Journal of Functional Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s0956796822000089
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Principal Type Schemes for Gradual Programs
- Principal type inference for GADTs
- Abstracting gradual typing
- The gradualizer: a methodology and algorithm for generating gradual type systems
- Gradual Ownership Types
- Nested refinements
- Denotational cost semantics for functional languages with inductive types
- Typing Local Control and State Using Flow Analysis
- The Recursive Union of Some Gradual Types
- Well-Typed Programs Can’t Be Blamed
- A domain-specific language for experimental game theory
- Binary Decision Diagrams
- <scp>OutsideIn(X)</scp>Modular type inference with local assumptions
- How to evaluate the performance of gradual type systems
- Migrating gradual types
- An error-tolerant type system for variational lambda calculus
- Guided Type Debugging
- A Gradual Interpretation of Union Types
- Gradual refinement types
- Automatically generating the dynamic semantics of gradually typed languages
- Sums of uncertainty: refinements go gradual
- Counter-factual typing for debugging type errors
- Blame for all
- A Machine-Oriented Logic Based on the Resolution Principle
This page was built for publication: Migrating gradual types
