摘要
已提出的图归约机的基础是Currg 的合成逻辑(简称C 逻辑),但是在图归约机中用C 逻辑中的组合子定义作为归约规则似乎过于烦琐。我们提出的CD-FFP2(FFP 的方言)的抽象并行图归约机——FC 机,它的基础是FFP 高级合成逻辑。用FFP 高级合成逻辑中的组合子定义作为并行图归约机的归约规则有许多突出的优点。这为具体实现FFP 语言的体系结构奠定了基础。
The basis of the proposed graph reduction machine is Curry's combinatory logic.However using the definition of combinators in combinatory logic as reduction rules seems toosimple We propose an abstract parallel graph reduction machine for CD-FFP2(a dialect of FFP)Its basis is FFP high-level combinatory logic.It has many advantages to use the definition ofcombinators in FFP high-level combinatory logic as reduction rules.It lays a good foundationfor implementing architecture of FFP language.
出处
《计算机研究与发展》
EI
CSCD
北大核心
1991年第5期13-18,共6页
Journal of Computer Research and Development
基金
国家"863"计划资助课题
