update to use Control.GArrow instead of GHC.HetMet.GArrow

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

diff --git a/examples/Demo.hs b/examples/Demo.hs
index afedde6..579bf4d 100644 (file)
--- a/examples/Demo.hs
+++ b/examples/Demo.hs
@@ -1,22 +1,160 @@
-{-# OPTIONS_GHC -XModalTypes -fcoqpass -dcore-lint #-}
+{-# OPTIONS_GHC -XModalTypes -fflatten -funsafe-skolemize -dcore-lint -XScopedTypeVariables -fsimpleopt-before-flatten #-}
 module Demo (demo) where
 
---demo con mer = <[ ~~mer ~~(con (2::Int)) ~~(con (12::Int)) ]>
 
--- demo const mult = <[ let q = ~~(const (1::Int)) in ~~mult q q ]>
+demo const mult =
+ <{ \y ->
+    let   foo  = ~~mult (~~mult foo (~~mult y foo)) (~~mult y ~~(const 3))
+    in    foo }>
+
 
+{-
 demo const mult =
- <[ let     twelve = ~~(const (12::Int))
-    in let  four    = ~~(const (4::Int))
-         in  ~~mult four twelve  ]>
+  <{ \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 =
- <[ let     twelve = ~~(const (12::Int))
-    in let  twelvea = twelve
-            four    = ~~(const (4::Int))
-            twelveb = twelve
-         in  ~~mult (~~mult twelvea four) (~~mult twelveb twelveb) ]>
+    <{ \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
+{-
+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 ::
+    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  }>
 -}
 
 {-
@@ -24,5 +162,11 @@ demo const mult = demo' 3
  where
   demo' 0 = const 12
   demo' 1 = const 12
-  demo' n = <[ ~~mult ~~(demo' (n-1)) ~~(demo' (n-2)) ]>
--}
\ No newline at end of file
+  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