Showing results 6 to 18 of 18
< previous
| Title | Author(s) | Issue Date | |
|---|---|---|---|
Formalization of a Polymorphic Subtyping Algorithm Proceeding/Conference:Proceedings of the 9th International Conference on Interactive Theorem Proving (ITP 2018) | 2018 | ||
The implicit calculus: A new foundation for generic programming Proceeding/Conference:Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI) | 2012 | ||
The implicit calculus: A new foundation for generic programming Proceeding/Conference:ACM SIGPLAN Notices | 2012 | ||
Meta-theory à la carte Proceeding/Conference:Conference Record of the Annual ACM Symposium on Principles of Programming Languages | 2013 | ||
Meta-theory à la Carte Proceeding/Conference:ACM SIGPLAN Notices | 2013 | ||
Modular Monadic Meta-Theory Proceeding/Conference:Proceedings of the 18th ACM SIGPLAN international conference on Functional programming (ICFP 2013) | 2013 | ||
Monads, zippers and views: Virtualizing the monad stack Proceeding/Conference:ACM SIGPLAN Notices | 2011 | ||
Monads, zippers and views: Virtualizing the monad stack Proceeding/Conference:Proceedings of the ACM SIGPLAN International Conference on Functional Programming, ICFP | 2011 | ||
MRI: Modular reasoning about interference in incremental programming Journal:Journal of Functional Programming | 2012 | ||
Quantified class constraints Proceeding/Conference:Proceedings of the 10th ACM SIGPLAN International Symposium on Haskell | 2017 | ||
Resolution as intersection subtyping via Modus Ponens Journal:Proceedings of the ACM on Programming Languages | 2020 | ||
Row and Bounded Polymorphism via Disjoint Polymorphism Proceeding/Conference:LIPICS - Leibniz International Proceedings in Informatics | 2020 | ||
The Essence of Nested Composition Proceeding/Conference:LIPICS - Leibniz International Proceedings in Informatics | 2018 |