dimitrios vytiniotis

Dimitrios Vytiniotis

CIS Department PhD student in Programming Languages.

email:	dimitriv at cis upenn edu
office:	GRW 565, phone 215-573-2580
mail:	3330 Walnut Street, Levine Hall 3rd Floor,
	Department of Computer and Information Science, University of Pennsylvania,
	Philadelphia PA, 19104

About me

I am working towards the completion of my dissertation at Penn! My advisor is Stephanie Weirich. Here is some information about me. You might also want to visit my old page at NTUA. Also here's the correct way to say my name. In my spare time I sometimes ~~like to~~ do dangerous things.

Research

NEW! Draft paper on type inference for first-class polymorphism, with Stephanie Weirich and Simon Peyton Jones.
Parametricity for higher-order polymorphism and representation-based type analysis. Draft paper available.
With Stephanie Weirich and Brian Aydemir we have been thinking about the problems in the design, implementation, and adoption of dependently typed programming languages. Here's a preliminary draft outlining some of the issues.
Parametricity in the presence of runtime type representations, with a formalization of the results in Isabelle/HOL.
Check out the Isabelle Archive of Formal Proofs for a formalization of Featherweight Java by Nate Foster and me.
More papers on type inference for extensions of Haskell with Stephanie Weirich, Simon Peyton Jones, and Geoff Washburn.
Intensional type analysis and ad-hoc polymorphism made extensible; with Stephanie Weirich and Geoff Washburn. Read more.
A long time ago: Security typed languages and information flow analysis with Steve Zdancewic.
A very long time ago: Foundational Proof Carrying Code with Nikolaos Papaspyrou.

Here's also a complete list of works (including drafts and reports) and the bib file.

Presentations

Dependent Types, Easy as PIE(TFP 2007, New York).
Free theorems and runtime type representations(MFPS XXIII, New Orleans, 2007).
Boxy Types(ICFP 2006, Portland Oregon). Earlier version given at MSR Cambridge, 2005.
Type system support for dependently-typed programming with GADTs (NTUA PL Seminar, 2006). This talk draws material from the ICFP 2006 paper on GADTs, and sketches features that would make programming with GADTs more practical.
An Open and Shut Typecase (TLDI 2005, Long Beach). Versions of this given also at NTUA PL Seminar, 2004.

Teaching

Teaching Assistant for the Software Foundations graduate course, CIS500, Fall 04
Teaching Assistant for the Advanced Functional Programming course, CSE399, Spring 05

PL at Penn

PLClub website: Exciting Programming Languages research at Penn.
The POPLMark challenge.

Misc and Personal

A different view on international news.