-{-# OPTIONS_GHC -XModalTypes -fcoqpass -dcore-lint #-}
-module Demo (demo) where
+{-# OPTIONS_GHC -XModalTypes -fflatten -funsafe-skolemize -dcore-lint -XScopedTypeVariables -fsimpleopt-before-flatten #-}
+module Demo ({-sample1,sample2,-}sample5,sample6) where
---demo con mer = <[ ~~mer ~~(con (2::Int)) ~~(con (12::Int)) ]>
+sample5 :: forall c . (Int -> <{Int}>@c) -> <{Int -> Int -> Int}>@c -> <{Int -> Int}>@c
+sample5 const <[ (*) ]> =
+ <{ \y ->
+ let foo = (~~(const 3) * foo) * y
+ in foo }>
--- demo const mult = <[ let q = ~~(const (1::Int)) in ~~mult q q ]>
+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 =
- <[ let twelve = ~~(const (12::Int))
- in let four = ~~(const (4::Int))
- in ~~mult four twelve ]>
+ <{ \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
+{-
+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 twelvea = twelve
- four = ~~(const (4::Int))
- twelveb = twelve
- in ~~mult (~~mult twelvea four) (~~mult twelveb twelveb) ]>
+ <{ let twelve = ~~(const (12::Int))
+ in let four = ~~(const (4::Int))
+ in ~~mult four twelve }>
-}
{-
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