Gradual type theory
From MaRDI portal
Publication:5019016
DOI10.1017/S0956796821000125OpenAlexW3205784599MaRDI QIDQ5019016FDOQ5019016
Authors: Max New, Daniel R. Licata, Amal Ahmed 
Publication date: 27 December 2021
Published in: Journal of Functional Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s0956796821000125
Recommendations
Cites Work
- Notions of computation and monads
- Locus solum: From the rules of logic to the logic of rules.
- Title not available (Why is that?)
- Contextual isomorphisms
- Operational reasoning for functions with local state
- Programming Languages and Systems
- Contracts for higher-order functions
- Typed Contracts for Functional Programming
- Well-Typed Programs Can’t Be Blamed
- Contracts made manifest
- Static contract checking for Haskell
- The interaction of contracts and laziness
- The design and implementation of Typed Scheme
- Dynamic typing: Syntax and proof theory
- Exploring the Design Space of Higher-Order Casts
- Space-efficient gradual typing
- Title not available (Why is that?)
- Polarized Substructural Session Types
- An effect system for algebraic effects and handlers
- The Gradualizer: a methodology and algorithm for generating gradual type systems
- Automatically generating the dynamic semantics of gradually typed languages
- Abstracting gradual typing
- The recursive union of some gradual types
- Threesomes, with and without blame
- Title not available (Why is that?)
- Dependent types and fibred computational effects
- Space-efficient manifest contracts
- Foundations of dependent interoperability
- How to evaluate the performance of gradual type systems
- Big types in little runtime: open-world soundness and collaborative blame for gradual type systems
- Call-by-name gradual type theory
- Gradual type theory
- Call-by-name gradual type theory
- Do be do be do
- Models of a non-associative composition
Cited In (28)
- Consistent subtyping for all
- Automatically generating the dynamic semantics of gradually typed languages
- Galois connecting call-by-value and call-by-name
- How to evaluate the performance of gradual type systems
- Monotonic references for efficient gradual typing
- Big types in little runtime: open-world soundness and collaborative blame for gradual type systems
- The recursive union of some gradual types
- A gradual interpretation of union types
- Reconciling noninterference and gradual typing
- Gradual Typing for Annotated Type Systems
- Gradual System F
- Exploring the Design Space of Higher-Order Casts
- Gradual type theory
- Abstracting gradual typing
- Pragmatic gradual polymorphism with references
- Type Inference for Rank 2 Gradual Intersection Types
- Gradual typing embedded securely in JavaScript
- Principal type schemes for gradual programs
- Well-Typed Programs Can’t Be Blamed
- Call-by-name gradual type theory
- The Gradualizer: a methodology and algorithm for generating gradual type systems
- Space-efficient gradual typing
- Gradual ownership types
- Call-by-name gradual type theory
- Gradual program verification
- Gradual refinement types
- Sums of uncertainty: refinements go gradual
- Dynamic typing: Syntax and proof theory
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)
