Uniform Memory and Serialization for Lambda Calculus

H. G. Rice. Recursive Real Numbers. Proceedings of the American Mathematical Society, 5(5): 784–791, October 1954

1954

Earlier work this paper cites.

R. Hindley. Axioms for strong reduction in combinatory logic. The Journal of Symbolic Logic, 32: 224–236, 1967

1967

Earlier work this paper cites.

C. P. Wadsworth. Semantics and Pragmatics of the Lambda Calculus, PhD thesis. Oxford University, 1971

1971

Earlier work this paper cites.

H. P. Barendregt. The Lambda Calculus, Its Syntax and Semantics. North-Holland, 1984

1984

Earlier work this paper cites.

G. Révész. Axioms for the theory of lambda-conversion. SIAM Journal on Computing, 14(2): 373–382, May 1985

1985

Earlier work this paper cites.

J. W. Klop. Term rewriting systems. Notes prepared for the seminar on Reduction Machines, organized by C. Böhm, Ustica, September 1985

1985

Earlier work this paper cites.

H. P. Barendregt, J. R. Kennaway, J. W. Klop, and M. R. Sleep. Needed reduction and spine strategies for the lambda calculus. Information and Computation, 75(3): 191–231, December 1987

1987

Cited alongside, same era.

A. J. Field, P. G. Harrison. Functional Programming. Addison-Wesley, 1988

1988

Cited alongside, same era.

T. Æ. Mogensen. Efficient self-interpretation in lambda calculus. Journal of Functional Programming, 3(2): 345–363, 1992

1992

Cited alongside, same era.

H. Abelson, G. J. Sussman, J. Sussman. Structure and interpretation of computer programs. 2nd ed. New York, NY: McGraw-Hill, Cambridge, MA: MIT Press, 1996

1996

Cited alongside, same era.

K. H. Rose. Explicit Substitution — Tutorial and Survey. BRICS LS-96-3, 1996

1996

Cited alongside, same era.

C. J. Bloo. Preservation of Termination for Explicit Substitution. PhD thesis, Technishche Universiteit Eindhoven, October 2, 1997

Original

1997

Later among the works it cites.

The IEEE and The Open Group. The Open Group Base Specifications Issue 6. IEEE Standard 1003.1, 2004

2004

Later among the works it cites.

W. Kluge. Abstract Computing Machines. Springer-Verlag, 2005

2005

Later among the works it cites.

J. R. Hindley, F. Cardone. History of λ \lambda -calculus and Combinatory Logic. Handbook of the History of Logic, 5: 723–817, Elsevier, 2009

2009

Later among the works it cites.

A. Salikhmetov. The Heap Lambda Machine. arXiv:0806.4631v2, 2010

Original

2010

Closest in time.