期刊文献+
共找到1篇文章
< 1 >
每页显示 20 50 100
Y_CΩ_(2n)are easy terms 被引量:2
1
作者 ZHAO Xishun 1 and WANG Ju 2 1. Department of Mathematics, Nanjing University, Nanjing 210093, China 2. Institute of Software, Chinese Academy of Sciences, Beijing 100080, China 《Chinese Science Bulletin》 SCIE CAS 1998年第20期1707-1709,共3页
For any natural number n≥1, Y CΩ 2n is an easy term; that is, for any λ term M, λβ+Y\-CΩ 2n =M is consistent, where Y C is Curry fixed point combinator, Ω 2n ≡ω 2n ω 2n and ω 2n ≡λx.xx...x (there are 2n o... For any natural number n≥1, Y CΩ 2n is an easy term; that is, for any λ term M, λβ+Y\-CΩ 2n =M is consistent, where Y C is Curry fixed point combinator, Ω 2n ≡ω 2n ω 2n and ω 2n ≡λx.xx...x (there are 2n occurrences of x after λx ). This result is a partial solution to Jacopini’s conjecture: Y CΩ n is an easy term for any natural number n≥2. 展开更多
关键词 λβ-calculus Kuper’s theorem easy term.
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部