Computer Science Speaking Skills Talk

Thursday, October 27, 2022 - 1:00pm to 2:00pm


In Person Reddy Conference Room, Gates Hillman 4405


DAVID M. KAHN, Ph.D. StudentComputer Science DepartmentCarnegie Mellon University

Remainder Contexts: Keeping the Change

The type system of Automatic Amortized Resource Analysis (AARA) uses type inference to analyze a program's resource usage. While this approach often works well, it yields poor bounds for resources that are reusable, like memory. In this talk, we show how this type system problem can be related to a similar problem in linear logic proof search. As is typical of the relation between proofs and programs, the proof search solution of I/O contexts can then be ported to the programmatic setting. Updating AARA with the resulting remainder contexts not only solves the issue with reusable resources, but also simplifies away some ad-hoc language features such as sharing. Presented in Partial Fulfillment of the CSD Speaking Skills Requirement.

For More Information, Contact:


Speaking Skills