| 2013 | ||
|---|---|---|
| c14 | Dimitrios Vytiniotis, Simon L. Peyton Jones, Koen Claessen, Dan Rosén: HALO: haskell to logic through denotational semantics. POPL 2013: 431-442 | |
| 2012 | ||
| j6 | Andrew J. Kennedy, Dimitrios Vytiniotis: Every bit counts: The binary representation of typed data and programs. J. Funct. Program. 22(4-5): 529-573 (2012) | |
| c13 | Dimitrios Vytiniotis, Simon L. Peyton Jones, José Pedro Magalhães: Equality proofs and deferred type errors: a compiler pearl. ICFP 2012: 341-352 | |
| c12 | Dimitrios Vytiniotis, Thierry Coquand, David Wahlstedt: Stop When You Are Almost-Full - Adventures in Constructive Termination. ITP 2012: 250-265 | |
| c11 | Brent A. Yorgey, Stephanie Weirich, Julien Cretin, Simon L. Peyton Jones, Dimitrios Vytiniotis, José Pedro Magalhães: Giving Haskell a promotion. TLDI 2012: 53-66 | |
| 2011 | ||
| j5 | Dimitrios Vytiniotis, Simon L. Peyton Jones, Tom Schrijvers, Martin Sulzmann: OutsideIn(X) Modular type inference with local assumptions. J. Funct. Program. 21(4-5): 333-412 (2011) | |
| c10 | Maximilian C. Bolingbroke, Simon L. Peyton Jones, Dimitrios Vytiniotis: Termination combinators forever. Haskell 2011: 23-34 | |
| c9 | Stephanie Weirich, Dimitrios Vytiniotis, Simon L. Peyton Jones, Steve Zdancewic: Generative type abstraction and type-level computation. POPL 2011: 227-240 | |
| 2010 | ||
| j4 | Dimitrios Vytiniotis, Stephanie Weirich: Parametricity, type equality, and higher-order polymorphism. J. Funct. Program. 20(2): 175-210 (2010) | |
| c8 | ||
| c7 | Dimitrios Vytiniotis, Simon L. Peyton Jones, Tom Schrijvers: Let should not be generalized. TLDI 2010: 39-50 | |
| 2009 | ||
| c6 | Tom Schrijvers, Simon L. Peyton Jones, Martin Sulzmann, Dimitrios Vytiniotis: Complete and decidable type inference for GADTs. ICFP 2009: 341-352 | |
| 2008 | ||
| c5 | Dimitrios Vytiniotis, Stephanie Weirich, Simon L. Peyton Jones: FPH: first-class polymorphism for Haskell. ICFP 2008: 295-306 | |
| 2007 | ||
| j3 | Dimitrios Vytiniotis, Stephanie Weirich: Free Theorems and Runtime Type Representations. Electr. Notes Theor. Comput. Sci. 173: 357-373 (2007) | |
| j2 | Simon L. Peyton Jones, Dimitrios Vytiniotis, Stephanie Weirich, Mark Shields: Practical type inference for arbitrary-rank types. J. Funct. Program. 17(1): 1-82 (2007) | |
| 2006 | ||
| j1 | J. Nathan Foster, Dimitrios Vytiniotis: A Theory of Featherweight Java in Isabelle/HOL. Archive of Formal Proofs 2006 (2006) | |
| c4 | Simon L. Peyton Jones, Dimitrios Vytiniotis, Stephanie Weirich, Geoffrey Washburn: Simple unification-based type inference for GADTs. ICFP 2006: 50-61 | |
| c3 | Dimitrios Vytiniotis, Stephanie Weirich, Simon L. Peyton Jones: Boxy types: inference for higher-rank types and impredicativity. ICFP 2006: 251-262 | |
| 2005 | ||
| c2 | Dimitrios Vytiniotis, Geoffrey Washburn, Stephanie Weirich: An open and shut typecase. TLDI 2005: 13-24 | |
| c1 | Brian E. Aydemir, Aaron Bohannon, Matthew Fairbairn, J. Nathan Foster, Benjamin C. Pierce, Peter Sewell, Dimitrios Vytiniotis, Geoffrey Washburn, Stephanie Weirich, Steve Zdancewic: Mechanized Metatheory for the Masses: The PoplMark Challenge. TPHOLs 2005: 50-65 | |
Colors in the list of coauthors
Last update Fri May 24 05:21:48 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page