Ryan Wisnesky

ryan@cs.harvard.edu

Harvard University
School of Engineering and Applied Sciences
Maxwell Dworkin 309
33 Oxford Street
Cambridge, MA 02138

I'm a computer science Ph.D. candidate in the Programming Languages Group. My advisor is Greg Morrisett.

My research interests include functional programming and information management.

C.V.

Current Activities

	I am working with David Spivak to establish new category-theoretic foundations for information management. In this model, schemas are finitely presented categories, database instances are set-valued functors, and the natural query language is an algebra of substitution and adjoint quantification. Project webpage
	I am developing next-generation functional query languages and exploring their application to no-sql. A Theory of No-SQL [abstract] (NEDBDay 2012) Project update slides (Seminaire PPS) Collection Processing with Constraints, Monads, and Folds (WIR 11) [slides] Minimizing Monad Comprehensions (Tech Report) Project update slides (Northeastern PL Seminar) Project overview slides (RADICAL 2010)

Past Activities

	I've built certified systems software with Ynot. Trace Based Verification of Imperative Programs with I/O (JSC-WWV 10) Toward a Verified Relational Database Management System (POPL 10) [Slides] Effective Interactive Proof of Higher Order Imperative Programs (ICFP 09) Certified Web Services in Ynot (WWV 09) [Slides]
	In collaboration with the Clio / Midas team at the IBM Almaden Research Center, I've developed programming languages for information integration. High-Level Rules for Integration and Analysis of Data: New Challenges (Invited) HIL: A High-Level Scripting Language for Entity Integration (EDBT 2013) [Poster] Mapping Polymorphism (ICDT 10) [Proofs] [Slides] Mapping Dependence (Tech Report) Orchid: Integrating Schema Mapping and ETL (ICDE 08)
	I'm a former IBM Extreme Blue intern. Bringing Business Objects into Extract-Transform-Load Technology (BIMA 08) Callisto: Mergers without Pain (BIRTE 06)
	Unpublished reports from Harvard. The Inadequacy of Pure Intention Exploring Webgraph Compression with SUBDUE
	Unpublished reports from Stanford. The Inheritance Anomaly Revisited Evaluating Scheduling Algorithms on Distributed Computational Grids

Teaching

Harvard University, CSCIE 268: Database and Information Management Systems, Teaching Fellow, Spring 2011.

Harvard University, CS 165: Information Management, Teaching Fellow, Spring 2010.

Harvard University, CS 51: Abstraction and Design in Computer Programming, Teaching Fellow, Spring 2008.

Stanford University, CS 242: Programming Languages, Teaching Fellow, Fall 2006.