Kentaro Kikuchi

According to our database1, Kentaro Kikuchi authored at least 20 papers between 2000 and 2017.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2017
Parallel Closure Theorem for Left-Linear Nominal Rewriting Systems.
Proceedings of the Frontiers of Combining Systems - 11th International Symposium, 2017

2016
Critical Pair Analysis in Nominal Rewriting.
Proceedings of the 7th International Symposium on Symbolic Computation in Software Science, 2016

Nominal Confluence Tool.
Proceedings of the Automated Reasoning - 8th International Joint Conference, 2016

2015
Confluence of Orthogonal Nominal Rewriting Systems Revisited.
Proceedings of the 26th International Conference on Rewriting Techniques and Applications, 2015

Correctness of Context-Moving Transformations for Term Rewriting Systems.
Proceedings of the Logic-Based Program Synthesis and Transformation, 2015

2014
Uniform Proofs of Normalisation and Approximation for Intersection Types.
Proceedings of the Proceedings Seventh Workshop on Intersection Types and Related Systems, 2014

A Translation of Intersection and Union Types for the λμ-Calculus.
Proceedings of the Programming Languages and Systems - 12th Asian Symposium, 2014

2013
Proving Strong Normalisation via Non-deterministic Translations into Klop's Extended lambda-Calculus.
Proceedings of the Computer Science Logic 2013 (CSL 2013), 2013

2008
Call-by-name reduction and cut-elimination in classical logic.
Ann. Pure Appl. Logic, 2008

Strong Normalisation of Cut-Elimination That Simulates beta-Reduction.
Proceedings of the Foundations of Software Science and Computational Structures, 2008

2007
A Tree-Sequent Calculus for a Natural Predicate Extension of Visser's Propositional Logic.
Logic Journal of the IGPL, 2007

Tree-Sequent Methods for Subintuitionistic Predicate Logics.
Proceedings of the Automated Reasoning with Analytic Tableaux and Related Methods, 2007

Simple Proofs of Characterizing Strong Normalization for Explicit Substitution Calculi.
Proceedings of the Term Rewriting and Applications, 18th International Conference, 2007

Confluence of Cut-Elimination Procedures for the Intuitionistic Sequent Calculus.
Proceedings of the Computation and Logic in the Real World, 2007

2006
On a Local-Step Cut-Elimination Procedure for the Intuitionistic Sequent Calculus.
Proceedings of the Logic for Programming, 2006

2004
A Direct Proof of Strong Normalization for an Extended Herbelin?s Calculus.
Proceedings of the Functional and Logic Programming, 7th International Symposium, 2004

2003
A Cut-Free Gentzen Formulation of Basic Propositional Calculus.
Journal of Logic, Language and Information, 2003

2002
Dual-Context Sequent Calculus and Strict Implication.
Math. Log. Q., 2002

2001
Sequent Calculi for Visser's Propositional Logics.
Notre Dame Journal of Formal Logic, 2001

2000
Chained Declustering using Multiple Conventional Filesystems.
Proceedings of the 2000 IEEE International Conference on Cluster Computing (CLUSTER 2000), November 28th, 2000


  Loading...