Abstracting gradual typing
From MaRDI portal
Recommendations
Cited in
(38)- Gradual typing using union typing with records
- Static type checking without downcast operator
- Consistent subtyping for all
- Monotonic references for efficient gradual typing
- Session Types with Gradual Typing
- A theory of gradual effect systems
- Safe \& efficient gradual typing for TypeScript
- Principal type schemes for gradual programs
- The Gradualizer: a methodology and algorithm for generating gradual type systems
- Gradual ownership types
- Nested refinements: a logic for duck typing
- Gradual program verification
- Foundations of dependent interoperability
- Constructive Galois connections
- How to evaluate the performance of gradual type systems
- Call-by-name gradual type theory
- Linear capabilities for fully abstract compilation of separation-logic-verified code
- Gradual type theory
- Parameterized cast calculi and reusable meta-theory for gradually typed lambda calculi
- Migrating gradual types
- Type Inference for Rank 2 Gradual Intersection Types
- Reconciling noninterference and gradual typing
- Call-by-name gradual type theory
- A gradual interpretation of union types
- Big types in little runtime: open-world soundness and collaborative blame for gradual type systems
- Gradual refinement types
- Automatically generating the dynamic semantics of gradually typed languages
- Sums of uncertainty: refinements go gradual
- Gradual type-and-effect systems
- Gradual typing embedded securely in JavaScript
- Gradual Typing for Annotated Type Systems
- Gradual System F
- Pragmatic gradual polymorphism with references
- Gradual tensor shape checking
- Static blame for gradual typing
- Space-efficient gradual typing
- A simple blame calculus for explicit nulls
- Type-directed operational semantics for gradual typing
This page was built for publication: Abstracting gradual typing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2828288)