论文信息 - Demonstrating Lambda Calculus Reduction

Demonstrating Lambda Calculus Reduction

Abstract We describe lambda calculus reduction strategies using big-step operational semantics and show how to efficiently trace such reductions. This is used in a web-based lambda calculus reducer, at http://www.dina.kvl.dk/~sestoft/lamreduce/ .

Peter Sestoft

[1] Gilles Kahn,et al. Natural Semantics , 1987, STACS.

[2] Matthias Felleisen,et al. The call-by-need lambda calculus , 1997, Journal of Functional Programming.

[3] Alonzo Church,et al. A note on the Entscheidungsproblem , 1936, Journal of Symbolic Logic.

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

[5] Hendrik Pieter Barendregt,et al. Needed Reduction and Spine Strategies for the Lambda Calculus , 1987, Inf. Comput..

[6] Lennart Augustsson,et al. A compiler for lazy ML , 1984, LFP '84.

[7] Lawrence Charles Paulson,et al. ML for the working programmer , 1991 .

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

[9] P. J. Landin,et al. The next 700 programming languages , 1966, CACM.

[10] Peter Sestoft,et al. Deriving a lazy abstract machine , 1997, Journal of Functional Programming.

[11] Henk Barendregt,et al. The Lambda Calculus: Its Syntax and Semantics , 1985 .

[12] John Launchbury,et al. A natural semantics for lazy evaluation , 1993, POPL '93.

[13] Larry C. Paulson. ML for the Working Programmer: Preface , 1996 .

[14] Robert Hieb,et al. The Revised Report on the Syntactic Theories of Sequential Control and State , 1992, Theor. Comput. Sci..

[15] P. J. Landin. The Mechanical Evaluation of Expressions , 1964, Comput. J..

[16] D. A. Turner,et al. A new implementation technique for applicative languages , 1979, Softw. Pract. Exp..