Ken-etsu Fujita

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