Proving based on similarity. - Ken-etsu Fujita; Masateru Harao (ALT, 1991)

On the Adequacy of Representing Higher Order Intuitionistic Logic as a Pure Type System. - Hans Tonino; Ken-etsu Fujita (Ann. Pure Appl. Log., 1992)

Calculus of Classical Proofs I. - Ken-etsu Fujita (ASIAN, 1997)

Polymorphic Call-by-Value Calculus Based on Classical Proofs. - Ken-etsu Fujita (AISC, 1998)

On Proof Terms and Embeddings of Classical Substructural Logics. - Ken-etsu Fujita (Stud Logica, 1998)

Explicitly Typed lambda µ-Calculus for Polymorphism an Call-by-Value. - Ken-etsu Fujita (TLCA, 1999)

A Binary-Conclusion Natural Deduction System. - Ken-etsu Fujita (Log. J. IGPL, 1999)

Partially Typed Terms between Church-Style and Curry-Style. - Ken-etsu Fujita; Aleksy Schubert (IFIP TCS, 2000)

Domain-free [lambda][mu]-calculus. - Ken-etsu Fujita (RAIRO Theor. Informatics Appl., 2000)

Multiple-conclusion system as communication calculus. - Ken-etsu Fujita (CATS, 2000)

Parallel Reduction in Type Free lambda/mu-Calculus. - Kensuke Baba; Sachio Hirokawa; Ken-etsu Fujita (CATS, 2001)

An interpretation of [lambda][mu]-calculus in [lambda]-calculus. - Ken-etsu Fujita (Inf. Process. Lett., 2002)

A Sound and Complete CPS-Translation for lambda-mu-Calculus. - Ken-etsu Fujita (TLCA, 2003)

Galois Embedding from Polymorphic Types into Existential Types. - Ken-etsu Fujita (TLCA, 2005)

Existential Type Systems with No Types in Terms. - Ken-etsu Fujita; Aleksy Schubert (TLCA, 2009)

The Undecidability of Type Related Problems in Type-free Style System F. - Ken-etsu Fujita; Aleksy Schubert (RTA, 2010)

Inhabitation of polymorphic and existential types. - Makoto Tatsuta; Ken-etsu Fujita; Ryu Hasegawa; Hiroshi Nakano (Ann. Pure Appl. Log., 2010)

CPS-translation as adjoint. - Ken-etsu Fujita (Theor. Comput. Sci., 2010)

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)

Decidable structures between Church-style and Curry-style. - Ken-etsu Fujita; Aleksy Schubert (RTA, 2013)

A note on subject reduction in (→, ∃)-Curry with respect to complete developments. - Aleksy Schubert; Ken-etsu Fujita (Inf. Process. Lett., 2014)

Existential type systems between Church and Curry style (type-free style). - Ken-etsu Fujita; Aleksy Schubert (Theor. Comput. Sci., 2014)

Reduction Rules for Intuitionistic λρ-calculus. - Ken-etsu Fujita; Ryo Kashima; Yuichi Komori; Naosuke Matsuda (Stud Logica, 2015)

On Upper Bounds on the Church-Rosser Theorem. - Ken-etsu Fujita (WPTE@FSCD, 2016)

Compositional Z: Confluence Proofs for Permutative Conversion. - Koji Nakazawa; Ken-etsu Fujita (Stud Logica, 2016)

The Church-Rosser theorem and quantitative analysis of witnesses. - Ken-etsu Fujita (Inf. Comput., 2018)

Neighbourhood and Lattice Models of Second-Order Intuitionistic Propositional Logic. - Toshihiko Kurata; Ken-etsu Fujita (Fundam. Informaticae, 2019)

A formal system of reduction paths for parallel reduction. - Ken-etsu Fujita (Theor. Comput. Sci., 2020)

Confluence Proofs of Lambda-Mu-Calculi by Z Theorem. - Yuki Honda; Koji Nakazawa; Ken-etsu Fujita (Stud Logica, 2021)

Z property for the shuffling calculus. - Koji Nakazawa; Ken-etsu Fujita; Yuta Imagawa (Math. Struct. Comput. Sci., 2022)

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, 2024)