The correctness of a modified SECD machine

Authors:
Clement L. McGowan
Affiliations:
Division of Applied Mathematics, Brown University, Providence, Rhode Island
Venue:
STOC '70 Proceedings of the second annual ACM symposium on Theory of computing
Year:
1970

Citing 2
Cited 3

Correspondence between ALGOL 60 and Church's Lambda-notation: part I

Communications of the ACM
The Calculi of Lambda Conversion. (AM-6) (Annals of Mathematics Studies)

The Calculi of Lambda Conversion. (AM-6) (Annals of Mathematics Studies)

Block structure (Extended Abstract): Retention or deletion?

STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
The Contour Model Lambda Calculus Machine

Proceedings of ACM conference on Proving assertions about programs
The equivalence of models of tasking

Proceedings of ACM conference on Proving assertions about programs

Quantified Score

Hi-index	0.00

Visualization

Abstract

Landin's SECD Machine does not completely compute certain expressions of the &lgr;-calculus and so is modified by the addition of an output component and a unique name counter. This modified machine is proven to correctly implement the &lgr;-calculus.