Past exam of the computer science course of the University of Oxford / 2015 / Principles of programming languages / 1 / e

Table of contents
- Solution e

Solution

The identity monad embeds a value unchanged and sequences by ordinary application:

type IdM a = a
result :: a -> IdM a
result x = x
bind :: IdM a -> (a -> IdM b) -> IdM b
bind x f = f x

All three monad laws reduce to substitution in function application. There is no additional program state, failure alternative or continuation layer:

result (x) = x, x ▹ f = f (x) .

 Ancestors (10)

 View article source

 Discussion (0) New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.

  See all articles in the same topic Create my own version