![@brokenix@emacs.ch avatar](https://kbin.social/media/cache/resolve/avatar_thumb/4f/a4/4fa4be828e80b087ba4158d65a49cfa3d7a0d68c98a3572ecfc61936e76b801b.jpg)
![@brokenix@emacs.ch](https://kbin.social/media/cache/resolve/user_cover/00/d1/00d12a79cc696e3f3722b2b1e4689d64e3f99f70ce9358df1e3ca5dcb7c6312c.png)
![@brokenix@emacs.ch avatar](https://kbin.social/media/cache/resolve/avatar_thumb/4f/a4/4fa4be828e80b087ba4158d65a49cfa3d7a0d68c98a3572ecfc61936e76b801b.jpg)
data Free f a = Pure a | Free (f (Free f a))
⊢ V : C ✓
classical logic corresponds to the mechanism of first-class continuation under the Curry-Howard isomorphism
all partial functions are computable
This profile is from a federated server and may be incomplete. Browse more on the original instance.