[CS] Re: Skye Soss MS Presentation/Jan.21st

Bailey Meche via cs cs at mailman.cs.uchicago.edu
Fri Jan 10 09:42:46 CST 2025


Please remove me from this mailing list. The unsubscribe link does not work.
________________________________
From: cs <cs-bounces+baileymeche=cs.uchicago.edu at mailman.cs.uchicago.edu> on behalf of via cs <cs at mailman.cs.uchicago.edu>
Sent: Friday, January 10, 2025 8:56 AM
To: cs at cs.uchicago.edu <cs at cs.uchicago.edu>; colloquium at cs.uchicago.edu <colloquium at cs.uchicago.edu>
Subject: [CS] Skye Soss MS Presentation/Jan.21st

This is an announcement of Skye Soss's MS Presentation
===============================================
Candidate: Skye Soss

Date: January 21st, 2025

Time: 2:00PM- 3:00PM

Location: JCL 298

Title: Flow Analysis with Types

Abstract: The design of the Standard ML language favors simplicity, which means that it
does not support certain features, especially those related to the type system. Some advanced programming techniques are only possible with sufficiently advanced type
systems. These techniques include data structures that utilize implicit recursive slowdown such as Finger Trees [Okasaki] and stream fusion systems [Coutts et al, Kiselyov et al]. The above programs rely on extensions to a Hindley-Milner type system such as polymorphic recursion, existential quantification, and higher-rank universal quantification.

The use of the language extensions can make analysis more challenging.
Compilers for languages with support for these features such as OCaml
and Haskell's GHC erase types prior to optimization or do not perform
abstract interpretation-based control-flow analysis. While those compilers support these language features, they do not take full advantage of them to improve analysis results.

I extended the 3CPS Standard ML compiler to support existential types,
higher-rank universal quantification, and polymorphic recursion. Additionally, I integrated Fluet's Type- and Control-Flow analysis to take full advantage of the new language features. This work shows that the type-based filtering done in TCFA is practical to
implement and can improve the quality of analysis results of real programs.

Advisors: John Reppy

Committee  Members: John Reppy, Matthew Fluet, Ravi Chugh

When unsubscribing, use your cnetid at cs.uchicago.edu address if your cnetid at uchicago.edu does not work.

cs mailing list  -  cs at mailman.cs.uchicago.edu
Edit Options and/or Unsubscribe: https://mailman.cs.uchicago.edu/mailman/listinfo/cs
More information here: https://howto.cs.uchicago.edu/techstaff:mailinglist
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://mailman.cs.uchicago.edu/pipermail/cs/attachments/20250110/c90c7ccd/attachment-0001.html>


More information about the cs mailing list