Gradual type theory
From MaRDI portal
Publication:5019016
Recommendations
Cites work
- {{#invoke:WikidataIB|getLink|Q4261086}} scientific article; zbMATH DE number 1330443 (Why is no real title available?)
- {{#invoke:WikidataIB|getLink|Q4829806}} scientific article; zbMATH DE number 2120508 (Why is no real title available?)
- {{#invoke:WikidataIB|getLink|Q4989404}} scientific article; zbMATH DE number 7350775 (Why is no real title available?)
- {{#invoke:WikidataIB|getLink|Q2828288}} Abstracting gradual typing
- {{#invoke:WikidataIB|getLink|Q5891182}} An effect system for algebraic effects and handlers
- {{#invoke:WikidataIB|getLink|Q5370913}} Automatically generating the dynamic semantics of gradually typed languages
- {{#invoke:WikidataIB|getLink|Q5370910}} Big types in little runtime: open-world soundness and collaborative blame for gradual type systems
- {{#invoke:WikidataIB|getLink|Q4993354}} Call-by-name gradual type theory
- {{#invoke:WikidataIB|getLink|Q5214814}} Call-by-name gradual type theory
- {{#invoke:WikidataIB|getLink|Q5370877}} Contextual isomorphisms
- {{#invoke:WikidataIB|getLink|Q2949191}} Contracts for higher-order functions
- {{#invoke:WikidataIB|getLink|Q5255093}} Contracts made manifest
- {{#invoke:WikidataIB|getLink|Q2811331}} Dependent types and fibred computational effects
- {{#invoke:WikidataIB|getLink|Q5370884}} Do be do be do
- {{#invoke:WikidataIB|getLink|Q1330433}} Dynamic typing: Syntax and proof theory
- {{#invoke:WikidataIB|getLink|Q3617687}} Exploring the Design Space of Higher-Order Casts
- {{#invoke:WikidataIB|getLink|Q4577812}} Foundations of dependent interoperability
- {{#invoke:WikidataIB|getLink|Q5019016}} Gradual type theory
- {{#invoke:WikidataIB|getLink|Q4972071}} How to evaluate the performance of gradual type systems
- {{#invoke:WikidataIB|getLink|Q2732138}} Locus solum: From the rules of logic to the logic of rules.
- {{#invoke:WikidataIB|getLink|Q5410686}} Models of a non-associative composition
- {{#invoke:WikidataIB|getLink|Q757075}} Notions of computation and monads
- {{#invoke:WikidataIB|getLink|Q2704328}} Operational reasoning for functions with local state
- {{#invoke:WikidataIB|getLink|Q2948548}} Polarized Substructural Session Types
- {{#invoke:WikidataIB|getLink|Q5899009}} Programming Languages and Systems
- {{#invoke:WikidataIB|getLink|Q656856}} Space-efficient gradual typing
- {{#invoke:WikidataIB|getLink|Q2819803}} Space-efficient manifest contracts
- {{#invoke:WikidataIB|getLink|Q5261504}} Static contract checking for Haskell
- {{#invoke:WikidataIB|getLink|Q2828289}} The Gradualizer: a methodology and algorithm for generating gradual type systems
- {{#invoke:WikidataIB|getLink|Q3189858}} The design and implementation of Typed Scheme
- {{#invoke:WikidataIB|getLink|Q526445}} The interaction of contracts and laziness
- {{#invoke:WikidataIB|getLink|Q3188297}} The recursive union of some gradual types
- {{#invoke:WikidataIB|getLink|Q5255094}} Threesomes, with and without blame
- {{#invoke:WikidataIB|getLink|Q3434634}} Typed Contracts for Functional Programming
- {{#invoke:WikidataIB|getLink|Q3617686}} Well-Typed Programs Can’t Be Blamed
Cited in
(28)- Galois connecting call-by-value and call-by-name
- The Gradualizer: a methodology and algorithm for generating gradual type systems
- Gradual program verification
- How to evaluate the performance of gradual type systems
- Well-Typed Programs Can’t Be Blamed
- Gradual ownership types
- The recursive union of some gradual types
- Principal type schemes for gradual programs
- Consistent subtyping for all
- Gradual refinement types
- Sums of uncertainty: refinements go gradual
- Exploring the Design Space of Higher-Order Casts
- Dynamic typing: Syntax and proof theory
- Call-by-name gradual type theory
- Abstracting gradual typing
- Pragmatic gradual polymorphism with references
- A gradual interpretation of union types
- Call-by-name gradual type theory
- Gradual System F
- Monotonic references for efficient gradual typing
- Big types in little runtime: open-world soundness and collaborative blame for gradual type systems
- Space-efficient gradual typing
- Gradual typing embedded securely in JavaScript
- Gradual Typing for Annotated Type Systems
- Reconciling noninterference and gradual typing
- Type Inference for Rank 2 Gradual Intersection Types
- Automatically generating the dynamic semantics of gradually typed languages
- Gradual type 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)
