One-step recurrent terms in λ-β-calculus

Shoji Sekimoto, Sachio Hirokawa

研究成果: ジャーナルへの寄稿記事

1 引用 (Scopus)

抜粋

A necessary and sufficient condition for cycling reductions to be recurrent is given. A one-step recurrent term is a term in λ-β-calculus whose one-step reductums are all reducible to the term. It is a weakened notion of minimal form or recurrent term in the λ-β-calculus. In this note, a one-step recurrent term which is not recurrent is shown. That term becomes a counter- example for a conjecture presented by Klop. By analysis of the reduction cycles of one-step recurrent terms, a necessary and sufficient condition for a one-step recurrent term to be recurrent is given.

元の言語英語
ページ(範囲)223-231
ページ数9
ジャーナルTheoretical Computer Science
56
発行部数2
DOI
出版物ステータス出版済み - 2 1988
外部発表Yes

    フィンガープリント

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

これを引用