A sited lambda calculus
A sited lambda calculus. Ezra Cooper and Philip Wadler. Put in to ICFP 2008.
Several late language designs have proffered a merged language for programming a spread system; we visit these “location-mindful” languages. These languages allow constructs that give up the programmer to check the location (the choice of host, for example) where a piece of code should lean, which can be utile for security or performance reasons. On the other hand, a primal mantra of web engineering asserts that web servers should be “homeless”: that no “session state” should be maintained on behalf of single clients—that is, no state that pertains to the special point of the interaction at which a client program lodges in. Thusly far, most implementations of united location-cognizant languages have disregarded this precept, commonly holding a process for each client runing on the server, or differently puting in state information in memory. We render how to apply a location-mindful language on top of the homeless-server model.
This paper is expert, and I take over most LtU members will chiefly translated sections 1, 5 & 6. Figure 5 is definition of the placed LC.
Relating Posts:
Silverlight FlickR Example
