DDFP语言的归约机实现技术

Reduction Machine Implementation Technique for DDFP Language

ＤＤＦＰ语言是一种基于表达式的泛函程序设计语言，这是一种具有归的语义的、引用透明的、能表达无限数据结构、高阶纯粹的函数式语言。它的实现是基于λ演算、ＳＬＩ演算、ＳＫＬ－Ｇ演算、ＬＮＦ演算及图归约技术。本文在［４］的基础上首先引出了ＬＮＦ演算，而后详细介绍了该语言的归约机实现技术，对结果作了讨论。

DDFP is a functional progarmming language based on expression. This is a higher order purely functional programming language with reduction semantics. It has the property of referential transparency and the property of expressing infinite data structure. Its implementation is based on A calculus, SKI calculus, SKI-G calculus, LNF calculus and graphic reduction techniqued. In this paper, we first derive LNF calculus from reference [4], and then introduce the reduction-machine implementation technique of this language, and discuss the result.