<html>
<head>
<meta http-equiv="Content-Type" content="text/html; charset=us-ascii">
<style type="text/css" style="display:none;"> P {margin-top:0;margin-bottom:0;} </style>
</head>
<body dir="ltr">
<div class="elementToProof" style="font-family: Aptos, Aptos_EmbeddedFont, Aptos_MSFontService, Calibri, Helvetica, sans-serif; font-size: 12pt; color: rgb(0, 0, 0);">
Please remove me from this mailing list. The unsubscribe link does not work. </div>
<div id="appendonsend"></div>
<hr style="display:inline-block;width:98%" tabindex="-1">
<div id="divRplyFwdMsg" dir="ltr"><font face="Calibri, sans-serif" style="font-size:11pt" color="#000000"><b>From:</b> cs <cs-bounces+baileymeche=cs.uchicago.edu@mailman.cs.uchicago.edu> on behalf of via cs <cs@mailman.cs.uchicago.edu><br>
<b>Sent:</b> Friday, January 10, 2025 8:56 AM<br>
<b>To:</b> cs@cs.uchicago.edu <cs@cs.uchicago.edu>; colloquium@cs.uchicago.edu <colloquium@cs.uchicago.edu><br>
<b>Subject:</b> [CS] Skye Soss MS Presentation/Jan.21st</font>
<div> </div>
</div>
<div class="BodyFragment"><font size="2"><span style="font-size:11pt;">
<div class="PlainText">This is an announcement of Skye Soss's MS Presentation<br>
===============================================<br>
Candidate: Skye Soss<br>
<br>
Date: January 21st, 2025 <br>
<br>
Time: 2:00PM- 3:00PM<br>
<br>
Location: JCL 298<br>
<br>
Title: Flow Analysis with Types<br>
<br>
Abstract: The design of the Standard ML language favors simplicity, which means that it<br>
does not support certain features, especially those related to the type system. Some advanced programming techniques are only possible with sufficiently advanced type<br>
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.<br>
<br>
The use of the language extensions can make analysis more challenging.<br>
Compilers for languages with support for these features such as OCaml<br>
and Haskell's GHC erase types prior to optimization or do not perform<br>
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.<br>
<br>
I extended the 3CPS Standard ML compiler to support existential types,<br>
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<br>
implement and can improve the quality of analysis results of real programs.<br>
<br>
Advisors: John Reppy<br>
<br>
Committee Members: John Reppy, Matthew Fluet, Ravi Chugh <br>
<br>
When unsubscribing, use your cnetid@cs.uchicago.edu address if your cnetid@uchicago.edu does not work.<br>
<br>
cs mailing list - cs@mailman.cs.uchicago.edu<br>
Edit Options and/or Unsubscribe: <a href="https://mailman.cs.uchicago.edu/mailman/listinfo/cs">
https://mailman.cs.uchicago.edu/mailman/listinfo/cs</a><br>
More information here: <a href="https://howto.cs.uchicago.edu/techstaff:mailinglist">
https://howto.cs.uchicago.edu/techstaff:mailinglist</a></div>
</span></font></div>
</body>
</html>