|
Search the dblp DataBase
Dimitrios Vytiniotis:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Simon L. Peyton Jones, Dimitrios Vytiniotis, Stephanie Weirich, Geoffrey Washburn
Simple unification-based type inference for GADTs. [Citation Graph (0, 0)][DBLP] ICFP, 2006, pp:50-61 [Conf]
- Dimitrios Vytiniotis, Stephanie Weirich, Simon L. Peyton Jones
Boxy types: inference for higher-rank types and impredicativity. [Citation Graph (0, 0)][DBLP] ICFP, 2006, pp:251-262 [Conf]
- Dimitrios Vytiniotis, Geoffrey Washburn, Stephanie Weirich
An open and shut typecase. [Citation Graph (0, 0)][DBLP] TLDI, 2005, pp:13-24 [Conf]
- 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. [Citation Graph (0, 0)][DBLP] TPHOLs, 2005, pp:50-65 [Conf]
- Dimitrios Vytiniotis, Stephanie Weirich
Free Theorems and Runtime Type Representations. [Citation Graph (0, 0)][DBLP] Electr. Notes Theor. Comput. Sci., 2007, v:173, n:, pp:357-373 [Journal]
- Simon L. Peyton Jones, Dimitrios Vytiniotis, Stephanie Weirich, Mark Shields
Practical type inference for arbitrary-rank types. [Citation Graph (0, 0)][DBLP] J. Funct. Program., 2007, v:17, n:1, pp:1-82 [Journal]
FPH: first-class polymorphism for Haskell. [Citation Graph (, )][DBLP]
Complete and decidable type inference for GADTs. [Citation Graph (, )][DBLP]
Let should not be generalized. [Citation Graph (, )][DBLP]
Search in 0.003secs, Finished in 0.004secs
|