Music
So we have just one question.
Alright, for the first equation in this you can take x, a, red, x, t, a.
If we just go with the vector of the semantic, so we have sine of x, a, x,
which is sine of i, t, which is equal to zeta i, t, so zeta.
So for the first clause, if psi and phi are chosen like that, so calculated from left to right,
we indeed can obtain eta, and similarly, well the second is similar, I'm worried about the sword,
because they all need an algebra so they'll notice next year. So the first product was left hand side, x, a, left, t,
so we have one here, and the next one, okay.
So what do we have here, we have here an i-name, so we call this phi, transformation phi of,
you, so difference between the numbers, but is simply what we have.
right.
Okay, so and here, so this is simply the silent projection.
Now this is side of this.
And here.
So, if you calculate it properly, this is side of our quantum mechanics.
So because this y-axis remains the same as to the left part, it will connect to the left.
Okay, so if we now substitute finding the silent completely, so here.
1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14.
So that now is a little bit more interesting part.
Now this can be replaced by T, TR1, IMD.
So that's something that you've proven that funcorial action can be expressed via eta
and star.
So it's one of the equivalence theorems that you've proved.
And now this is a natural transformation so we can distribute this sort of expression
T and put in T the FID.
So this is T, TR1, IMD, IMD, TR2, TR3, TR4.
Okay and what happens here, so if we compose this with things, this will get TR1, TR2.
Now this is C, D, T.
Okay, this is the...
So this is hopefully, it confirms the intuition about the strengths.
Because the strength is such a thing.
So we need to inject a value, inject computation, how we do it.
We run the computation and then return it here, x and y.
I think this expression is much more suggestive, it explains better where the strength is.
And this calculation shows that the strength in trans-optimeta language is that strength
that we have from pure mathematical notation.
So that was the point of that part of the exercise.
So I hope it can be done very, very soon.
So, right, in terms of the tests here, we considered some of the two laws, which were
the unit laws and the associativity law.
I would propose that we just keep it for the time being, because I think we should go.
And I would propose that we do something in the second part, which is the opposite direction.
So if phi and psi are just postulated and not associated at the moment, then some of
this implies that, implies the diagrams for the monads.
So let's see, someone should explain this.
Right, so did someone do this exercise?
Yes, you did.
But the thing is, I'm interested.
So basically, I've completed this statement of the theory, because it says that psi and
Presenters
Zugänglich über
Offener Zugang
Dauer
01:26:43 Min
Aufnahmedatum
2015-07-08
Hochgeladen am
2019-04-26 04:09:29
Sprache
en-US
The course provides a background to various topics of the theory of programming. As a guiding paradigm monad-based functional programming is chosen. The idea of the course is to provide clear computational insights to various concepts of computer science and to practice these by concrete implementations in suitable programming languages such as Haskell.
Lernziele und Kompetenzen:
Fachkompetenz Wissen Students demonstrate an understanding of the role of computational monads in the context of functional programming and as a semantic tool for programming and system specification; Students reproduce the main definitions and results on monads, monad combination, and further categorical constructions end explain them from a programming perspective. Anwenden Students use the monad-based approach to formalise examples involving various kinds of computational effects as monads. Students use monads for practical programming in programming languages, such as Haskell. Analysieren Students identify various computational effects as monads and provide an appropriate treatment of problems from various semantic domains (probabilistic, nondeterministic, concurrent), possibly providing a monad-based software implementation. Selbstkompetenz Students will be regularly provided with small challenges in form of exercises to be able to have a gradual progress with the lecture material.