Rate My Professor Aaron Stump

Stump's research specializations encompass computational logic and programming languages theory, with key contributions to satisfiability modulo theories (SMT), dependently typed functional programming, and proof assistants including Cedille and Agda. He authored the books Verified Functional Programming in Agda (ACM Books, 2016) and Programming Language Foundations (Wiley, 2013). Prominent publications include "A Decision Procedure for an Extensional Theory of Arrays" (LICS 2001; recipient of LICS Test of Time Award 2021), "Strong functional pearl: Harper’s regular-expression matcher in Cedille" (PACMPL 2020), "From Realizability to Induction via Dependent Intersection" (Annals of Pure and Applied Logic 2018), "The Calculus of Dependent Lambda Eliminations" (Journal of Functional Programming 2017), and "A Type-Based Approach to Divide-and-Conquer Recursion in Coq" (PACMPL 2023). His scholarly impact is reflected in an h-index of 27 according to Google Scholar as of November 2023. Stump has earned the CAV Award (2021) for pioneering contributions to SMT solvers, NSF CAREER Award (2005–2010), Collegiate Teaching Award from the University of Iowa College of Liberal Arts and Sciences (2015), Best Paper Award at RTA (2011) for "Type Preservation as a Confluence Problem," and Best Student Paper Award at TFP (2023) for "Impredicative Encodings of Inductive-Inductive Data in Cedille." He served as Associate Editor for ACM Transactions on Programming Languages and Systems (2007–2011), co-organized SMT-COMP (2005–2010), and participated in program committees for POPL (2023), CPP (2023), FSCD (2020, 2017), CADE (2011, 2009, 2008), and others.