Call by name, assignment, and the lambda calculus

Martin Odersky, Dan Rabin, Paul Hudak
1993 Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '93  
We de ne an extension of the call-by-name lambda calculus with additional constructs and reduction rules that represent m utable variables and assignments. The extended calculus has neither a concept of an explicit store nor a concept of evaluation order nevertheless, we show that programs in the calculus can be implemented using a single-threaded store. We also show that the new calculus has the Church-Rosser property and that it is a conservative extension of classical lambda calculus with
more » ... pect to operational equivalence that is, all algebraic laws of the functional subset are preserved.
doi:10.1145/158511.158521 dblp:conf/popl/OderskyRH93 fatcat:gr5todqrznazppb3eneudz4d7i