[CS] TODAY @ 3PM: Benjamin Waldman MS Presentation - May 6, 2025

[Jessica Garza via cs]

This is a reminder of Benjamin Waldman's MS Presentation

===============================================

Candidate: Benjamin Waldman

Date: Tuesday, May 6, 2025

Time:  3:00 pm CT

Location: JCL 390

Title: PROVING ARROW’S IMPOSSIBILITY THEOREM USING REFINEMENT TYPES

Abstract: Arrow’s impossibility theorem is a landmark result in theoretical economics that led to the
formation of modern social choice theory. I develop a new, computer-verified proof of Arrow’s
impossibility using refinement types, a concept from type theory that allows functions to
return both data and predicates on that data. I then argue that refinement types are a
natural paradigm for formally verifying many theorems in economics and political science.

Advisors: Stuart Kurtz

Committee Members: Stuart Kurtz, Adam Shaw, and Robert Rand



Jessica Garza
Assistant Director of Undergraduate Studies
Department of Computer Science
The University of Chicago
John Crerar Library 374
Office: (773) 702-2336





-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://mailman.cs.uchicago.edu/pipermail/cs/attachments/20250506/9497f169/attachment-0002.html>
-------------- next part --------------
A non-text attachment was scrubbed...
Name: Waldman, Benjamin - Thesis.pdf
Type: application/pdf
Size: 183527 bytes
Desc: not available
URL: <http://mailman.cs.uchicago.edu/pipermail/cs/attachments/20250506/9497f169/attachment-0001.pdf>
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://mailman.cs.uchicago.edu/pipermail/cs/attachments/20250506/9497f169/attachment-0003.html>