Call-by-Value Is Dual to Call-by-Name, Extended. - Daisuke Kimura (APLAS, 2007)

Duality between Call-by-value Reductions and Call-by-name Reductions. - Daisuke Kimura (Inf. Media Technol., 2007)

Analysis of Simple Single/Parallel Switched Dynamical Systems Based on Two Switching Strategies. - Yuki Ishikawa; Daisuke Kimura; Yasuhide Ishige; Toshimichi Saito (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2008)

Dual Calculus with Inductive and Coinductive Types. - Daisuke Kimura; Makoto Tatsuta (RTA, 2009)

Synchronization and Hyperchaos in Switched Dynamical Systems Based on Parallel Buck Converters. - Toshimichi Saito; Daisuke Kimura (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2009)

A Subpath Kernel for Rooted Unordered Trees. - Daisuke Kimura; Tetsuji Kuboyama; Tetsuo Shibuya; Hisashi Kashima (PAKDD (1), 2011)

A Trade-Off between the Maximum Power Point and Stability. - Daisuke Kimura; Toshimichi Saito (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2011)

Classical Natural Deduction for S4 Modal Logic. - Daisuke Kimura; Yoshihiko Kakutani (New Gener. Comput., 2011)

Fast Computation of Subpath Kernel for Trees. - Daisuke Kimura; Hisashi Kashima (ICML, 2012)

Induction by Coinduction and Control Operators in Call-by-Name. - Yoshihiko Kakutani; Daisuke Kimura (COS, 2013)

Call-by-Value and Call-by-Name Dual Calculi with Inductive and Coinductive Types - Daisuke Kimura; Makoto Tatsuta (Log. Methods Comput. Sci., 2013)

Study on Constants of Natural Language Texts. - Daisuke Kimura; Kumiko Tanaka-Ishii (Inf. Media Technol., 2014)

Separation Logic with Monadic Inductive Definitions and Implicit Existentials. - Makoto Tatsuta; Daisuke Kimura (APLAS, 2015)

Decision Procedure for Entailment of Symbolic Heaps with Arrays. - Daisuke Kimura; Makoto Tatsuta (APLAS, 2017)

Completeness of Cyclic Proofs for Symbolic Heaps. - Makoto Tatsuta; Koji Nakazawa; Daisuke Kimura (CoRR, 2018)

Completeness of Cyclic Proofs for Symbolic Heaps with Inductive Definitions. - Makoto Tatsuta; Koji Nakazawa; Daisuke Kimura (APLAS, 2019)

Restriction on Cut in Cyclic Proof System for Symbolic Heaps. - Kenji Saotome; Koji Nakazawa; Daisuke Kimura (FLOPS, 2020)

Function Pointer Eliminator for C Programs. - Daisuke Kimura; Mahmudul Faisal Al Ameen; Makoto Tatsuta; Koji Nakazawa (APLAS, 2021)

Failure of Cut-Elimination in the Cyclic Proof System of Bunched Logic with Inductive Propositions. - Kenji Saotome; Koji Nakazawa; Daisuke Kimura (FSCD, 2021)

A Symmetric Lambda-Calculus Corresponding to the Negation-Free Bilateral Natural Deduction. - Tatsuya Abe 001; Daisuke Kimura (CoRR, 2021)

Decidability for Entailments of Symbolic Heaps with Arrays. - Daisuke Kimura; Makoto Tatsuta (Log. Methods Comput. Sci., 2021)

A study for recovering the cut-elimination property in cyclic proof systems by restricting the arity of inductive predicates. - Yukihiro Masuoka; Daisuke Kimura (CoRR, 2022)

Extending a Call-by-Value Calculus Based on Bilateralism with Dynamic Binding. - Tatsuya Abe 001; Daisuke Kimura (FLAP, 2023)

A typed lambda-calculus with first-class configurations. - Tatsuya Abe 001; Daisuke Kimura (J. Log. Comput., 2023)

Restriction on cut rule in cyclic-proof system for symbolic heaps. - Kenji Saotome; Koji Nakazawa; Daisuke Kimura (Theor. Comput. Sci., 2024)

Explainable Multimodal Machine Learning for Revealing Structure-Property Relationships in Carbon Nanotube Fibers. - Daisuke Kimura; Naoko Tajima; Toshiya Okazaki; Shun Muroga (CoRR, 2025)