The gradualizer: a methodology and algorithm for generating gradual type systems

DOI10.1145/2837614.2837632zbMath1347.68048OpenAlexW2296599395MaRDI QIDQ2828289

Matteo Cimini, Jeremy G. Siek

Publication date: 24 October 2016

Published in: Proceedings of the 43rd 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/2837614.2837632

zbMATH Keywords

semanticstype systemsgradual typing

Mathematics Subject Classification ID

Theory of programming languages (68N15) Theory of compilers and interpreters (68N20) Functional programming and lambda calculus (68N18) Semantics in the theory of computing (68Q55) Logic programming (68N17)

Related Items (6)

Gradual typing using union typing with records ⋮ Migrating gradual types ⋮ The Recursive Union of Some Gradual Types ⋮ Type Inference for Rank 2 Gradual Intersection Types ⋮ System description: lang-n-change -- a tool for transforming languages ⋮ Gradual type theory

This page was built for publication: The gradualizer: a methodology and algorithm for generating gradual type systems