Skip to content
This repository has been archived by the owner on Dec 15, 2020. It is now read-only.

part 2.5, 'The Yoneda Lemma' #52

Merged
merged 1 commit into from
Feb 16, 2018

Conversation

Zelenya
Copy link
Contributor

@Zelenya Zelenya commented Feb 3, 2018

Fixes #23

forall x . (a -> x) -> F x ≅ F a
```
```scala
(A => ?) ~> F ≅ F[A]
Copy link
Contributor Author

@Zelenya Zelenya Feb 3, 2018

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

or should it be something like def α[A]: (A => ?) ~> F ≅ F[A] ?

Copy link
Contributor

@kailuowang kailuowang Feb 9, 2018

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

that would translate to

forall x a . (a -> x) -> F x  F a

right, so the current translation seems fine to me.

C(a, g) :: C(a, a) -> C(a, x)
```
```scala
def cg[A, X]: C[A, A] => C[A, X]
Copy link
Contributor Author

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

¯_(ツ)_/¯ It is getting out of hands.

@kailuowang kailuowang merged commit 467a67f into typelevel:master Feb 16, 2018
Sign up for free to subscribe to this conversation on GitHub. Already have an account? Sign in.
Labels
None yet
Projects
None yet
Development

Successfully merging this pull request may close these issues.

None yet

2 participants