 | 2009 |
| 14 |  | Ken-etsu Fujita,
Aleksy Schubert:
Existential Type Systems with No Types in Terms.
TLCA 2009: 112-126 |
| 2005 |
| 13 |  | Ken-etsu Fujita:
Galois Embedding from Polymorphic Types into Existential Types.
TLCA 2005: 194-208 |
| 2003 |
| 12 |  | Ken-etsu Fujita:
A Sound and Complete CPS-Translation for lambda-mu-Calculus.
TLCA 2003: 120-134 |
| 2002 |
| 11 |  | Ken-etsu Fujita:
An interpretation of [lambda][mu]-calculus in [lambda]-calculus.
Inf. Process. Lett. 84(5): 261-264 (2002) |
| 2001 |
| 10 |  | Kensuke Baba,
Sachio Hirokawa,
Ken-etsu Fujita:
Parallel Reduction in Type Free lambda/mu-Calculus.
Electr. Notes Theor. Comput. Sci. 42: (2001) |
| 2000 |
| 9 |  | Ken-etsu Fujita,
Aleksy Schubert:
Partially Typed Terms between Church-Style and Curry-Style.
IFIP TCS 2000: 505-520 |
| 8 |  | Ken-etsu Fujita:
Multiple-conclusion system as communication calculus.
Electr. Notes Theor. Comput. Sci. 31: (2000) |
| 7 |  | Ken-etsu Fujita:
Domain-free [lambda][mu]-calculus.
ITA 34(6): 433-466 (2000) |
| 1999 |
| 6 |  | Ken-etsu Fujita:
Explicitly Typed lambda µ-Calculus for Polymorphism an Call-by-Value.
TLCA 1999: 162-176 |
| 5 |  | Ken-etsu Fujita:
A Binary-Conclusion Natural Deduction System.
Logic Journal of the IGPL 7(4): 517-545 (1999) |
| 1998 |
| 4 |  | Ken-etsu Fujita:
Polymorphic Call-by-Value Calculus Based on Classical Proofs.
AISC 1998: 170-182 |
| 3 |  | Ken-etsu Fujita:
On Proof Terms and Embeddings of Classical Substructural Logics.
Studia Logica 61(2): 199-221 (1998) |
| 1997 |
| 2 |  | Ken-etsu Fujita:
Calculus of Classical Proofs I.
ASIAN 1997: 321-335 |
| 1992 |
| 1 |  | Hans Tonino,
Ken-etsu Fujita:
On the Adequacy of Representing Higher Order Intuitionistic Logic as a Pure Type System.
Ann. Pure Appl. Logic 57(3): 251-276 (1992) |