adjunctions?

pull/14/head
Chris Allen 10 years ago
parent c076fb5f95
commit 8648cbcaf0

@ -128,7 +128,7 @@ cpsTransform (Lambda p b) k = Invocation k $ Procedure p
cpsTransform (Combination a b) k = cpsTransform a $ Continuation "v" $ cpsTransform b k cpsTransform (Combination a b) k = cpsTransform a $ Continuation "v" $ cpsTransform b k
``` ```
Later... ### Later...
``` ```
05:38 < ReinH> So for example, if you have an incredibly simple expression language like data Expr a = Val a | Neg a | Add a a 05:38 < ReinH> So for example, if you have an incredibly simple expression language like data Expr a = Val a | Neg a | Add a a
@ -161,3 +161,12 @@ Later...
05:49 < ReinH> toInitial k = k (:) []; toFinal xs = \f z -> foldr f z xs 05:49 < ReinH> toInitial k = k (:) []; toFinal xs = \f z -> foldr f z xs
05:49 < bitemyapp> thank you :) 05:49 < bitemyapp> thank you :)
``` ```
### Something about adjunctions. I don't know.
```
05:51 < ReinH> bitemyapp: usually one loses information going from initial to final though
05:51 < ReinH> there's probably an adjunction here
05:51 < ReinH> there's always an adjunction
05:52 < ReinH> lol of course there's an adjunction
```

Loading…
Cancel
Save