Pragmatic gradual polymorphism with references

DOI10.1007/978-3-031-30044-8_6zbMATH Open1541.68091MaRDI QIDQ6535232FDOQ6535232

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)

Cites Work

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

Cited In (1)

• Trace semantics for polymorphic references

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)