A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Call by name, assignment, and the lambda calculus
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
doi:10.1145/158511.158521
dblp:conf/popl/OderskyRH93
fatcat:gr5todqrznazppb3eneudz4d7i