default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKeiichirou Kusakari
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2018
[j15]Keiichirou Kusakari:
Static Dependency Pair Method in Functional Programs. IEICE Trans. Inf. Syst. 101-D(6): 1491-1502 (2018)- 2016
- [c4]Akihisa Yamada
, Christian Sternagel, René Thiemann, Keiichirou Kusakari:
AC Dependency Pairs Revisited. CSL 2016: 8:1-8:16 - 2015
- [j14]Akihisa Yamada, Keiichirou Kusakari, Toshiki Sakabe:
A unified ordering for termination proving. Sci. Comput. Program. 111: 110-134 (2015) - 2014
- [c3]Akihisa Yamada, Keiichirou Kusakari, Toshiki Sakabe:
Nagoya Termination Tool. RTA-TLCA 2014: 466-475 - [i4]Akihisa Yamada, Keiichirou Kusakari, Toshiki Sakabe:
A Unified Ordering for Termination Proving. CoRR abs/1404.6245 (2014) - [i3]Akihisa Yamada, Keiichirou Kusakari, Toshiki Sakabe:
Nagoya Termination Tool. CoRR abs/1404.6626 (2014) - 2013
- [j13]Keiichirou Kusakari:
Static Dependency Pair Method in Rewriting Systems for Functional Programs with Product, Algebraic Data, and ML-Polymorphic Types. IEICE Trans. Inf. Syst. 96-D(3): 472-480 (2013) - [c2]Akihisa Yamada, Keiichirou Kusakari, Toshiki Sakabe:
Unifying the Knuth-Bendix, recursive path and polynomial orders. PPDP 2013: 181-192 - 2012
- [j12]Akihisa Yamada, Keiichirou Kusakari, Toshiki Sakabe, Masahiko Sakai, Naoki Nishida:
A Sound Type System for Typing Runtime Errors. Inf. Media Technol. 7(2): 667-675 (2012) - 2011
- [j11]Sho Suzuki, Keiichirou Kusakari, Frédéric Blanqui:
Argument Filterings and Usable Rules in Higher-order Rewrite Systems. Inf. Media Technol. 6(2): 481-492 (2011) - [j10]Yoshiharu Kojima, Masahiko Sakai, Naoki Nishida, Keiichirou Kusakari, Toshiki Sakabe:
Decidability of Reachability for Right-shallow Context-sensitive Term Rewriting Systems. Inf. Media Technol. 6(4): 1185-1208 (2011) - [i2]Sho Suzuki, Keiichirou Kusakari, Frédéric Blanqui:
Argument filterings and usable rules in higher-order rewrite systems. CoRR abs/1109.4357 (2011) - [i1]Keiichirou Kusakari, Yasuo Isogai, Masahiko Sakai, Frédéric Blanqui:
Static Dependency Pair Method based on Strong Computability for Higher-Order Rewrite Systems. CoRR abs/1109.5468 (2011)
2000 – 2009
- 2009
- [j9]Keiichirou Kusakari, Masahiko Sakai:
Static Dependency Pair Method for Simply-Typed Term Rewriting and Related Techniques. IEICE Trans. Inf. Syst. 92-D(2): 235-247 (2009) - [j8]Keiichirou Kusakari, Yasuo Isogai, Masahiko Sakai, Frédéric Blanqui:
Static Dependency Pair Method Based on Strong Computability for Higher-Order Rewrite Systems. IEICE Trans. Inf. Syst. 92-D(10): 2007-2015 (2009) - [j7]Yoshiharu Kojima, Masahiko Sakai, Naoki Nishida, Keiichirou Kusakari, Toshiki Sakabe:
Context-sensitive Innermost Reachability is Decidable for Linear Right-shallow Term Rewriting Systems. Inf. Media Technol. 4(4): 802-814 (2009) - 2007
- [j6]Keiichirou Kusakari, Masahiko Sakai:
Enhancing dependency pair method using strong computability in simply-typed term rewriting. Appl. Algebra Eng. Commun. Comput. 18(5): 407-431 (2007) - [j5]Keiichirou Kusakari, Yuki Chiba:
A Higher-Order Knuth-Bendix Procedure and Its Applications. IEICE Trans. Inf. Syst. 90-D(4): 707-715 (2007) - 2006
- [j4]Keiichirou Kusakari, Masaki Nakamura, Yoshihito Toyama:
Elimination Transformations for Associative-Commutative Rewriting Systems. J. Autom. Reason. 37(3): 205-229 (2006) - 2005
- [j3]Masahiko Sakai, Keiichirou Kusakari:
On Dependency Pair Method for Proving Termination of Higher-Order Rewrite Systems. IEICE Trans. Inf. Syst. 88-D(3): 583-593 (2005) - [j2]Keiichirou Kusakari, Masahiko Sakai, Toshiki Sakabe:
Primitive Inductive Theorems Bridge Implicit Induction Methods and Inductive Theorems in Higher-Order Rewriting. IEICE Trans. Inf. Syst. 88-D(12): 2715-2726 (2005) - 2004
- [j1]Keiichirou Kusakari:
Higher-Order Path Orders Based on Computability. IEICE Trans. Inf. Syst. 87-D(2): 352-359 (2004)
1990 – 1999
- 1999
- [c1]Keiichirou Kusakari, Masaki Nakamura, Yoshihito Toyama:
Argument Filtering Transformation. PPDP 1999: 47-61
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-09 01:12 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:
