Automatically Generating the Dynamic Semantics of Gradually Typed Languages
Many language designers have adopted gradual typing. However, there remains open questions for them regarding how to gradualize their languages. Recently, a methodology and algorithm was proposed for generating the static semantics of a gradually typed language from a fully-static version of the language. In this paper, we address the more difficult challenge of how to automatically generate the dynamic semantics of gradually typed languages. Gradually-typed languages typically make use of an intermediate language with explicit casts, so we first offer a methodology for generating the syntax and type system of the intermediate language with casts.
Next, we present an algorithm that takes as input the dynamic semantics of the fully-static language and outputs the dynamic semantics for casts. We show that our approach is general enough to gradualize several languages, including features such as polymorphism, recursive types and exceptions. We prove that our algorithm produces cast languages that always satisfy the key correctness criteria of gradual typing. We implement these algorithms in a tool that can generate the complete specification of gradually typed languages in lambda-prolog, including their executable interpreters.
Fri 20 Jan Times are displayed in time zone: Amsterdam, Berlin, Bern, Rome, Stockholm, Vienna change
14:20 - 16:00
|Big Types in Little Runtime: Open World Soundness and Collaborative Blame for Gradual Type System|
|Gradual Refinement Types|
POPLLink to publication DOI Pre-print
|Automatically Generating the Dynamic Semantics of Gradually Typed Languages|
|Sums of Uncertainty: Refinements go gradual|