 | 2011 |
|---|
| 10 |       | Koji Nakazawa,
Makoto Tatsuta,
Yukiyoshi Kameyama,
Hiroshi Nakano:
Type checking and typability in domain-free lambda calculi.
Theor. Comput. Sci. 412(44): 6193-6207 (2011) |
| 2010 |
|---|
| 9 | | Koji Nakazawa,
Makoto Tatsuta:
Type Checking and Inference for Polymorphic and Existential Types in Multiple-Quantifier and Type-Free Systems.
Chicago J. Theor. Comput. Sci. 2010: (2010) |
| 2009 |
|---|
| 8 | | Yuki Kato,
Koji Nakazawa:
Type Checking and Inference Are Equivalent in Lambda Calculi with Existential Types.
WFLP 2009: 96-110 |
| 2008 |
|---|
| 7 | | Koji Nakazawa,
Makoto Tatsuta,
Yukiyoshi Kameyama,
Hiroshi Nakano:
Undecidability of Type-Checking in Domain-Free Typed Lambda-Calculi with Existence.
CSL 2008: 478-492 |
| 6 | | Koji Nakazawa,
Makoto Tatsuta:
Strong normalization of classical natural deduction with disjunctions.
Ann. Pure Appl. Logic 153(1-3): 21-37 (2008) |
| 2007 |
|---|
| 5 | | Koji Nakazawa:
An Isomorphism Between Cut-Elimination Procedure and Proof Reduction.
TLCA 2007: 336-350 |
| 2006 |
|---|
| 4 | | Satoshi Ikeda,
Koji Nakazawa:
Strong normalization proofs by CPS-translations.
Inf. Process. Lett. 99(4): 163-170 (2006) |
| 2003 |
|---|
| 3 |  | Koji Nakazawa,
Makoto Tatsuta:
Strong normalization proof with CPS-translation for second order classical natural deduction.
J. Symb. Log. 68(3): 851-859 (2003) |
| 2 | | Koji Nakazawa,
Makoto Tatsuta:
Corrigendum to "Strong normalization proof with CPS-translation for second order classical natural deduction".
J. Symb. Log. 68(4): 1415-1416 (2003) |
| 1 | | Koji Nakazawa:
Confluency and strong normalizability of call-by-value lambda-µ-calculus.
Theor. Comput. Sci. 290(1): 429-463 (2003) |
Data released under the ODC-BY 1.0 license — See also our legal information page