Ken-etsu Fujita

Publication Activity (10 Years)

Years Active: 1991-2024
Publications (10 Years): 9

Top Topics

Propositional Logic

Top Venues

Theor. Comput. Sci.

Fundam. Informaticae

Math. Struct. Comput. Sci.

Publications

Ken-etsu Fujita, Aleksy Schubert, Pawel Urzyczyn, Konrad Zdanowski
The existential fragment of second-order propositional intuitionistic logic is undecidable. J. Appl. Non Class. Logics 34 (1) (2024)
Koji Nakazawa, Ken-etsu Fujita, Yuta Imagawa
Z property for the shuffling calculus. Math. Struct. Comput. Sci. 32 (7) (2022)
Yuki Honda, Koji Nakazawa, Ken-etsu Fujita
Confluence Proofs of Lambda-Mu-Calculi by Z Theorem. Stud Logica 109 (5) (2021)
Ken-etsu Fujita
A formal system of reduction paths for parallel reduction. Theor. Comput. Sci. 813 (2020)
Toshihiko Kurata, Ken-etsu Fujita
Neighbourhood and Lattice Models of Second-Order Intuitionistic Propositional Logic. Fundam. Informaticae 170 (1-3) (2019)
Ken-etsu Fujita
The Church-Rosser theorem and quantitative analysis of witnesses. Inf. Comput. 263 (2018)
Koji Nakazawa, Ken-etsu Fujita
Compositional Z: Confluence Proofs for Permutative Conversion. Stud Logica 104 (6) (2016)
Ken-etsu Fujita
On Upper Bounds on the Church-Rosser Theorem. WPTE@FSCD (2016)
Ken-etsu Fujita, Ryo Kashima, Yuichi Komori, Naosuke Matsuda
Reduction Rules for Intuitionistic λρ-calculus. Stud Logica 103 (6) (2015)
Ken-etsu Fujita, Aleksy Schubert
Existential type systems between Church and Curry style (type-free style). Theor. Comput. Sci. 549 (2014)
Aleksy Schubert, Ken-etsu Fujita
A note on subject reduction in (→, ∃)-Curry with respect to complete developments. Inf. Process. Lett. 114 (1-2) (2014)
Ken-etsu Fujita, Aleksy Schubert
Decidable structures between Church-style and Curry-style. RTA (2013)
Ken-etsu Fujita, Aleksy Schubert
The undecidability of type related problems in the type-free style System F with finitely stratified polymorphic types. Inf. Comput. 218 (2012)
Ken-etsu Fujita, Aleksy Schubert
The Undecidability of Type Related Problems in Type-free Style System F. RTA (2010)
Makoto Tatsuta, Ken-etsu Fujita, Ryu Hasegawa, Hiroshi Nakano
Inhabitation of polymorphic and existential types. Ann. Pure Appl. Log. 161 (11) (2010)
Ken-etsu Fujita
CPS-translation as adjoint. Theor. Comput. Sci. 411 (2) (2010)
Ken-etsu Fujita, Aleksy Schubert
Existential Type Systems with No Types in Terms. TLCA (2009)
Ken-etsu Fujita
Galois Embedding from Polymorphic Types into Existential Types. TLCA (2005)
Ken-etsu Fujita
A Sound and Complete CPS-Translation for lambda-mu-Calculus. TLCA (2003)
Ken-etsu Fujita
An interpretation of [lambda][mu]-calculus in [lambda]-calculus. Inf. Process. Lett. 84 (5) (2002)
Kensuke Baba, Sachio Hirokawa, Ken-etsu Fujita
Parallel Reduction in Type Free lambda/mu-Calculus. Electron. Notes Theor. Comput. Sci. 42 (2001)
Ken-etsu Fujita
Multiple-conclusion system as communication calculus. Electron. Notes Theor. Comput. Sci. 31 (2000)
Ken-etsu Fujita, Aleksy Schubert
Partially Typed Terms between Church-Style and Curry-Style. IFIP TCS (2000)
Ken-etsu Fujita
Domain-free [lambda][mu]-calculus. RAIRO Theor. Informatics Appl. 34 (6) (2000)
Ken-etsu Fujita
-Calculus for Polymorphism an Call-by-Value. TLCA (1999)
Ken-etsu Fujita
A Binary-Conclusion Natural Deduction System. Log. J. IGPL 7 (4) (1999)
Ken-etsu Fujita
On Proof Terms and Embeddings of Classical Substructural Logics. Stud Logica 61 (2) (1998)
Ken-etsu Fujita
Polymorphic Call-by-Value Calculus Based on Classical Proofs. AISC (1998)
Ken-etsu Fujita
Calculus of Classical Proofs I. ASIAN (1997)
Hans Tonino, Ken-etsu Fujita
On the Adequacy of Representing Higher Order Intuitionistic Logic as a Pure Type System. Ann. Pure Appl. Log. 57 (3) (1992)
Ken-etsu Fujita, Masateru Harao
Proving based on similarity. ALT (1991)