Principal type schemes for gradual programs

DOI10.1145/2676726.2676992MaRDI QIDQ2819815zbMATH OpenOpenAlexFDO

Authors Ronald Garcia, Matteo Cimini

Publication date 29 September 2016

Published in Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/2676726.2676992

zbMATH Keywords

type inferencegradual typing

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Functional programming and lambda calculus (68N18)

Recommendations

• Abstracting gradual typing
• The Gradualizer: a methodology and algorithm for generating gradual type systems
• Gradual type theory
• Gradual Typing for Annotated Type Systems
• Type Inference for Rank 2 Gradual Intersection Types

Cited in

(31)

• Consistent subtyping for all
• Gradual type-and-effect systems
• Static blame for gradual typing
• Type-directed operational semantics for gradual typing
• Automatically generating the dynamic semantics of gradually typed languages
• 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
• A gradual interpretation of union types
• Reconciling noninterference and gradual typing
• Gradual Typing for Annotated Type Systems
• Implicit parameters: dynamic scoping with static types
• Gradual System F
• Parameterized cast calculi and reusable meta-theory for gradually typed lambda calculi
• Abstracting gradual typing
• A theory of gradual effect systems
• Pragmatic gradual polymorphism with references
• Type Inference for Rank 2 Gradual Intersection Types
• Static type checking without downcast operator
• Well-Typed Programs Can’t Be Blamed
• Call-by-name gradual type theory
• The Gradualizer: a methodology and algorithm for generating gradual type systems
• Migrating gradual types
• Type inference with partial types
• Blame for all
• Space-efficient gradual typing
• Gradual ownership types
• Call-by-name gradual type theory
• Gradual tensor shape checking
• Sums of uncertainty: refinements go gradual
• Principal Type Schemes for Modular Programs

This page was built for publication: Principal type schemes for gradual programs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2819815)