Pragmatic gradual polymorphism with references
From MaRDI portal
Publication:6535232
DOI10.1007/978-3-031-30044-8_6zbMath1541.68091MaRDI QIDQ6535232
Wenjia Ye, Bruno C. d. S. Oliveira
Publication date: 24 November 2023
Cites Work
- Space-efficient gradual typing
- Consistent subtyping for all
- Monotonic References for Efficient Gradual Typing
- Abstracting gradual typing
- The gradualizer: a methodology and algorithm for generating gradual type systems
- Operational semantics for multi-language programs
- The design and implementation of typed scheme
- Relational Parametricity for Computational Effects
- Practical type inference for arbitrary-rank types
- Well-Typed Programs Can’t Be Blamed
- Exploring the Design Space of Higher-Order Casts
- Trace semantics for polymorphic references
- Blame and coercion: Together again for the first time
- Taming the Merge Operator
- Calculating threesomes, with blame
- Complete and easy bidirectional typechecking for higher-rank polymorphism
- Threesomes, with and without blame
- Blame for all
- Parametric Polymorphism through Run-Time Sealing or, Theorems for Low, Low Prices!
- Types, abstraction, and parametric polymorphism, part 2
This page was built for publication: Pragmatic gradual polymorphism with references
