On mints’ reduction for ccc-calculus

研究成果: Conference contribution

32 被引用数 (Scopus)

抄録

In this paper, we present a divide-and-conquer lemma to infer the SN+CR (Strongly Normalization and Church-Rosser) property of a reduction system from that property of its subsystems. Then we apply the lemma to show the property of Mints’ reduction for ccc-calculus with restricted ν-expansion and restricted π-expansion. In the course of the proof, we obtain some relations of the two restricted expansions against traditional reductions. Among others, we get a simple characterization of the restricted ν-expansion in terms of traditional β-and ν-reductions, and a similar characterization for the restricted π-expansion.

本文言語English
ホスト出版物のタイトルTyped Lambda Calculi and Applications - International Conference on Typed Lamda Calculi and Applications, TLCA 1993, Proceedings
編集者Marc Bezem, Jan Friso Groote
出版社Springer Verlag
ページ1-12
ページ数12
ISBN(印刷版)9783540565178
DOI
出版ステータスPublished - 1993
外部発表はい
イベント1st International Conference on Typed Lamda Calculi and Applications, TLCA 1993 - Utrecht, Netherlands
継続期間: 1993 3 161993 3 18

出版物シリーズ

名前Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
664 LNCS
ISSN(印刷版)0302-9743
ISSN(電子版)1611-3349

Other

Other1st International Conference on Typed Lamda Calculi and Applications, TLCA 1993
CountryNetherlands
CityUtrecht
Period93/3/1693/3/18

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

フィンガープリント 「On mints’ reduction for ccc-calculus」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル