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.