improvements to examples/

[coq-hetmet.git] / examples / Demo.hs

diff --git a/examples/Demo.hs b/examples/Demo.hs
index f5069fa..fb8666f 100644 (file)
--- a/examples/Demo.hs
+++ b/examples/Demo.hs
@@ -1,17 +1,179 @@
-{-# OPTIONS_GHC -XRankNTypes -XScopedTypeVariables -XFlexibleContexts -XModalTypes -XKindSignatures -fcoqpass -XMultiParamTypeClasses -dcore-lint #-}
-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 ({-sample1,sample2,-}sample5,sample6) where
+
+sample5 :: forall c . (Int -> <{Int}>@c) ->  <{Int -> Int -> Int}>@c -> <{Int -> Int}>@c
+sample5 const <[ (*) ]> =
+ <{ \y ->
+    let   foo  = (~~(const 3) * foo) * y
+    in    foo }>
+
+sample6 :: forall c . (Int -> <{Int}>@c) -> <{Int -> Int -> Int}>@c -> <{Int -> Int}>@c
+sample6 const <{ (*) }> = pow 6
+   where
+     --pow :: Int -> <{ Int -> Int }>@a
+     pow 0 = <{ \x -> ~~(const 1) }>
+     pow 1 = <{ \x -> x }>
+     pow n = <{ \x -> x * ~~(pow (n - 1)) x }>
+
+demo2 ::
+    forall c . 
+         (Int -> <{Int}>@c) -> 
+        <{Int -> Int -> Int}>@c ->
+        <{Int -> Int}>@c
+
+demo2 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
+                   }>
+
+-}
+
+
 
 {-
-foo :: (forall g a . <[ () -> a
-                 PGArrow g (GArrowUnit g) a ->
-                 (forall b . PGArrow g (GArrowTensor g b b) b) ->
+demo const mult =
+    <{ \y -> ~~(foo 3) }>
+        where
+          foo 0 = const (12::Int)
+          foo n = <{ let recurs = ~~(foo (n-1))
+                     in  ~~mult recurs recurs
+                   }>
+
 -}
---foo con mer   = <[ ~~mer ~~con ~~con ]>
-foo f = <[ ~~f ]>
 
---tester2 f = <[ \x -> ~~f x x ]>
 
-main = tikz' $ \a b -> pga_flatten (foo (pga_unflatten a))
+
+
+
+
+
+
+
+
+
+
+
+
+
+{-
+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
+{-
+demo const mult =
+ <{ \y ->
+    let   twelve  = ~~mult twelve y
+    in    twelve }>
+-}
+
+{-
+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 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)) }>
+-}
+
+-- BUG
+--demo const mult = <{ \y -> ~~(demo' 0) }>
+--  where
+--   demo' 0 = const 4
+--   demo' n = const 4