Sunil Kothari presents research paper at CiE 2008
Sunil Kothari presented the paper On Extending Wand's Type Reconstruction Algorithm to Handle Polymorphic Let at CiE 2008: The Fourth Conference on Computability in Europe (Athens, Greece, June 15-20, 2008). The paper describes an extension to Wand's type reconstruction algorithm to handle polymorphic let statements. Sunil is a Ph.D. student in the department working with Professor Caldwell who was a co-author on the paper. Sunil's research is on type reconstruction algorithms for functional programming languages. He is currently formalizing the proofs from the CiE paper in the Coq proof assistant. Sunil's trip was partially funded by the Association of Symbolic Logic, the UW graduate school and the Computer Science department.
