D120.de/forum

So, am I right in saying that CP is all about the objects themselves and RP about the operations you can apply to them? Your descriptions of what conceptual proximity and representational proximity are seem about right, but the above statement is disputable. To my understanding, representational pr...

You should not rely on the total grades calculated by WebLab – neither do we.

What you should rather do is check if the points for the individual tasks are correct, that is the important information which will be used to determine your bonus.

The assignment can be seen as kind of a "bonus bonus" task. As you can see in WebLab, it only has a weight of 0.5, compared to the other assignments with a weight of 1.0. You should also note, that DSLs will not be covered in the exam. So as a personal suggestion: if you are in doubt if it is more w...

Please try to update SugarJ to the latest version and then check again. The current version is 1.0.0.201307181446, so the update is from today, 14:46 CEST. I use a fresh Eclipse SDK (Classic), v4.2.2, Build id: M20130204-1200 with only the above version of SugarJ as plugin and can not reproduce the ...

With memoization the cache is bound to the function. The other approach uses a cache for the thunk (expression closure). Imagine the following piece of code in FWAE: With('f, Fun('x, _), Add(App('f, 23), App('f, 23))) With memoization the result for f(23) is only computed once. The second call will ...

No, you are not allowed to bring a cheat sheet to the exam.

But I still recommend that you create one for your preparation.

Hi,

relevant contents for the exam are all lecture slides, group exercises and WebLab assignments up to and including lazy evaluation (slidesets V1-V9, exercises 1-12, assignments 1-12).

Good luck!

You should not try to reset your solution. As the deadline has been reached, it should not be possible to change your solution, anyway.

A call is a tail call, if it is in tail position of a function. So you have to look at the call in relation to a function. So in the given example, k(1) is a tail call in fibCPS and fibCPS(n - 1, …) is a tail call in fibCPS. But fibCPS(n - 2, …) is not a tail call in fibCPS, yet still a tail call in...

Hi Lamora, the code in question: import scala.util.continuations._ object Main extends App { def foo() = { 1 + shift{k: (Int=>Int) => k(k(k(7)))}} def bar() = {foo() * 2} def baz() = { reset{bar() + 10} } println(baz()) } You can get the result by compiling the code with the -P:continuations:enable ...

Just saving your solution is enough – there is no need to explicitly submit.

You can find the slides in the repository . The link has a typo in it (or the file is named wrong, however you want to see it). The assistant is not reachable until late this night and the discussion of the homework is scheduled for tomorrow in the exercise. I can extend the deadline until tomorrow ...

The reason behind the testcase is the behavior of the following Java code: class Foo { int x = 3; } class Bar extends Foo { int x = 7; public static void main(String[] args) { Bar bar = new Bar(); System.out.println("Bar: " + bar.x); System.out.println("Foo: " + ((Foo) bar).x); } } The output will b...

Hi Lamora, the receivers on slides 103 and 127 are augmented, because the function in tail call position interp is again called inside the receiver. On slide 35 the function in tail call position factCPS is not used inside the receiver, that is why it is not augmented. At least this is my understand...

The assignment is now online – please excuse the delay.