[<<][compsci][>>][..]
Thu Oct 27 11:09:02 EDT 2011

Invertible Functor?

I recently ran into a] post about invertible functors.  Can't find it
now.

This is the type of application and abstraction in the embedding of a
typed lambda calculus:

  _app :: r (a -> b) -> r a -> r b
  _lam :: (r a -> r b) -> r (a -> b)

Where _app would just be from an applicative functor, here _lam is the
inverse.




[Reply][About]
[<<][compsci][>>][..]