D120.de/forum

Please contact us via mail.

Hi COPL students, we are happy to announce that we finished correcting and grading your exams. For everyone who participated in the exam, your personal grade should be visible in TuCaN since yesterday. Note that the grades already include your bonus from solving the assignments. The exam inspection ...

Hi COPL students, here is another announcement that targets the more IDE-focused ones among you, but should not come as a surprise for anybody: You should be able to read *and write* small amounts of Scala and Haskell code during the exam. Regarding the writing, I can tell you that the focus will ra...

Hi COPL students, in this thread, we will announce important information regarding the exam. First important piece of information is when, where, and how long. Just as marked in TuCaN, the exam takes place on *March 6, 13:00 - 15:00*, in S206/030. However, note that this slot is deliberately longer ...

Yes, we looked into that, but we can not easily provide a second instance due to some technical issues.
Sorry.

What exactly are you referring to? The link you posted seems to be about higher-order procedures in Scheme. The specific text section you are referring to seems to be about constructing and using first-class functions in Scheme. Hence, it does not seem directly related to the lambda calculus (althou...

Good point - the additional 2 assignments suggested by the number "14" appeared due to old and test assignments in the background. I now adjusted the overall weights so that it is, hopefully, more logical for you (but note that the overall grade/statistics update might take a while). No, there will ...

.... I knew somebody would find and post it :lol: ...It is very funny, but if you want to first seriously learn about the lambda calculus, I would not start there. Another basic notion closely related to lambda calculus is the "Curry-Howard isomorphism" - you may have heard about that and think that...

Since so many of you said they did not know about the lambda calculus, I will start this thread now for collecting some good introductory material about the lambda calculus. In my opinion, the clearest, easiest to read introduction to the lambda calculus is in the book I brought to the type systems ...

We extended the deadline a little bit (Friday, 20:00). Hope that helps.

I confirm that Weblab seems to have been down for ~15 min or so - but now it seems to be up and running again.

If there is no one else who has these kind of problems with accessing the material in the repo, I would suggest that you simply copy the slides and the group exercises from one of your fellow students.

In the group exercise, we talked a bit about subtyping of function types - which is typically slightly confusing if you see it for the first time. Yesterday, I put a solution for the group exercise online, where I added some more examples involving record types + function types from which it may get...

To answer this question, you should think about whether you can come up with example expressions that your type system would accept if you allowed the type of an id to change, but that would fail during interpretation. What happens for example if you define a function in an inner let that in the bod...

That is correct - we fixed that already, I think shortly after you wrote the post. Hopefully, everybody sees that fix also. If not, hit the Reset button and delete the resulting comment clutter....
If you discover more problems, tell me .