eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Leibniz International Proceedings in Informatics
1868-8969
2023-09-02
4:1
4:1
10.4230/LIPIcs.CALCO.2023.4
article
The Metatheory of Gradual Typing: State of the Art and Challenges (Invited Talk)
Siek, Jeremy G.
1
https://orcid.org/0000-0002-9894-4856
Computing Laboratory, Indiana University, Bloomington, IN, USA
Gradually typed languages offer both static and dynamic checking of program invariants, from simple properties such as type safety, to more advanced ones such as information flow control (security), relational parametricity (theorems for free), and program correctness. To ensure that gradually typed languages behave as expected, researchers prove theorems about their language designs. For example, the Gradual Guarantee Theorem states that a programmer can migrate their program to become more or less statically checked and the resulting program will behave the same (modulo errors). As another example, the Noninterference Theorem (for information flow control) states that high security inputs do not affect the low security outputs of a program. These theorems are often proved using simulation arguments or via syntactic logical relations and modal logics. Sometimes the proofs are mechanized in a proof assistant, but often they are simply written in LaTeX. However, as researchers consider gradual languages of growing complexity, the time to conduct such proofs, and/or the likelihood of errors in the proofs, also grows. As a result there is a need for improved proof techniques and libraries of mechanized results that would help to streamline the development of the metatheory of gradually typed languages.
https://drops.dagstuhl.de/storage/00lipics/lipics-vol270-calco2023/LIPIcs.CALCO.2023.4/LIPIcs.CALCO.2023.4.pdf
gradual typing
type safety
gradual guarantee
noninterference
simulation
logical relation
mechanized metatheory