Scholarship and Biography

I have worked on various problems related to type systems for programming languages, in particular, analyzing the computational resources needed for different kinds of optimizations (type inference, optimal reduction, intersection types and flow analysis, static analysis). This work has been motivated by many ideas from linear logic. More recently I am interested in developing a domain-specific programming language for string instrument design, where the language uses the same constructional vernacular found in the seventeenth-century methods, only with a more refined and specific computational interpretation.

Link

Honors

Special Interest Group on Programming Languages Research Highlight Award (for "Functional Geometry and the Traité de Lutherie", ICFP 2013)
Association for Computing Machinery (United States, New York) - ACM, 2014
SIGPLAN Research Highlight Award (for "Functional Geometry and the Traité de Lutherie", ICFP
Association for Computing Machinery (United States, New York) - ACM, 2013
Professeur Invité, Institut de Mathematiques de Luminy
Aix-Marseille University (France, Marseille) - AMU, 2009
Most Influential ICFP Paper Award, for "Optimality and Inefficiency: What Isn't a Cost Model of the Lambda Calculus?" (with Julia Lawall), presented at the 1996 ACM International Conference on Functional Programming
Association for Computing Machinery (United States, New York) - ACM, 2007
Chercheur Invité, Equipe Logique de la Programmation, Institut de Mathématiques de Luminy, Marseille
French National Centre for Scientific Research (France, Paris) - CNRS, 2004
Marver and Sheva Bernstein Faculty Fellowship
Brandeis University (United States, Waltham), 1991-1992

Organizational Affiliations

Professor of Computer Science, Michtom School of Computer Science, Brandeis University

Affiliated Faculty, Benjamin and Mae Volen National Center for Complex Systems, Brandeis University

Education

Stanford University
Ph.D.
Yale University
B.A.