default search action
Yukiyoshi Kameyama
Person information
- affiliation: University of Tsukuba, Japan
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j13]Masahiro Masuda, Yukiyoshi Kameyama:
Program generation meets program verification: A case study on number-theoretic transform. Sci. Comput. Program. 232: 103035 (2024) - 2023
- [c36]Ryo Tokuda, Yukiyoshi Kameyama:
Generating Programs for Polynomial Multiplication with Correctness Assurance. PEPM@POPL 2023: 27-40 - 2022
- [c35]Masahiro Masuda, Yukiyoshi Kameyama:
Unified Program Generation and Verification: A Case Study on Number-Theoretic Transform. FLOPS 2022: 133-151 - [e3]Bernhard Scholz, Yukiyoshi Kameyama:
Proceedings of the 21st ACM SIGPLAN International Conference on Generative Programming: Concepts and Experiences, GPCE 2022, Auckland, New Zealand, December 6-7, 2022. ACM 2022, ISBN 978-1-4503-9920-3 [contents] - 2021
- [c34]Yuhi Sato, Yukiyoshi Kameyama:
Type-safe generation of modules in applicative and generative styles. GPCE 2021: 184-196 - [c33]Masahiro Masuda, Yukiyoshi Kameyama:
FFT Program Generation for Ring LWE-Based Cryptography. IWSEC 2021: 151-171 - 2020
- [c32]Rui Okura, Yukiyoshi Kameyama:
Language-Integrated Query with Nested Data Structures and Grouping. FLOPS 2020: 139-158 - [c31]Rui Okura, Yukiyoshi Kameyama:
Reorganizing queries with grouping. GPCE 2020: 50-62 - [c30]Yuhi Sato, Yukiyoshi Kameyama, Takahisa Watanabe:
Module generation without regret. PEPM@POPL 2020: 1-13 - [c29]Satoru Kawahara, Yukiyoshi Kameyama:
One-Shot Algebraic Effects as Coroutines. TFP 2020: 159-179
2010 – 2019
- 2018
- [c28]Takahisa Watanabe, Yukiyoshi Kameyama:
Program generation for ML modules (short paper). PEPM 2018: 60-66 - [i3]Oleg Kiselyov, Tiark Rompf, Jennifer Neville, Yukiyoshi Kameyama:
Meta-Programming for Statistical Machine Learning (NII Shonan Meeting 2018-7). NII Shonan Meet. Rep. 2018 (2018) - 2017
- [c27]Junpei Oishi, Yukiyoshi Kameyama:
Staging with control: type-safe multi-stage programming with control operators. GPCE 2017: 29-40 - 2016
- [c26]Oleg Kiselyov, Yukiyoshi Kameyama, Yuto Sudo:
Refined Environment Classifiers - Type- and Scope-Safe Code Generation with Mutable Cells. APLAS 2016: 271-291 - [c25]Kenichi Suzuki, Oleg Kiselyov, Yukiyoshi Kameyama:
Finally, safely-extensible and efficient language-integrated query. PEPM 2016: 37-48 - [c24]Jun Inoue, Oleg Kiselyov, Yukiyoshi Kameyama:
Staging beyond terms: prospects and challenges. PEPM 2016: 103-108 - [c23]Kenichi Asai, Yukiyoshi Kameyama:
Automatic Staging via Partial Evaluation Techniques. SCSS 2016: 1-13 - [e2]David Duke, Yukiyoshi Kameyama:
Proceedings of the 5th International Workshop on Functional High-Performance Computing, FHPC@ICFP 2016, Nara, Japan, September 22, 2016. ACM 2016, ISBN 978-1-4503-4433-3 [contents] - 2015
- [j12]Yukiyoshi Kameyama, Oleg Kiselyov, Chung-chieh Shan:
Combinators for impure yet hygienic code generation. Sci. Comput. Program. 112: 120-144 (2015) - [c22]Naoki Takashima, Hiroki Sakamoto, Yukiyoshi Kameyama:
Generate and offshore: type-safe and modular code generation for low-level optimization. FHPC@ICFP 2015: 45-53 - [c21]Ikuo Kobori, Yukiyoshi Kameyama, Oleg Kiselyov:
Answer-Type Modification without Tears: Prompt-Passing Style Translation for Typed Delimited-Control Operators. WoC 2015: 36-52 - 2014
- [c20]Yukiyoshi Kameyama, Oleg Kiselyov, Chung-chieh Shan:
Combinators for impure yet hygienic code generation. PEPM 2014: 3-14 - [i2]Oleg Kiselyov, Jeremy G. Siek, Yukiyoshi Kameyama:
Staging and high-performance computing: theory and practice (NII Shonan Meeting 2014-7). NII Shonan Meet. Rep. 2014 (2014) - 2013
- [c19]Baris Aktemur, Yukiyoshi Kameyama, Oleg Kiselyov, Chung-chieh Shan:
Shonan challenge for generative programming: short position paper. PEPM 2013: 147-154 - 2012
- [j11]Jefferson O. Andrade, Yukiyoshi Kameyama:
Efficient Multi-Valued Bounded Model Checking for LTL over Quasi-Boolean Algebras. IEICE Trans. Inf. Syst. 95-D(5): 1355-1364 (2012) - [c18]Asami Tanaka, Yukiyoshi Kameyama:
A Call-by-Name CPS Hierarchy. FLOPS 2012: 260-274 - [i1]Oleg Kiselyov, Chung-chieh Shan, Yukiyoshi Kameyama:
Bridging the theory of staged programming languages and the practice of high-performance computing (NII Shonan Meeting 2012-4). NII Shonan Meet. Rep. 2012 (2012) - 2011
- [j10]Yukiyoshi Kameyama, Oleg Kiselyov, Chung-chieh Shan:
Shifting the stage - Staging with delimited control. J. Funct. Program. 21(6): 617-662 (2011) - [j9]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) - [c17]Yuichiro Kokaji, Yukiyoshi Kameyama:
Polymorphic Multi-stage Language with Control Effects. APLAS 2011: 105-120 - 2010
- [j8]Cynthia Kustanto, Yukiyoshi Kameyama:
Improving Error Messages in Type System. Inf. Media Technol. 5(4): 1241-1254 (2010) - [c16]Yukiyoshi Kameyama, Asami Tanaka:
Equational axiomatization of call-by-name delimited control. PPDP 2010: 77-86
2000 – 2009
- 2009
- [j7]Yukiyoshi Kameyama:
Foreword. IEICE Trans. Inf. Syst. 92-D(5): 971 (2009) - [c15]Yukiyoshi Kameyama, Oleg Kiselyov, Chung-chieh Shan:
Shifting the stage: staging with delimited control. PEPM 2009: 111-120 - 2008
- [j6]Masahiko Sato, Takafumi Sakurai, Yukiyoshi Kameyama, Atsushi Igarashi:
Calculi of meta-variables. Frontiers Comput. Sci. China 2(1): 12-21 (2008) - [j5]Takuo Yonezawa, Yukiyoshi Kameyama:
A Type System for Dynamic Delimited Continuations. Inf. Media Technol. 3(2): 316-326 (2008) - [c14]Jefferson O. Andrade, Yukiyoshi Kameyama:
A Direct Algorithm for Multi-valued Bounded Model Checking. ATVA 2008: 80-94 - [c13]Koji Nakazawa, Makoto Tatsuta, Yukiyoshi Kameyama, Hiroshi Nakano:
Undecidability of Type-Checking in Domain-Free Typed Lambda-Calculi with Existence. CSL 2008: 478-492 - [c12]Yukiyoshi Kameyama, Takuo Yonezawa:
Typed Dynamic Control Operators for Delimited Continuations. FLOPS 2008: 239-254 - [c11]Yukiyoshi Kameyama, Oleg Kiselyov, Chung-chieh Shan:
Closing the stage: from staged code to typed closures. PEPM 2008: 147-157 - 2007
- [j4]Yukiyoshi Kameyama:
Axioms for control operators in the CPS hierarchy. High. Order Symb. Comput. 20(4): 339-369 (2007) - [c10]Kenichi Asai, Yukiyoshi Kameyama:
Polymorphic Delimited Continuations. APLAS 2007: 239-254 - 2004
- [c9]Yukiyoshi Kameyama:
Axioms for Delimited Continuations in the CPS Hierarchy. CSL 2004: 442-457 - [e1]Yukiyoshi Kameyama, Peter J. Stuckey:
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 [contents] - 2003
- [c8]Masahiko Sato, Takafumi Sakurai, Yukiyoshi Kameyama, Atsushi Igarashi:
Calculi of Meta-variables. CSL 2003: 484-497 - [c7]Yukiyoshi Kameyama, Masahito Hasegawa:
A sound and complete axiomatization of delimited continuations. ICFP 2003: 177-188 - 2002
- [j3]Masahiko Sato, Takafumi Sakurai, Yukiyoshi Kameyama:
A Simply Typed Context Calculus with First-class Environments. J. Funct. Log. Program. 2002 (2002) - [j2]Yukiyoshi Kameyama, Masahiko Sato:
Strong normalizability of the non-deterministic catch/throw calculi. Theor. Comput. Sci. 272(1-2): 223-245 (2002) - 2001
- [c6]Yukiyoshi Kameyama:
Dynamic Control Operators in Type Theory. APLAS 2001: 1-11 - [c5]Masahiko Sato, Yukiyoshi Kameyama, Izumi Takeuti:
CAL: A Computer Assisted Learning System for Computation and Logic. EUROCAST 2001: 509-524 - [c4]Masahiko Sato, Takafumi Sakurai, Yukiyoshi Kameyama:
A Simply Typed Context Calculus with First-Class Environments. FLOPS 2001: 359-374 - 2000
- [c3]Yukiyoshi Kameyama:
A Type-Theoretic Study on Partial Continuations. IFIP TCS 2000: 489-504
1990 – 1999
- 1998
- [c2]Yukiyoshi Kameyama, Masahiko Sato:
A Classical Catch/Throw Calculus with Tag Abstractions and its Strong Normalizability. CATS 1998: 183-198 - 1995
- [j1]Yukiyoshi Kameyama:
A Type-Free Theory of Half-Monotone Inductive Definitions. Int. J. Found. Comput. Sci. 6(3): 203-234 (1995) - 1994
- [c1]Masahiko Sato, Yukiyoshi Kameyama:
Conservativeness of Lambda over lambda-sigma-Calculus. Logic, Language and Computation 1994: 73-94
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-06 00:40 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint