D120.de/forum

Ah, ok - that's right, I've overseen this possibility. But what's about the define-thing?

In addition to Aaron's suggestions I'd like to know what's meant with the statement "avoids writing an expression multiple times" in the definition of lazy substitution (slide 40 of "This course and scheme in a nutshell"). When we have a look at the example below the definition the {+ 5 5} expressio...

I was wondering about it, too.... but I was wondering about solving some of the tasks yet.....so, it my have been true for my intuition.

But, never mind - this way isn't too dificult

I just reviewed the contents of last lecture and I do have a problem while finding the conclusion of this lecture.... (already had it during the lecture but hoped it's understandable when recapulating it): On slide 18 it's written "Can we get rid of define?" Then it's explained how to build recursio...

Is there any reason, why we set task2cont to a lambda function, which cosumes a (dummy)-argument, which is not used.
Why don't we use a function without any argument?

Am I right, that it should be (define my-empty (error "not yet implemented")) instead of (define (my-empty) (error "not yet implemented")) ? Another one: Should we stay close to the fold-interpretation of expressions or to the more intuitive (but harder to implement) version? Concrete: Is the result...

Thanks for your comments first, but they didn't really help yet. I'm really struggling.... Is there a function of type "State DB a -> a"? Yes, there is such one: runDB :: State DB a -> a runDB (State st) = let (result,db) = st [] in result But it has effects on the database, because it resets it to ...

I have to agree that the monads are really strange with the existing explanations. I had been in the lecture about it, but didn't really understand the concept. If there are more people with a problem like this, maybe we should get in detail in the next lecture. I didn't find a solution for this tas...

Hier gibt es ein How-To für das TUD-Design, vielleicht hilft das weiter:
http://exp1.fkp.physik.tu-darmstadt.de/ ... assen.html

In the general exercise 7 thread we already had the question about the evaluation in the if-,then-,else-clauses. I couldn't join the exercise on friday and unfortunately this question isn't really answered in the solution-slides (slide 58). I don't really understand why not to force the evaluation o...

One question concerning task 4:
Why does 1 have a prime factor in 2, 3, 5?
IMHO the one should not be in the result list.

Edit: I see, it's easier to solve with the leading 1 but I don't really understand why it should be in the list.

Thanks for your help so far....but....I'm getting more and more confused. If I am not mistaken (cannot try it out at the moment), however, you can also place additional constraints upon the indivual constructor functions by providing an explicit function declaration for NumE, etc. (no definition; th...

I do have problems with this task, too. In the data-definition I tried something like: data FAE = NumE (Num a => a) | AddE FAE FAE | IdE String | FunE String FAE | AppE FAE FAE deriving (Show, Eq) I want to have "a" be an instance of Num, but this doesn't work this way because no constructor is defi...

War sowohl vorhin als auch jetzt mit dem Campus-Profil online.
Vorhin gings nicht, jetzt gehts....
Trotzdem danke

Hallo, ich bräuchte ein Paper von SpringerLink. Laut http://www.informatik.tu-darmstadt.de/web/bibliothek/onlinedokumente.htm kommt man an diese aus dem VPN-Netz ran. Ich habe das eben versucht, allerdings wird mir dann nur angeboten, das Paper zu kaufen. Vor ner Weile kam man da so noch ran. Weiß d...