Normal Proofs and Their Grammar

Masako Takahashi, Yohji Akama, Sachio Hirokawa

研究成果: Article査読

13 被引用数 (Scopus)

抄録

We present grammatical (or equational) descriptions of the set of normal inhabitants {M | Γ ⊢ M : A, M in β-normal form} of a given type A under a given basis Γ, both for the standard simple type system (in the partial discharge convention) and for the system in the total discharge convention (or the Prawitz-style natural deduction system). It is shown that in the latter system we can describe the set by a (finite) context-free grammar, but for the standard system this is not necessarily the case because we may need an infinite supply of fresh (bound) variables to describe the set. In both cases, however, our grammars reflect the structure of normal inhabitants in such a way that, when non-terminals are ignored, a derivation tree of the grammars yielding a λ-term M can be identified with Böhm tree of M. We give some applications of the grammatical descriptions. Among others, we give simple algorithms for the emptiness/finiteness problem of the set of normal inhabitants of a given type (both for the standard and non-standard systems).

本文言語English
ページ(範囲)144-153
ページ数10
ジャーナルInformation and Computation
125
2
DOI
出版ステータスPublished - 1996 3 15
外部発表はい

ASJC Scopus subject areas

  • 理論的コンピュータサイエンス
  • 情報システム
  • コンピュータ サイエンスの応用
  • 計算理論と計算数学

フィンガープリント

「Normal Proofs and Their Grammar」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル