Ken-etsu Fujita

According to our database, Ken-etsu Fujita authored at least 31 papers between 1991 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2024

The existential fragment of second-order propositional intuitionistic logic is undecidable.

Ken-etsu Fujita, Aleksy Schubert, Pawel Urzyczyn, Konrad Zdanowski

J. Appl. Non Class. Logics, January, 2024

2022

Z property for the shuffling calculus.

Koji Nakazawa, Ken-etsu Fujita, Yuta Imagawa

Math. Struct. Comput. Sci., August, 2022

2021

Confluence Proofs of Lambda-Mu-Calculi by Z Theorem.

Yuki Honda, Koji Nakazawa, Ken-etsu Fujita

Stud Logica, 2021

2020

A formal system of reduction paths for parallel reduction.

Ken-etsu Fujita

Theor. Comput. Sci., 2020

2019

Neighbourhood and Lattice Models of Second-Order Intuitionistic Propositional Logic.

Toshihiko Kurata, Ken-etsu Fujita

Fundam. Informaticae, 2019

2018

The Church-Rosser theorem and quantitative analysis of witnesses.

Ken-etsu Fujita

Inf. Comput., 2018

2016

Compositional Z: Confluence Proofs for Permutative Conversion.

Koji Nakazawa, Ken-etsu Fujita

Stud Logica, 2016

On Upper Bounds on the Church-Rosser Theorem.

Ken-etsu Fujita

Proceedings of the Proceedings Third International Workshop on Rewriting Techniques for Program Transformations and Evaluation, 2016

2015

Reduction Rules for Intuitionistic λρ-calculus.

Ken-etsu Fujita, Ryo Kashima, Yuichi Komori, Naosuke Matsuda

Stud Logica, 2015

2014

Existential type systems between Church and Curry style (type-free style).

Ken-etsu Fujita, Aleksy Schubert

Theor. Comput. Sci., 2014

A note on subject reduction in (→, ∃)-Curry with respect to complete developments.

Aleksy Schubert, Ken-etsu Fujita

Inf. Process. Lett., 2014

2013

Decidable structures between Church-style and Curry-style.

Ken-etsu Fujita, Aleksy Schubert

Proceedings of the 24th International Conference on Rewriting Techniques and Applications, 2013

2012

The undecidability of type related problems in the type-free style System F with finitely stratified polymorphic types.

Ken-etsu Fujita, Aleksy Schubert

Inf. Comput., 2012

2010

CPS-translation as adjoint.

Ken-etsu Fujita

Theor. Comput. Sci., 2010

Inhabitation of polymorphic and existential types.

Makoto Tatsuta, Ken-etsu Fujita, Ryu Hasegawa, Hiroshi Nakano

Ann. Pure Appl. Log., 2010

The Undecidability of Type Related Problems in Type-free Style System F.

Ken-etsu Fujita, Aleksy Schubert

Proceedings of the 21st International Conference on Rewriting Techniques and Applications, 2010

2009

Existential Type Systems with No Types in Terms.

Ken-etsu Fujita, Aleksy Schubert

Proceedings of the Typed Lambda Calculi and Applications, 9th International Conference, 2009

2005

Galois Embedding from Polymorphic Types into Existential Types.

Ken-etsu Fujita

Proceedings of the Typed Lambda Calculi and Applications, 7th International Conference, 2005

2003

A Sound and Complete CPS-Translation for lambda-mu-Calculus.

Ken-etsu Fujita

Proceedings of the Typed Lambda Calculi and Applications, 6th International Conference, 2003

2002

An interpretation of [lambda][mu]-calculus in [lambda]-calculus.

Ken-etsu Fujita

Inf. Process. Lett., 2002

2001

Parallel Reduction in Type Free lambda/mu-Calculus.

Kensuke Baba, Sachio Hirokawa, Ken-etsu Fujita

Proceedings of the Computing: The Australasian Theory Symposium, 2001

2000

Multiple-conclusion system as communication calculus.

Ken-etsu Fujita

Proceedings of the Computing: the Australasian Theory Symposium, 2000

Domain-free [lambda][mu]-calculus.

Ken-etsu Fujita

RAIRO Theor. Informatics Appl., 2000

Partially Typed Terms between Church-Style and Curry-Style.

Ken-etsu Fujita, Aleksy Schubert

Proceedings of the Theoretical Computer Science, 2000

1999

A Binary-Conclusion Natural Deduction System.

Ken-etsu Fujita

Log. J. IGPL, 1999

Explicitly Typed <i>lambda µ</i>-Calculus for Polymorphism an Call-by-Value.

Ken-etsu Fujita

Proceedings of the Typed Lambda Calculi and Applications, 4th International Conference, 1999

1998

On Proof Terms and Embeddings of Classical Substructural Logics.

Ken-etsu Fujita

Stud Logica, 1998

Polymorphic Call-by-Value Calculus Based on Classical Proofs.

Ken-etsu Fujita

Proceedings of the Artificial Intelligence and Symbolic Computation, 1998

1997

Calculus of Classical Proofs I.

Ken-etsu Fujita

Proceedings of the Advances in Computing Science, 1997

1992

On the Adequacy of Representing Higher Order Intuitionistic Logic as a Pure Type System.

Hans Tonino, Ken-etsu Fujita

Ann. Pure Appl. Log., 1992

1991

Proving based on similarity.

Ken-etsu Fujita, Masateru Harao

Proceedings of the Algorithmic Learning Theory, 2nd International Workshop, 1991