Year |
Citation |
Score |
2017 |
Zhang D, Myers AC, Vytiniotis D, Peyton-Jones S. SHErrLoc: A Static Holistic Error Locator Acm Transactions On Programming Languages and Systems. 39: 18. DOI: 10.1145/3121137 |
0.456 |
|
2014 |
Vazou N, Seidel EL, Jhala R, Vytiniotis D, Peyton-Jones S. Refinement types for Haskell Acm Sigplan Notices. 49: 269-282. DOI: 10.1145/2628136.2628161 |
0.429 |
|
2014 |
Eisenberg RA, Vytiniotis D, Peyton Jones S, Weirich S. Closed type families with overlapping equations Conference Record of the Annual Acm Symposium On Principles of Programming Languages. 671-683. DOI: 10.1145/2535838.2535856 |
0.572 |
|
2014 |
Sergey I, Vytiniotis D, Peyton Jones S. Modular, higher-order cardinality analysis in theory and practice Conference Record of the Annual Acm Symposium On Principles of Programming Languages. 335-347. DOI: 10.1017/S0956796817000016 |
0.365 |
|
2013 |
Vytiniotis D, Jones SP. Evidence normalization in system FC Leibniz International Proceedings in Informatics, Lipics. 21: 20-38. DOI: 10.4230/LIPIcs.RTA.2013.20 |
0.347 |
|
2012 |
Vytiniotis D, Jones SP, Magalhães JP. Equality proofs and deferred type errors a compiler pearl Acm Sigplan Notices. 47: 341-352. DOI: 10.1145/2398856.2364554 |
0.313 |
|
2012 |
Vytiniotis D, Peyton Jones S, Magalhães JP. Equality proofs and deferred type errors: A compiler pearl Proceedings of the Acm Sigplan International Conference On Functional Programming, Icfp. 341-352. DOI: 10.1145/2364527.2364554 |
0.312 |
|
2012 |
Yorgey BA, Weirich S, Cretin J, Jones SP, Vytiniotis D, Magalhães JP. Giving haskell a promotion Conference Record of the Annual Acm Symposium On Principles of Programming Languages. 53-65. DOI: 10.1145/2103786.2103795 |
0.615 |
|
2012 |
Kennedy AJ, Vytiniotis D. Every bit counts: The binary representation of typed data and programs Journal of Functional Programming. 22: 529-573. DOI: 10.1017/S0956796812000263 |
0.462 |
|
2011 |
Weirich S, Vytiniotis D, Jones SP, Zdancewic S. Generative type abstraction and type-level computation Acm Sigplan Notices. 46: 227-239. DOI: 10.1145/1925844.1926411 |
0.698 |
|
2011 |
Vytiniotis D, jones SP, Schrijvers T, Sulzmann M. Outsidein(x) modular type inference with local assumptions Journal of Functional Programming. 21: 333-412. DOI: 10.1017/S0956796811000098 |
0.501 |
|
2010 |
Vytiniotis D, Kennedy AJ. Functional pearl: Every bit counts Proceedings of the Acm Sigplan International Conference On Functional Programming, Icfp. 15-26. DOI: 10.1145/1863543.1863548 |
0.329 |
|
2010 |
Vytiniotis D, Peyton Jones S, Schrijvers T. Let should not be generalized Tldi'10 - Proceedings of the 2010 Acm Sigplan Workshop On Types in Language Design and Implementation. 39-50. DOI: 10.1145/1708016.1708023 |
0.448 |
|
2010 |
Vytiniotis D, Weirich S. Parametricity, type equality, and higher-order polymorphism Journal of Functional Programming. 20: 175-210. DOI: 10.1017/S0956796810000079 |
0.748 |
|
2009 |
Russo CV, Vytiniotis D. QML: Explicit first-class polymorphism for ML Ml'09 - Proceedings of the 2009 Acm Sigplan Workshop On Ml. 3-14. DOI: 10.1145/1596627.1596630 |
0.579 |
|
2009 |
Schrijvers T, Jones SP, Sulzmann M, Vytiniotis D. Complete and decidable type inference for GADTs Proceedings of the Acm Sigplan International Conference On Functional Programming, Icfp. 341-352. DOI: 10.1145/1596550.1596599 |
0.494 |
|
2008 |
Vytiniotis D, Weirich S, Jones SP. FPH: First-class polymorphism for Haskell: Declarative, constraint-free type inference for impredicative polymorphism Proceedings of the Acm Sigplan International Conference On Functional Programming, Icfp. 295-306. DOI: 10.1145/1411204.1411246 |
0.644 |
|
2008 |
Vytiniotis D, Weirich S, Jones SP. FPH: First-class polymorphism for haskell declarative, constraint-free type inference for impredicative polymorphism Acm Sigplan Notices. 43: 295-306. |
0.644 |
|
2007 |
Jones SP, Vytiniotis D, Weirich S, Shields M. Practical type inference for arbitrary-rank types Journal of Functional Programming. 17: 1-82. DOI: 10.1017/S0956796806006034 |
0.745 |
|
2007 |
Vytiniotis D, Weirich S. Free Theorems and Runtime Type Representations Electronic Notes in Theoretical Computer Science. 173: 357-373. DOI: 10.1016/J.Entcs.2007.02.043 |
0.71 |
|
2006 |
Vytiniotis D, Weirich S, Jones SP. Boxy types: Inference for higher-rank types and impredicativity Proceedings of the Acm Sigplan International Conference On Functional Programming, Icfp. 2006: 251-262. DOI: 10.1145/1159803.1159838 |
0.727 |
|
2006 |
Jones SP, Vytiniotis D, Weirich S, Washburn G. Simple unification-based type inference for GADTS Proceedings of the Acm Sigplan International Conference On Functional Programming, Icfp. 2006: 50-61. DOI: 10.1145/1159803.1159811 |
0.695 |
|
2005 |
Vytiniotis D, Washburn G, Weirich S. An open and shut typecase Proceedings of the Tldi'05: 2005 Acm Sigplan International Workshop On Types in Languages Design and Implementation. 13-24. |
0.495 |
|
2005 |
Aydemir BE, Bohannon A, Fairbairn M, Foster JN, Pierce BC, Sewell P, Vytiniotis D, Washburn G, Weirich S, Zdancewic S. Mechanized metatheory for the masses: The PoplMark challenge Lecture Notes in Computer Science. 3603: 50-65. |
0.621 |
|
Show low-probability matches. |