Pragmatic gradual polymorphism with references

DOI10.1007/978-3-031-30044-8_6MaRDI QIDQ6535232zbMATHFDO

Authors Wenjia Ye, Bruno C. d. S. Oliveira

Publication date 24 November 2023

zbMATH Keywords

polymorphismtype systemgradual typing

Mathematics Subject Classification ID

Logic in computer science (03B70) Functional programming and lambda calculus (68N18)

Recommendations

• Gradual System F
• Monotonic references for efficient gradual typing
• Gradual type theory
• Principal type schemes for gradual programs
• Abstracting gradual typing

Cites work

• Abstracting gradual typing
• Blame and coercion: Together again for the first time
• Blame for all
• Calculating threesomes, with blame
• Complete and easy bidirectional typechecking for higher-rank polymorphism
• Consistent subtyping for all
• Exploring the Design Space of Higher-Order Casts
• Monotonic references for efficient gradual typing
• Operational semantics for multi-language programs
• Parametric Polymorphism through Run-Time Sealing or, Theorems for Low, Low Prices!
• Practical type inference for arbitrary-rank types
• Relational Parametricity for Computational Effects
• Space-efficient gradual typing
• Taming the merge operator
• The Gradualizer: a methodology and algorithm for generating gradual type systems
• The design and implementation of Typed Scheme
• Threesomes, with and without blame
• Trace semantics for polymorphic references
• Types, abstraction, and parametric polymorphism, part 2
• Well-Typed Programs Can’t Be Blamed

Cited in

(2)

• Trace semantics for polymorphic references
• Gradual System F

This page was built for publication: Pragmatic gradual polymorphism with references

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