论文信息 - An abstract machine for Lambda-terms normalization

An abstract machine for Lambda-terms normalization

Two abstract machines reducing terms to their full 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 λ&sgr;-calculus [Cur89].

Pierre Crégut | P. Crégut

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

[2] Jon Fairbairn,et al. TIM: A simple, lazy abstract machine to execute supercombinatorics , 1987, FPCA.

[3] Jan A. Bergstra,et al. Degrees, reductions and representability in the lambda calculus , 1976 .

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

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

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

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

[8] Martín Abadi,et al. Explicit substitutions , 1989, POPL '90.

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

[10] Simon Peyton Jones,et al. The Implementation of Functional Programming Languages (Prentice-hall International Series in Computer Science) , 1987 .

[11] Pierre-Louis Curien,et al. Combinateures, Catégoriques et Implémentation des Languages Fonctionnels , 1985, Combinators and Functional Programming Languages.