Recommendations
Cites work
- Abstracting gradual typing
- An effect system for algebraic effects and handlers
- Automatically generating the dynamic semantics of gradually typed languages
- Big types in little runtime: open-world soundness and collaborative blame for gradual type systems
- Call-by-name gradual type theory
- Call-by-name gradual type theory
- Contextual isomorphisms
- Contracts for higher-order functions
- Contracts made manifest
- Dependent types and fibred computational effects
- Do be do be do
- Dynamic typing: Syntax and proof theory
- Exploring the Design Space of Higher-Order Casts
- Foundations of dependent interoperability
- Gradual type theory
- How to evaluate the performance of gradual type systems
- scientific article; zbMATH DE number 1330443 (Why is no real title available?)
- scientific article; zbMATH DE number 2120508 (Why is no real title available?)
- LNL-FPC: the linear/non-linear fixpoint calculus
- Locus solum: From the rules of logic to the logic of rules.
- Models of a non-associative composition
- Notions of computation and monads
- Operational reasoning for functions with local state
- Polarized Substructural Session Types
- Programming Languages and Systems
- Space-efficient gradual typing
- Space-efficient manifest contracts
- Static contract checking for Haskell
- The design and implementation of Typed Scheme
- The Gradualizer: a methodology and algorithm for generating gradual type systems
- The interaction of contracts and laziness
- The recursive union of some gradual types
- Threesomes, with and without blame
- Typed Contracts for Functional Programming
- Well-Typed Programs Can’t Be Blamed
Cited in
(28)- Dynamic typing: Syntax and proof theory
- Consistent subtyping for all
- Monotonic references for efficient gradual typing
- Principal type schemes for gradual programs
- Abstracting gradual typing
- The Gradualizer: a methodology and algorithm for generating gradual type systems
- Gradual ownership types
- The recursive union of some gradual types
- Gradual program verification
- Well-Typed Programs Can’t Be Blamed
- Exploring the Design Space of Higher-Order Casts
- How to evaluate the performance of gradual type systems
- Call-by-name gradual type theory
- Gradual type theory
- 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 typing embedded securely in JavaScript
- Gradual Typing for Annotated Type Systems
- Gradual System F
- Galois connecting call-by-value and call-by-name
- Pragmatic gradual polymorphism with references
- Space-efficient gradual typing
This page was built for publication: Gradual type theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5019016)
