Type-directed operational semantics for gradual typing
From MaRDI portal
Cites work
- A formulation of the simple theory of types
- A syntactic approach to type soundness
- A theory of gradual effect systems
- Abstracting gradual typing
- An extension of system \(F\) with subtyping
- Blame for all
- Bounded quantification is undecidable
- Calculating threesomes, with blame
- Coherence of subsumption, minimum typing and type-checking in F ≤
- Comparing object encodings.
- Contracts for higher-order functions
- Dynamic typing: Syntax and proof theory
- Exploring the Design Space of Higher-Order Casts
- Gradual typing embedded securely in JavaScript
- scientific article; zbMATH DE number 2185661 (Why is no real title available?)
- scientific article; zbMATH DE number 1032031 (Why is no real title available?)
- scientific article; zbMATH DE number 6932679 (Why is no real title available?)
- scientific article; zbMATH DE number 944097 (Why is no real title available?)
- Non-parametric parametricity
- Parametric Polymorphism through Run-Time Sealing or, Theorems for Low, Low Prices!
- Principal type schemes for gradual programs
- Space-efficient gradual typing
- Space-efficient manifest contracts
- Taming the merge operator
- The coherence of languages with intersection types
- The design and implementation of Typed Scheme
- The revised report on the syntactic theories of sequential control and state
- Typed operational semantics for dependent record types
- Typed operational semantics for higher-order subtyping.
- Well-Typed Programs Can’t Be Blamed
This page was built for publication: Type-directed operational semantics for gradual typing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6976541)
