Dimitrios Vytiniotis
From MaRDI portal
Person:2819689
List of research outcomes
This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!
| Publication | Date of Publication | Type |
|---|---|---|
| Modular, higher order cardinality analysis in theory and practice Journal of Functional Programming | 2017-10-23 | Paper |
| HLIO: mixing static and dynamic typing for information-flow control in Haskell Proceedings of the 20th ACM SIGPLAN International Conference on Functional Programming | 2017-05-10 | Paper |
| Evidence normalization in System FC (invited talk) | 2017-02-01 | Paper |
| Refinement types for Haskell Proceedings of the 19th ACM SIGPLAN international conference on Functional programming | 2016-09-29 | Paper |
| A reflection on types A List of Successes That Can Change the World | 2016-08-17 | Paper |
| Boxy types, inference for higher-rank types and impredicativity Proceedings of the eleventh ACM SIGPLAN international conference on Functional programming | 2015-08-03 | Paper |
| Free theorems and runtime type representations Electronic Notes in Theoretical Computer Science | 2015-07-10 | Paper |
| FPH: first-class polymorphism for Haskell Proceedings of the 13th ACM SIGPLAN international conference on Functional programming | 2015-03-16 | Paper |
| Functional pearl: every bit counts Proceedings of the 15th ACM SIGPLAN international conference on Functional programming | 2015-03-05 | Paper |
| Complete and decidable type inference for GADTs Proceedings of the 14th ACM SIGPLAN international conference on Functional programming | 2015-01-06 | Paper |
| HALO, Haskell to logic through denotational semantics Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages | 2014-11-27 | Paper |
| Generative type abstraction and type-level computation Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages | 2014-04-10 | Paper |
| Modular, higher-order cardinality analysis in theory and practice Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages | 2014-04-10 | Paper |
| Closed type families with overlapping equations Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages | 2014-04-10 | Paper |
| \textsc{OutsideIn(X)}: modular type inference with local assumptions Journal of Functional Programming | 2013-04-24 | Paper |
| Every bit counts: the binary representation of typed data and programs Journal of Functional Programming | 2012-10-29 | Paper |
| Stop when you are almost-full. Adventures in constructive termination Interactive Theorem Proving | 2012-09-20 | Paper |
| Parametricity, type equality, and higher-order polymorphism Journal of Functional Programming | 2010-05-26 | Paper |
| Practical type inference for arbitrary-rank types Journal of Functional Programming | 2007-02-07 | Paper |
| Theorem Proving in Higher Order Logics Lecture Notes in Computer Science | 2006-07-06 | Paper |
Research outcomes over time
This page was built for person: Dimitrios Vytiniotis
