Kameyama Yukiyoshi

Researcher's full information

Articles
  • Implementation of a Purely Functional Language Λ with Encapsulated Assignment
    山中淳彦; 佐藤雅彦; 亀山幸義
    Functional Programming (JSSST2002), Lecture notes/p.201-216, 1994-01
  • Conservativeness of Λ over λσ-calculus
    Masahiko Sato; Yukiyoshi Kameyama
    Lecture Notes in Computer Science/792/p.73-94, 1994-01
  • A Type-Free Theory of Half-Monotone Inductive Definitions
    Yukiyoshi Kameyama
    International Journal of Foundations of Computer Science/6(3)/p.203-234, 1995-01
  • A New Formulation of the Catch/Throw Mechanism
    Yukiyoshi Kameyama
    Proc. Second Fuji International Workshop on Functional and Logic Programming/p.106-122, 1997-01
  • A Classical Catch/Throw Calculus with Tag Abstractions and its Strong Normalizability
    Yukiyoshi Kameyama; Masahiko Sato
    Proc. 4th Australian Theory Symposium/20(3)/p.183-197, 1998-01
  • A Type-theoretic Study on Partial Continuations
    Yukiyoshi Kameyama
    Proceedings of IFIP International Conference on Theoretical Computer Science (Lecture Notes in Computer Science)/1872/p.489-504, 2000-08
  • Towards Logical Understanding of Delimited Continuations
    Yukiyoshi Kameyama
    Proceedings of Third ACM SIGPLAN Workshop on Continuations/p.27-33, 2001-01
  • A Type-free Context Calculus
    Azza A. Taha; Masahiko Sato; Yukiyoshi Kameyama
    Journal of Information Processing Society, Japan/42(1)/p.38-47, 2001-01
  • A Simply Typed Context Calculus with First-class Environments
    Masahiko Sato; Takafumi Sakurai; Yukiyoshi Kameyama
    Proceedings of International Symposium on Functional and Logic Programming (Lecture Notes in Computer Science)/2024/p.359-374, 2001-03
  • CAL: A Computer Assisted Learning system for Computation and Logic
    Masahiko Sato; Yukiyoshi Kameyama; Takeuti Izumi
    Proceedings of EUROCAST2001, Lecture Notes in Computer Science/(2178)/p.509-524, 2001-01
  • Strong Normalizability of the Non-deterministic Catch/Throw Calculi
    Yukiyoshi Kameyama; Masahiko Sato
    Theoretical Computer Science/272(1-2)/p.223-245, 2002-03
  • A Simply Typed Context Calculus with First-Class Environments
    Masahiko Sato; Takafumi Sakurai; Yukiyoshi Kameyama
    Journal of Functional and Logic Programming/(2002(4))/p.1-41, 2002-01
  • A Sound and Complete Axiomatization for Delimited Continuations
    Yukiyoshi Kameyama; Masahito Hasegawa
    Proceedings of the Eigth ACM International Conference on Functional Programming (ICFP '03)/p.pp. 484-497, 2003-08
  • Calculi of Meta-Variables
    Masahiko Sato; Takafumi Sakurai; Yukiyoshi Kameyama; Atsu...
    Proceedings of the 17th International Workshop on Computer Science Logic (CSL'03), Lecture Notes in Computer Science 2803/p.pp. 484-497, 2003-01
  • Axiomatizing Higher-Level Delimited Continuations
    Yukiyoshi Kameyama
    Proceedings of the Fourth ACM-SIGPLAN Continuation Workshop (CW04)/p.49-53, 2004-01
  • E-learning of Foundation of Computer Science
    Yukiyoshi Kameyama; Masahiko Sato
    Prof. AEARU Workshop on Network Weducation/p.169-181, 2006-11
  • Simulations of Multi-Valued Models for Modal mu-Calculus
    Koki Nishizawa; Yukiyoshi Kameyama; Yoshiki Kinoshita
    Technical Report, National Institute of Advanced Industrial Science and Technology, Japan (AIST)/AIST01-J00022-68/p.1-18, 2007-04
  • Polymorphic Delimited Continuations
    Kenichi Asai; Yukiyoshi Kameyama
    Proceedings of the Fifth Asian Symposium on Programming Languages and Systems (Lecture Notes in Computer Science)/4807/p.239-254, 2007-11
  • Axioms for Control Operators in the CPS Hierarchy
    Yukiyoshi Kameyama
    Higher-Order and Symbolic Computation/20/p.339-369, 2007-12
  • Calculi of Meta-variables
    Masahiko Sato; Takafumi Sakurai; Yukiyoshi Kameyama; Atsu...
    Frontiers of Computer Science in China/2(1)/p.12-21, 2008-03
  • Typed Dynamic Control Operators for Delimited Continuations
    Yukiyoshi Kameyama; Takuo Yonezawa
    Proc. International Symposium on Functional and Logic Programming (FLOPS '08), Lecture Notes in Computer Science/4989, 2008-04
  • Strong Normalization of Polymorphic Calculus for Delimited Continuations
    Yukiyoshi Kameyama; Kenichi Asai
    Proc. Symbolic Computation in Software Science, Austria-Japan Workshop/08(08)/p.96-108, 2008-07
  • Undecidability of Type-checking in Domain-free Typed Lambda-Calculi with Existence
    Koji Nakazawa; Makoto Tatsuta; Yukiyoshi Kameyama; Hirosh...
    Proc. Annual Conf. on Computer Science Logic (CSL 2008), Lecture Notes in Computer Science/5213/p.478-492, 2008-09
  • A Direct Algorithm for Multi-Valued Bounded Model Checking
    Jefferson O. Andrade; Yukiyoshi Kameyama
    Proc. International Symp. on Automated Technology for Verification and Analysis (ATVA 2008), Lecture Notes in Computer Science/5311/p.80-94, 2008-10
  • Shifting the Stage - Staging with Delimited Control
    Yukiyoshi Kameyama; Oleg Kiselyov; Chung-chieh Shan
    Proc. ACM SIGPLAN Symposium on Partial Evaluation and Program Manipulation (PEPM'09)/p.111-120, 2009-01
  • more...