default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKentaro Kikuchi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2021
[j7]Yoshi Fujiwara
, Hiroyasu Inoue, Takayuki Yamaguchi, Hideaki Aoyama, Takuma Tanaka, Kentaro Kikuchi:
Money flow network among firms' accounts in a regional bank of Japan. EPJ Data Sci. 10(1): 19 (2021)- 2020
- [j6]Makoto Hamana, Tatsuya Abe, Kentaro Kikuchi:
Polymorphic computation systems: Theory and practice of confluence with call-by-value. Sci. Comput. Program. 187: 102322 (2020) - 2008
- [j5]Kentaro Kikuchi:
Call-by-name reduction and cut-elimination in classical logic. Ann. Pure Appl. Log. 153(1-3): 38-65 (2008) - 2007
- [j4]Ryo Ishigaki, Kentaro Kikuchi:
A Tree-Sequent Calculus for a Natural Predicate Extension of Visser's Propositional Logic. Log. J. IGPL 15(2): 149-164 (2007) - 2003
- [j3]Kentaro Kikuchi, Katsumi Sasaki:
A Cut-Free Gentzen Formulation of Basic Propositional Calculus. J. Log. Lang. Inf. 12(2): 213-225 (2003) - 2002
- [j2]Kentaro Kikuchi:
Dual-Context Sequent Calculus and Strict Implication. Math. Log. Q. 48(1): 87-92 (2002) - 2001
- [j1]Katsumasa Ishii, Ryo Kashima, Kentaro Kikuchi:
Sequent Calculi for Visser's Propositional Logics. Notre Dame J. Formal Log. 42(1): 1-22 (2001)
Conference and Workshop Papers
- 2022
- [c20]Kentaro Kikuchi:
Ground Confluence and Strong Commutation Modulo Alpha-Equivalence in Nominal Rewriting. ICTAC 2022: 255-271 - 2021
- [c19]Kentaro Kikuchi, Takahito Aoto:
Simple Derivation Systems for Proving Sufficient Completeness of Non-Terminating Term Rewriting Systems. FSTTCS 2021: 49:1-49:15 - [c18]Tomoki Shiraishi, Kentaro Kikuchi, Takahito Aoto:
A Proof Method for Local Sufficient Completeness of Term Rewriting Systems. ICTAC 2021: 386-404 - 2020
- [c17]Kentaro Kikuchi, Takahito Aoto:
Confluence and Commutation for Nominal Rewriting Systems with Atom-Variables. LOPSTR 2020: 56-73 - 2019
- [c16]Kentaro Kikuchi, Takahito Aoto, Isao Sasano:
Inductive Theorem Proving in Non-terminating Rewriting Systems and Its Application to Program Transformation. PPDP 2019: 13:1-13:14 - 2017
- [c15]Kentaro Kikuchi, Takahito Aoto, Yoshihito Toyama:
Parallel Closure Theorem for Left-Linear Nominal Rewriting Systems. FroCoS 2017: 115-131 - 2016
- [c14]Takahito Aoto, Kentaro Kikuchi:
Nominal Confluence Tool. IJCAR 2016: 173-182 - [c13]Takaki Suzuki, Kentaro Kikuchi, Takahito Aoto, Yoshihito Toyama:
Critical Pair Analysis in Nominal Rewriting. SCSS 2016: 156-168 - 2015
- [c12]Koichi Sato, Kentaro Kikuchi, Takahito Aoto, Yoshihito Toyama:
Correctness of Context-Moving Transformations for Term Rewriting Systems. LOPSTR 2015: 331-345 - [c11]Takaki Suzuki, Kentaro Kikuchi, Takahito Aoto, Yoshihito Toyama:
Confluence of Orthogonal Nominal Rewriting Systems Revisited. RTA 2015: 301-317 - 2014
- [c10]Kentaro Kikuchi, Takafumi Sakurai:
A Translation of Intersection and Union Types for the λμ-Calculus. APLAS 2014: 120-139 - [c9]Kentaro Kikuchi:
Uniform Proofs of Normalisation and Approximation for Intersection Types. ITRS 2014: 10-23 - 2013
- [c8]Kentaro Kikuchi:
Proving Strong Normalisation via Non-deterministic Translations into Klop's Extended lambda-Calculus. CSL 2013: 395-414 - 2008
- [c7]Kentaro Kikuchi, Stéphane Lengrand:
Strong Normalisation of Cut-Elimination That Simulates beta-Reduction. FoSSaCS 2008: 380-394 - 2007
- [c6]Kentaro Kikuchi:
Confluence of Cut-Elimination Procedures for the Intuitionistic Sequent Calculus. CiE 2007: 398-407 - [c5]Kentaro Kikuchi:
Simple Proofs of Characterizing Strong Normalization for Explicit Substitution Calculi. RTA 2007: 257-272 - [c4]Ryo Ishigaki, Kentaro Kikuchi:
Tree-Sequent Methods for Subintuitionistic Predicate Logics. TABLEAUX 2007: 149-164 - 2006
- [c3]Kentaro Kikuchi:
On a Local-Step Cut-Elimination Procedure for the Intuitionistic Sequent Calculus. LPAR 2006: 120-134 - 2004
- [c2]Kentaro Kikuchi:
A Direct Proof of Strong Normalization for an Extended Herbelin?s Calculus. FLOPS 2004: 244-259 - 2000
- [c1]Koichi Konishi, Kentaro Kikuchi, Hideki Kawai, Kunihiko Kojima, Ken'ichi Ohmachi, Susumu Akamine, Toshikazu Fukushima:
Chained Declustering using Multiple Conventional Filesystems. CLUSTER 2000: 381-382
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-04-24 23:21 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
