#### Filter Results:

#### Publication Year

2001

2016

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Koji Nakazawa, Makoto Tatsuta
- J. Symb. Log.
- 2003

Our paper [1] contains a serious error. Proposition 4.6 of [1] is actually false and hence our strong normalization proof does not work for the Curry-style λµ-calculus. However, our method still can show that (1) the correction of Proposition 5.4 of [2], and (2) the correction of the proof of strong normalization of Church-style λµ-calculus by… (More)

- Satoshi Ikeda, Koji Nakazawa
- Inf. Process. Lett.
- 2006

In this paper, we propose a new proof method for strong normal-ization of calculi with control operators, and, by this method, we prove strong normalization of the system λµ → ∧∨⊥ , which is introduced in [3] by de Groote and corresponds to the classical natural deduction with disjunctions and permutative conversions by the Curry-Howard isomorphism. For our… (More)

- Koji Nakazawa
- 2001

This paper proves the confluency and the strong normalizability of the call-by-value λµ-calculus with the domain-free style. The confluency of the system is proved by improving the parallel reduction method of Baba, Hirokawa and Fujita. The strong normalizability is proved by using the modified CPS-translation, which preserves the typability and the… (More)

This paper shows undecidability of type-checking and type-inference problems in domain-free typed lambda-calculi with existential types: a negation and conjunction fragment, and an implicational fragment. These are proved by reducing type-checking and type-inference problems of the domain-free polymorphic typed lambda-calculus to those of the lambda-calculi… (More)

- Koji Nakazawa
- TLCA
- 2007

This paper introduces a cut-elimination procedure of the in-tuitionistic sequent calculus and shows that it is isomorphic to the proof reduction of the intuitionistic natural deduction with general elimination and explicit substitution. It also proves strong normalization and Church-Rosser property of the cut-elimination procedure by projecting the sequent… (More)

- Koji Nakazawa, Makoto Tatsuta
- Ann. Pure Appl. Logic
- 2008

This paper proves strong normalization of classical natural deduction with disjunc-tion and permutative conversions, by using CPS-translation and augmentations. By them, this paper also proves strong normalization of classical natural deduction with general elimination rules for implication and conjunction, and their permuta-tive conversions. This paper… (More)

- Koji Nakazawa, Shin-ya Katsumata
- CL&C
- 2012

This paper proposes new mathematical models of the untyped Lambda-mu calculus. One is called the stream model, which is an extension of the lambda model, in which each term is interpreted as a function from streams to individual data. The other is called the stream combinatory algebra, which is an extension of the combinatory algebra, and it is proved that… (More)

- Koji Nakazawa, Tomoharu Nagai
- RTA-TLCA
- 2014

- Koji Nakazawa
- Theor. Comput. Sci.
- 2003

- Koji Nakazawa, Makoto Tatsuta
- CATS
- 2009

This paper proves undecidability of type checking and type inference problems in some variants of typed lambda calculi with polymorphic and existen-tial types. First, type inference in the domain-free polymorphic lambda calculus is proved to be unde-cidable, and then it is proved that type inference is undecidable in the negation, conjunction, and existence… (More)