Skip to content

Instantly share code, notes, and snippets.

View gdeest's full-sized avatar

Gaël Deest gdeest

65 followers · 2 following
  • Autogriff
  • Rennes, France
View GitHub Profile
@gdeest
gdeest / main.hs
Created November 25, 2015 06:44
{-# LANGUAGE DataKinds, TypeOperators, GADTs, KindSignatures, RankNTypes, ScopedTypeVariables #-}
{-# OPTIONS_GHC -fplugin GHC.TypeLits.Normalise #-}
import GHC.TypeLits
import Data.Type.Equality(type (==), (:~:)(Refl))
-- Vector of type t and length n.
data Vec t (n :: Nat) where
VNil :: Vec t 0
VCons :: t -> Vec t n -> Vec t (n+1)
@gdeest
gdeest / main.hs
Created November 25, 2015 06:43
{-# LANGUAGE DataKinds, TypeOperators, GADTs, KindSignatures, RankNTypes, ScopedTypeVariables #-}
{-# OPTIONS_GHC -fplugin GHC.TypeLits.Normalise #-}
import GHC.TypeLits
import Data.Proxy
import Data.Type.Equality(type (==), (:~:)(Refl))
import Unsafe.Coerce
-- Vector of type t and length n.
data Vec t (n :: Nat) where
@gdeest
gdeest / main.hs
Created November 24, 2015 22:15
{-# LANGUAGE DataKinds, TypeOperators, GADTs, KindSignatures, RankNTypes #-}
{-# OPTIONS_GHC -fplugin GHC.TypeLits.Normalise #-}
import GHC.TypeLits
import Data.Proxy
import Data.Type.Equality(type (==), (:~:)(Refl))
import Unsafe.Coerce
data Vec t (n :: Nat) where
VNil :: Vec t 0
@gdeest
gdeest / main.hs
Created November 24, 2015 22:14
{-# LANGUAGE DataKinds, TypeOperators, GADTs, KindSignatures, RankNTypes #-}
{-# OPTIONS_GHC -fplugin GHC.TypeLits.Normalise #-}
import GHC.TypeLits
import Data.Proxy
import Data.Type.Equality(type (==), (:~:)(Refl))
import Unsafe.Coerce
data Vec t (n :: Nat) where
VNil :: Vec t 0
@gdeest
gdeest / main.hs
Created November 24, 2015 22:07
{-# LANGUAGE DataKinds, TypeOperators, GADTs, KindSignatures, RankNTypes #-}
{-# OPTIONS_GHC -fplugin GHC.TypeLits.Normalise #-}
import GHC.TypeLits
import Data.Proxy
import Data.Type.Equality(type (==), (:~:)(Refl))
import Unsafe.Coerce
data Vec t (n :: Nat) where
VNil :: Vec t 0
@gdeest
gdeest / gist:4754625
Last active December 12, 2015 09:49
/* Version 1 */
f0 = A4*X0*X0*X0*X0 + A3*X0*X0*X0 + A2*X0*X0 + A1*X0 + A0;
/* Version 2 */
a[4]=A4; a[3]=A3; a[2]=A2;
a[1]=A1; a[0]=A0;
for(i=0;i<5;i++){
b[i]=0;
@gdeest
gdeest / gist:4741760
Created February 8, 2013 20:40
data Tree a = Node a [Tree a]
| Leaf a
build :: Monad m => (a -> m [a]) -> a -> m (Tree a)
build get_sons a = do sons <- get_sons a
case sons of
[] -> return $ Leaf a
lst -> do trees <- sequence $ map (build get_sons) lst
return $ Node a trees
@gdeest
gdeest / gist:4177177
Created November 30, 2012 17:27
{-# LANGUAGE OverloadedStrings #-}
import Language.C.Data.InputStream
import Language.C.Syntax.AST
import Language.C.Data.Position
import Language.C.Parser
import Language.C.Pretty
parse exp = execParser_ expressionP exp nopos
@gdeest
gdeest / gist:4177173
Created November 30, 2012 17:27
{-# LANGUAGE OverloadedStrings #-}
import Language.C.Data.InputStream
import Language.C.Syntax.AST
import Language.C.Data.Position
import Language.C.Parser
import Language.C.Pretty
parse exp = execParser_ expressionP exp nopos
@gdeest
gdeest / gist:4176297
Created November 30, 2012 15:08
{-# LANGUAGE OverloadedStrings #-}
import Language.C.Data.InputStream
import Language.C.Syntax.AST
import Language.C.Data.Position
import Language.C.Parser
import Language.C.Pretty
parse exp = execParser_ expressionP exp nopos