| Polymorphic delimited continuations K Asai, Y Kameyama Programming Languages and Systems: 5th Asian Symposium, APLAS 2007 …, 2007 | 95 | 2007 |
| A sound and complete axiomatization of delimited continuations Y Kameyama, M Hasegawa Proceedings of the eighth ACM SIGPLAN international conference on Functional …, 2003 | 82 | 2003 |
| Shifting the stage: Staging with delimited control Y Kameyama, O Kiselyov, C Shan Proceedings of the 2009 ACM SIGPLAN workshop on Partial Evaluation and …, 2009 | 67 | 2009 |
| A simply typed context calculus with first-class environments M Sato, T Sakurai, Y Kameyama Functional and Logic Programming: 5th International Symposium, FLOPS 2001 …, 2001 | 36 | 2001 |
| Calculi of meta-variables M Sato, T Sakurai, Y Kameyama, A Igarashi Computer Science Logic: 17th International Workshop CSL 2003, 12th Annual …, 2003 | 34 | 2003 |
| Combinators for impure yet hygienic code generation Y Kameyama, O Kiselyov, C Shan Proceedings of the ACM SIGPLAN 2014 Workshop on Partial Evaluation and …, 2014 | 32 | 2014 |
| Closing the stage: From staged code to typed closures Y Kameyama, O Kiselyov, C Shan Proceedings of the 2008 ACM SIGPLAN symposium on Partial evaluation and …, 2008 | 32 | 2008 |
| Typed dynamic control operators for delimited continuations Y Kameyama, T Yonezawa Functional and Logic Programming: 9th International Symposium, FLOPS 2008 …, 2008 | 31 | 2008 |
| Finally, safely-extensible and efficient language-integrated query K Suzuki, O Kiselyov, Y Kameyama Proceedings of the 2016 aCM sIGPLAN workshop on partial evaluation and …, 2016 | 27 | 2016 |
| Shonan challenge for generative programming: short position paper B Aktemur, Y Kameyama, O Kiselyov, C Shan Proceedings of the ACM SIGPLAN 2013 workshop on Partial evaluation and …, 2013 | 25 | 2013 |
| Refined environment classifiers: type-and scope-safe code generation with mutable cells O Kiselyov, Y Kameyama, Y Sudo Programming Languages and Systems: 14th Asian Symposium, APLAS 2016, Hanoi …, 2016 | 21 | 2016 |
| Axioms for delimited continuations in the CPS hierarchy Y Kameyama Computer Science Logic: 18th International Workshop, CSL 2004, 13th Annual …, 2004 | 21 | 2004 |
| Undecidability of type-checking in domain-free typed lambda-calculi with existence K Nakazawa, M Tatsuta, Y Kameyama, H Nakano Computer Science Logic: 22nd International Workshop, CSL 2008, 17th Annual …, 2008 | 17 | 2008 |
| Axioms for control operators in the CPS hierarchy Y Kameyama Higher-Order and Symbolic Computation 20, 339-369, 2007 | 17 | 2007 |
| Answer-type modification without tears: Prompt-passing style translation for typed delimited-control operators I Kobori, Y Kameyama, O Kiselyov arXiv preprint arXiv:1606.06379, 2016 | 16 | 2016 |
| Staging beyond terms: Prospects and challenges J Inoue, O Kiselyov, Y Kameyama Proceedings of the 2016 ACM SIGPLAN Workshop on Partial Evaluation and …, 2016 | 16 | 2016 |
| A type-theoretic study on partial continuations Y Kameyama IFIP International Conference on Theoretical Computer Science, 489-504, 2000 | 15 | 2000 |
| Strong normalizability of the non-deterministic catch/throw calculi Y Kameyama, M Sato Theoretical Computer Science 272 (1-2), 223-245, 2002 | 14 | 2002 |
| Towards logical understanding of delimited continuations Y Kameyama Proceedings of the Third ACM SIGPLAN Workshop on Continuations, CW 1, 27-33, 2000 | 12 | 2000 |
| A new formulation of the catch/throw mechanism Y Kameyama Proceedings 2nd Fuji Intl. Workshop on Functional and Logic Programming …, 1997 | 12 | 1997 |
Chung-chieh ShanIndiana UniversityVerified email at indiana.edu
