Back to search

Loyola Marymout University

An Argument against Gradual Type Systems in Programming Language Semantics

Abstract

dc:description.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.

Degree

thesis:*
Name thesis:degree_name
Master of Science
Level thesis:degree_level
Thesis
Discipline thesis:degree_discipline
Computer Science

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Lau, Natalie
Contributors dc:contributor
  • Ray Toal
  • John David N. Dionisio
  • Julian Gonzalez

Subjects

dc:subject × 5

Identifiers

dc:identifier.*
Repository record dc:identifier
https://digitalcommons.lmu.edu/etd/1342

Chain of custody

source
Harvested from
Loyola Marymout University
Base URL
digitalcommons.lmu.edu/do/oai/
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
citation

Lau, Natalie. An Argument against Gradual Type Systems in Programming Language Semantics. Thesis thesis, https://digitalcommons.lmu.edu/etd/1342