论文信息 - An abstract machine for the normalization of X-terms

An abstract machine for the normalization of X-terms

l for higher order logic programming [NW90]. Two abstract machines reducing terms to their fulI normal form are presented in this paper. They are based on Krivine’s abstract machine [Kri85] which uses an environment to store arguments of function calls. A proof of their correctness is then stated in the abstract framework of Xa-calculus [‘3x89].

P. CrCgut | P. CrCgut

[1] Simon L. Peyton Jones,et al. The Implementation of Functional Programming Languages , 1987 .

[2] Thérèse Hardin,et al. Proof of termination of the rewriting system subst on CCL , 1986, Theor. Comput. Sci..

[3] John Darlington,et al. A Transformation System for Developing Recursive Programs , 1977, J. ACM.

[4] Harold T. Hodes,et al. The | lambda-Calculus. , 1988 .

[5] Philip Wadler,et al. Deforestation: Transforming Programs to Eliminate Trees , 1990, Theor. Comput. Sci..

[6] Gopalan Nadathur,et al. A representation of Lambda terms suitable for operations on their intensions , 1990, LISP and Functional Programming.

[7] Guy Argo. Improving the three instruction machine , 1989, FPCA.