Update 29/02/2016
The call is now closed. Thanks to eveyone that submitted
This is a lightweight call for speakers for "Almost Functional", a one-off, free, evening event in Edinburgh on the 14th of April.
Please spread this URL far and wide.
| {-# LANGUAGE GeneralizedNewtypeDeriving #-} | |
| module Language.HigherRank.Main | |
| ( Expr(..) | |
| , EVar(..) | |
| , Type(..) | |
| , TVar(..) | |
| , TEVar(..) | |
| , runInfer | |
| ) where |
Update 29/02/2016
The call is now closed. Thanks to eveyone that submitted
This is a lightweight call for speakers for "Almost Functional", a one-off, free, evening event in Edinburgh on the 14th of April.
Please spread this URL far and wide.
(by @andrestaltz)
If you prefer to watch video tutorials with live-coding, then check out this series I recorded with the same contents as in this article: Egghead.io - Introduction to Reactive Programming.
Attention: the list was moved to
https://github.com/dypsilon/frontend-dev-bookmarks
This page is not maintained anymore, please update your bookmarks.
| /// This type is only every inhabited when S is nominally equivalent to T | |
| pub type Is <S, T> = Is_ <S, T>; | |
| priv struct Is_ <S, T>; | |
| // Construct a proof of the fact that a type is nominally equivalent | |
| // to itself. | |
| pub fn Is <T> () -> Is <T, T> { Is_ } | |
| pub impl <S, T> Is_ <S, T> { |