#### Filter Results:

- Full text PDF available (16)

#### Publication Year

2001

2016

- This year (0)
- Last 5 years (8)
- Last 10 years (17)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### 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 normalization 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, Makoto Tatsuta
- Ann. Pure Appl. Logic
- 2008

This paper proves strong normalization of classical natural deduction with disjunction 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 permutative conversions. This paper also… (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)

This paper shows undecidability of type-checking and typeinference 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
- 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)

- Koji Nakazawa
- TLCA
- 2007

This paper introduces a cut-elimination procedure of the intuitionistic 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, Tomoharu Nagai
- RTA-TLCA
- 2014

- Takeshi Hirano, Haruki Morii, +6 authors Yoshiki Tokura
- Cancer letters
- 2008

White adipose tissue is a multifunctional endocrine organ that synthesizes and secretes cytokine-like proteins termed adipokines. In the present study, the effects of cancer-derived medium on adipogenesis were examined. We prepared conditioned media from cancer cell lines, and cultured preadipocytes in the conditioned media. After 10 days of culture,… (More)

- José Espírito Santo, Ralph Matthes, Koji Nakazawa, Luis Pinto
- Mathematical Structures in Computer Science
- 2013

We study monadic translations of the call-by-name (cbn) and the call-by-value (cbv) fragments of the classical sequent calculus λμμ̃ by Curien and Herbelin and give modular and syntactic proofs of strong normalization. The target of the translations is a new meta-language for classical logic, named monadic λμ. It is a monadic reworking of Parigot’s… (More)