| |
| 2008 | ||
|---|---|---|
| 6 | EE | Koji Nakazawa, Makoto Tatsuta, Yukiyoshi Kameyama, Hiroshi Nakano: Undecidability of Type-Checking in Domain-Free Typed Lambda-Calculi with Existence. CSL 2008: 478-492 |
| 5 | EE | Koji Nakazawa, Makoto Tatsuta: Strong normalization of classical natural deduction with disjunctions. Ann. Pure Appl. Logic 153(1-3): 21-37 (2008) |
| 2007 | ||
| 4 | EE | Koji Nakazawa: An Isomorphism Between Cut-Elimination Procedure and Proof Reduction. TLCA 2007: 336-350 |
| 2006 | ||
| 3 | EE | Satoshi Ikeda, Koji Nakazawa: Strong normalization proofs by CPS-translations. Inf. Process. Lett. 99(4): 163-170 (2006) |
| 2003 | ||
| 2 | Koji Nakazawa, Makoto Tatsuta: Strong normalization proof with CPS-translation for second order classical natural deduction. J. Symb. Log. 68(3): 851-859 (2003) | |
| 1 | Koji Nakazawa: Confluency and strong normalizability of call-by-value lambda-µ-calculus. Theor. Comput. Sci. 290(1): 429-463 (2003) | |
| 1 | Satoshi Ikeda | [3] |
| 2 | Yukiyoshi Kameyama | [6] |
| 3 | Hiroshi Nakano | [6] |
| 4 | Makoto Tatsuta | [2] [5] [6] |