Yukiyoshi Kameyama

Baris Aktemur, Yukiyoshi Kameyama, Oleg Kiselyov, Chung-chieh Shan: Shonan challenge for generative programming: short position paper. PEPM 2013: 147-154

Jefferson O. Andrade, Yukiyoshi Kameyama: Efficient Multi-Valued Bounded Model Checking for LTL over Quasi-Boolean Algebras. IEICE Transactions 95-D(5): 1355-1364 (2012)

Asami Tanaka, Yukiyoshi Kameyama: A Call-by-Name CPS Hierarchy. FLOPS 2012: 260-274

Yukiyoshi Kameyama, Oleg Kiselyov, Chung-chieh Shan: Shifting the stage - Staging with delimited control. J. Funct. Program. 21(6): 617-662 (2011)

Koji Nakazawa, Makoto Tatsuta, Yukiyoshi Kameyama, Hiroshi Nakano: Type checking and typability in domain-free lambda calculi. Theor. Comput. Sci. 412(44): 6193-6207 (2011)

Yuichiro Kokaji, Yukiyoshi Kameyama: Polymorphic Multi-stage Language with Control Effects. APLAS 2011: 105-120

Yukiyoshi Kameyama, Asami Tanaka: Equational axiomatization of call-by-name delimited control. PPDP 2010: 77-86

Yukiyoshi Kameyama: Foreword. IEICE Transactions 92-D(5): 971 (2009)

Yukiyoshi Kameyama, Oleg Kiselyov, Chung-chieh Shan: Shifting the stage: staging with delimited control. PEPM 2009: 111-120

Masahiko Sato, Takafumi Sakurai, Yukiyoshi Kameyama, Atsushi Igarashi: Calculi of meta-variables. Frontiers of Computer Science in China 2(1): 12-21 (2008)

Jefferson O. Andrade, Yukiyoshi Kameyama: A Direct Algorithm for Multi-valued Bounded Model Checking. ATVA 2008: 80-94

Koji Nakazawa, Makoto Tatsuta, Yukiyoshi Kameyama, Hiroshi Nakano: Undecidability of Type-Checking in Domain-Free Typed Lambda-Calculi with Existence. CSL 2008: 478-492

Yukiyoshi Kameyama, Takuo Yonezawa: Typed Dynamic Control Operators for Delimited Continuations. FLOPS 2008: 239-254

Yukiyoshi Kameyama, Oleg Kiselyov, Chung-chieh Shan: Closing the stage: from staged code to typed closures. PEPM 2008: 147-157

Yukiyoshi Kameyama: Axioms for control operators in the CPS hierarchy. Higher-Order and Symbolic Computation 20(4): 339-369 (2007)

Kenichi Asai, Yukiyoshi Kameyama: Polymorphic Delimited Continuations. APLAS 2007: 239-254

Yukiyoshi Kameyama: Axioms for Delimited Continuations in the CPS Hierarchy. CSL 2004: 442-457

Yukiyoshi Kameyama, Peter J. Stuckey (Eds.): Functional and Logic Programming, 7th International Symposium, FLOPS 2004, Nara, Japan, April 7-9, 2004, Proceedings. Lecture Notes in Computer Science 2998, Springer 2004, isbn 3-540-21402-X

Yukiyoshi Kameyama, Masahito Hasegawa: A sound and complete axiomatization of delimited continuations. SIGPLAN Notices 38(9): 177-188 (2003)

Masahiko Sato, Takafumi Sakurai, Yukiyoshi Kameyama, Atsushi Igarashi: Calculi of Meta-variables. CSL 2003: 484-497

Yukiyoshi Kameyama, Masahito Hasegawa: A sound and complete axiomatization of delimited continuations. ICFP 2003: 177-188

Masahiko Sato, Takafumi Sakurai, Yukiyoshi Kameyama: A Simply Typed Context Calculus with First-class Environments. Journal of Functional and Logic Programming 2002 (2002)

Yukiyoshi Kameyama, Masahiko Sato: Strong normalizability of the non-deterministic catch/throw calculi. Theor. Comput. Sci. 272(1-2): 223-245 (2002)

Yukiyoshi Kameyama: Dynamic Control Operators in Type Theory. APLAS 2001: 1-11

Masahiko Sato, Yukiyoshi Kameyama, Izumi Takeuti: CAL: A Computer Assisted Learning System for Computation and Logic. EUROCAST 2001: 509-524

Masahiko Sato, Takafumi Sakurai, Yukiyoshi Kameyama: A Simply Typed Context Calculus with First-Class Environments. FLOPS 2001: 359-374

Yukiyoshi Kameyama: A Type-Theoretic Study on Partial Continuations. IFIP TCS 2000: 489-504

Yukiyoshi Kameyama, Masahiko Sato: A Classical Catch/Throw Calculus with Tag Abstractions and its Strong Normalizability. CATS 1998: 183-198

Yukiyoshi Kameyama: A Type-Free Theory of Half-Monotone Inductive Definitions. Int. J. Found. Comput. Sci. 6(3): 203-234 (1995)

Masahiko Sato, Yukiyoshi Kameyama: Conservativeness of Lambda over lambda-sigma-Calculus. Logic, Language and Computation 1994: 73-94