### 抜粋

BCK-λ-terms are the λ-terms in which each variable occurs at most once. The principal type of a λ-term is the most general type of the term. In this paper we prove that if two BCK-λ-terms in β-normal form have the same principal type then they are identical. This solves the following problem (Y. Komori, 1987) in more general form: if two closed βη-normal form BCK-λ-terms are assigned to the same minimal BCK-formula, are they identical? A minimal BCK-formula is the most general formula among BCK-provable formulas with respect to substitutions for type variables. To analyze type assignment, the notion of "connection" is introduced. A connection is a series of occurrences of a type in a type assignment figure. Connected occurrences of a type have the same meaning. The occurrences of the type in distinct connection classes can be rewritten separately; as a result, we have more general type assignment. By "formulae-as-types" correspondence, the result implies the uniqueness of the normal proof figure for principal BCK-formulas. The result is valid for BCI-logic or implicational fragment of linear logic as well.

元の言語 | 英語 |
---|---|

ページ（範囲） | 253-276 |

ページ数 | 24 |

ジャーナル | Theoretical Computer Science |

巻 | 107 |

発行部数 | 2 |

DOI | |

出版物ステータス | 出版済み - 1 18 1993 |

### All Science Journal Classification (ASJC) codes

- Theoretical Computer Science
- Computer Science(all)

## フィンガープリント Principal types of BCK-lambda-terms' の研究トピックを掘り下げます。これらはともに一意のフィンガープリントを構成します。

## これを引用

*Theoretical Computer Science*,

*107*(2), 253-276. https://doi.org/10.1016/0304-3975(93)90171-O