PLT11 course -- assignment 2

(C) Ralf Lämmel, Andrei Varanovich, University of Koblenz Landau

Logistics

• Course site
• Date published: 16 Nov 2011
• Deadline SVN: 22 Nov 2011 (End of Day)
• SVN: https://svn.uni-koblenz.de/softlang/main/courses/plt1112/students + group name
• Present your solution with your own system.
• Lab assistant calls up teams.

Assignment

Extend the (untyped and applied) lambda calculus, in its Prolog incarnation, by the following language constructs:

• new: when being evaluated, it returns a new location of a store.
• assign(L,V): the value V is assigned to the location L.
• deref(L): the location is dereferenced, i.e., the stored value, if any, is looked up.

Obviously, you can start off with the Prolog code from the lecture.

https://slps.svn.sourceforge.net/svnroot/slps/topics/semantics/lambda/applied/

General comments and hints:

• Don't care about the concrete syntax used above for illustration.
• Provide test cases with your extended interpreter.