Date of Award
Spring 2025
Access Restriction
Thesis
Degree Name
Master of Science
Department
Computer Science
School or College
Seaver College of Science and Engineering
First Advisor
Ray Toal
Second Advisor
John David N. Dionisio
Third Advisor
Julian Gonzalez
Abstract
In 2006, Jeremy Siek and Walid Taha formalized the concept of gradual type systems, which integrates static and dynamic typing in a single programming language. This allows the programmer to statically or dynamically type portions of their code at will, which offers more flexibility than languages that require all code to be statically typed. Despite the added convenience, gradual typing comes with its own set of tradeoffs, and researchers have been debating whether the drawbacks of integrating static and dynamic types outweigh its benefits. This thesis builds off of previous research to investigate the advantages and disadvantages of using a gradual type system, specifically in the context of formal programming language theory, through the usage of structural operational semantics and Harper's progress and preservation approach of proving type safety.
Recommended Citation
Lau, Natalie, "An Argument against Gradual Type Systems in Programming Language Semantics" (2025). LMU Theses and Dissertations. 1342.
https://digitalcommons.lmu.edu/etd/1342
