( en | de | ru )

 

Disambiguation of "Kikuchi, Kentaro"

Author of the publication

copydeleteadd this publication to your clipboard
Polymorphic computation systems: Theory and practice of confluence with call-by-value.

, , and . Sci. Comput. Program., (2020)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Kentaro Harada

Kentaro Kusumi

Tomoo Kikuchi

Kentaro Azuma

Kentaro Suetsugu

 

Other publications of authors with the same name

Confluence of Cut-Elimination Procedures for the Intuitionistic Sequent Calculus.. CiE, volume 4497 of Lecture Notes in Computer Science, page 398-407. Springer, (2007)Money flow network among firms' accounts in a regional bank of Japan., , , , , and . EPJ Data Sci., 10 (1): 19 (2021)A Tree-Sequent Calculus for a Natural Predicate Extension of Visser's Propositional Logic., and . Logic Journal of the IGPL, 15 (2): 149-164 (2007)A Cut-Free Gentzen Formulation of Basic Propositional Calculus., and . J. Log. Lang. Inf., 12 (2): 213-225 (2003)Simple Derivation Systems for Proving Sufficient Completeness of Non-Terminating Term Rewriting Systems., and . FSTTCS, volume 213 of LIPIcs, page 49:1-49:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Parallel Closure Theorem for Left-Linear Nominal Rewriting Systems., , and . FroCoS, volume 10483 of Lecture Notes in Computer Science, page 115-131. Springer, (2017)Critical Pair Analysis in Nominal Rewriting., , , and . SCSS, volume 39 of EPiC Series in Computing, page 156-168. EasyChair, (2016)Tree-Sequent Methods for Subintuitionistic Predicate Logics., and . TABLEAUX, volume 4548 of Lecture Notes in Computer Science, page 149-164. Springer, (2007)A Translation of Intersection and Union Types for the λμ-Calculus., and . APLAS, volume 8858 of Lecture Notes in Computer Science, page 120-139. Springer, (2014)A Proof Method for Local Sufficient Completeness of Term Rewriting Systems., , and . ICTAC, volume 12819 of Lecture Notes in Computer Science, page 386-404. Springer, (2021)