X-Git-Url: http://git.megacz.com/?p=coq-hetmet.git;a=blobdiff_plain;f=examples%2FDemo.hs;h=579bf4d2045d3c96cadce209cabb07b5f67d17e6;hp=ff4468c59e808d6d2882e412477d392624a26977;hb=ec996e8cb550676d89d187061db7d018af9ec88d;hpb=cb76623a15c668453a369b06698c6896ba3075ee diff --git a/examples/Demo.hs b/examples/Demo.hs index ff4468c..579bf4d 100644 --- a/examples/Demo.hs +++ b/examples/Demo.hs @@ -1,19 +1,172 @@ -{-# OPTIONS_GHC -XRankNTypes -XScopedTypeVariables -XFlexibleContexts -XModalTypes -XKindSignatures -fcoqpass -XMultiParamTypeClasses -dcore-lint #-} -module Demo (foo) where -import GHC.HetMet.GArrow -import GHC.HetMet.CodeTypes -import GHC.HetMet.Private ---import GArrowTikZ +{-# OPTIONS_GHC -XModalTypes -fflatten -funsafe-skolemize -dcore-lint -XScopedTypeVariables -fsimpleopt-before-flatten #-} +module Demo (demo) where + +demo const mult = + <{ \y -> + let foo = ~~mult (~~mult foo (~~mult y foo)) (~~mult y ~~(const 3)) + in foo }> + + +{- +demo const mult = + <{ \y -> + ~~mult + (~~(const 1)) + (~~mult y y) + }> +-} + + + + + + +{- +demo const mult = + <{ \y -> + ~~mult + (~~mult (~~mult y y) (~~mult y y)) + (~~mult (~~mult y y) (~~mult y y)) + }> +-} + + + +{- +demo const mult = + <{ \y -> ~~(foo 4) }> + where + foo 0 = const (12::Int) + foo n = <{ let bar = ~~(foo (n-1)) + in ~~mult bar bar + }> + +-} + + + +{- +demo const mult = + <{ \y -> ~~(foo 3) }> + where + foo 0 = const (12::Int) + foo n = <{ let recurs = ~~(foo (n-1)) + in ~~mult recurs recurs + }> + +-} + + + + + + + + + + + + + + + +{- +demo const mult = + <{ \y -> ~~(foo 2 <{y}>) }> + where + foo 0 y = const (12::Int) + foo n y = <{ let recurs = ~~(foo (n-1) y) + in ~~mult recurs recurs + }> +-} + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +-- demo const mult = <{ \(y::Int) -> ~~mult y ~~(const 12) }> +-- demo' n = <{ ~~mult ~~(demo' (n-1)) ~~(demo' (n-1)) }> +-- golden {- -foo :: (forall g a . <[ () -> a - PGArrow g (GArrowUnit g) a -> - (forall b . PGArrow g (GArrowTensor g b b) b) -> +demo const mult = + <{ \y -> + let twelve = ~~mult twelve y + in twelve }> -} ---foo con mer = <[ ~~mer ~~con ~~con ]> ---foo const merge = <[ ~~merge ~~const (~~merge ~~const ~~const) ]> -foo const merge = <[ ~~merge ~~const ~~const ]> ---tester2 f = <[ \x -> ~~f x x ]> +{- +demo const mult = + <{ \y -> let y = ~~(const 4) in ~~mult (~~mult y y) (~~mult y y) }> +-} + +{- +demo const mult = + <{ \(y::Int) -> + let four = ~~mult four ~~(const 4) +-- twelve = {- {- ~~mult four -} ~~(const 12) -} four + in four + }> +-} +demo :: + forall c . + (Int -> <{Int}>@c) -> + <{Int -> Int -> Int}>@c -> + <{Int -> Int}>@c + +{- +demo const mult = + <{ let twelve = ~~(const (12::Int)) + in let four = ~~(const (4::Int)) + in ~~mult four twelve }> +-} + +{- +demo const mult = demo' 3 + where + demo' 0 = const 12 + demo' 1 = const 12 + demo' n = <{ ~~mult ~~(demo' (n-1)) ~~(demo' (n-2)) }> +-} ---main = tikz' $ \a b -> pga_flatten (foo (pga_unflatten a)) +-- BUG +--demo const mult = <{ \y -> ~~(demo' 0) }> +-- where +-- demo' 0 = const 4 +-- demo' n = const 4