This commit was merged in pull request #1.
This commit is contained in:
@@ -13,9 +13,8 @@ close = transformM \case
|
|||||||
ExpLetRec [(f, AbsLambda lam@(MkLambda bs kb m))] e -> do
|
ExpLetRec [(f, AbsLambda lam@(MkLambda bs kb m))] e -> do
|
||||||
f_code <- gensym' @Name $ f ^. _Wrapped'. to (<> "-code")
|
f_code <- gensym' @Name $ f ^. _Wrapped'. to (<> "-code")
|
||||||
-- it would probably be most sane to generate a symbol for `env`,
|
-- it would probably be most sane to generate a symbol for `env`,
|
||||||
-- but we're reusing the lambda binding for the sake of recursive
|
-- but we're reusing the lambda binding so we don't have to
|
||||||
-- reverences.
|
-- explicitly substitute recursive calls.
|
||||||
-- env <- gensym' @Name "env"
|
|
||||||
let frees = freeWithBound' [f] lam
|
let frees = freeWithBound' [f] lam
|
||||||
let m' = ifoldr
|
let m' = ifoldr
|
||||||
(\n x q -> [cps|(prim (env-ref #{f} #{n})
|
(\n x q -> [cps|(prim (env-ref #{f} #{n})
|
||||||
|
|||||||
@@ -23,18 +23,16 @@ telescope f = Cont.runCont . traverse (Cont.cont . f)
|
|||||||
|
|
||||||
|
|
||||||
|
|
||||||
pattern Atomic e <-
|
|
||||||
e@( Scm.ExpLambda _ _
|
|
||||||
; Scm.ExpVar _
|
|
||||||
; Scm.ExpLit _ )
|
|
||||||
|
|
||||||
-- | Transform an expression with a meta-continuation.
|
-- | Transform an expression with a meta-continuation.
|
||||||
convert
|
convert
|
||||||
:: forall es. (GenSym :> es)
|
:: forall es. (GenSym :> es)
|
||||||
=> Scm.Exp -> (Val -> Eff es Exp) -> Eff es Exp
|
=> Scm.Exp -> (Val -> Eff es Exp) -> Eff es Exp
|
||||||
|
|
||||||
convert (Scm.ExpVar x) k = k $ ValVar x
|
convert (Scm.ExpVar x) k = k $ ValVar x
|
||||||
convert (Scm.ExpLit l) k = k $ ValLit l
|
convert (Scm.ExpLit l) k = k . ValImm $ case l of
|
||||||
|
LitInt n -> ImmInt n
|
||||||
|
LitBool b -> ImmBool b
|
||||||
|
_ -> _
|
||||||
|
|
||||||
-- special case: call/cc is desugared during cps-conversion...
|
-- special case: call/cc is desugared during cps-conversion...
|
||||||
convert (Scm.ExpPrim (PrimCallCC withcc)) k = do
|
convert (Scm.ExpPrim (PrimCallCC withcc)) k = do
|
||||||
@@ -112,10 +110,7 @@ convertLambda bs m = do
|
|||||||
|
|
||||||
convertProgram :: forall es. (GenSym :> es) => Scm.Program -> Eff es Program
|
convertProgram :: forall es. (GenSym :> es) => Scm.Program -> Eff es Program
|
||||||
convertProgram p =
|
convertProgram p =
|
||||||
MkProgram <$> telescope (convert @es) (p ^.. each . _Left) \exps ->
|
MkProgram <$> telescope (convert @es) (p ^.. each . _Left) (pure . Halt)
|
||||||
pure . Halt1 $ case NE.nonEmpty exps of
|
|
||||||
Nothing -> ValLit Void
|
|
||||||
Just es -> NE.last es
|
|
||||||
|
|
||||||
convertExp :: forall es. (GenSym :> es) => Scm.Exp -> Eff es Exp
|
convertExp :: forall es. (GenSym :> es) => Scm.Exp -> Eff es Exp
|
||||||
convertExp e = convert e (pure . Halt1)
|
convertExp e = convert e (pure . Halt1)
|
||||||
|
|||||||
@@ -60,13 +60,15 @@ evalVal :: Env -> Val -> Obj
|
|||||||
evalVal g = \case
|
evalVal g = \case
|
||||||
ValVar x -> fromMaybe (error [i|unbound: #{x}|]) $ g ^?! #vars . at x
|
ValVar x -> fromMaybe (error [i|unbound: #{x}|]) $ g ^?! #vars . at x
|
||||||
ValImm x -> ObjImm x
|
ValImm x -> ObjImm x
|
||||||
ValLit l -> ObjImm $ case l of
|
|
||||||
LitInt n -> ImmInt n
|
|
||||||
LitBool b -> ImmBool b
|
|
||||||
|
|
||||||
emptyEnv :: Env
|
emptyEnv :: Env
|
||||||
emptyEnv = MkEnv
|
emptyEnv = MkEnv
|
||||||
{ vars = mempty
|
{ vars = mempty
|
||||||
|
-- a kinda silly hack to make sure `halt` is handled correctly when
|
||||||
|
-- it appears as the tail continuation of an application. the
|
||||||
|
-- special case of `eval` responsible for `halt` only covers terms
|
||||||
|
-- of the form `(continue $halt xs …)`; other terms such as
|
||||||
|
-- `($some-fn xs $halt)` just see an undefined label `$halt`.
|
||||||
, labels = H.singleton "halt"
|
, labels = H.singleton "halt"
|
||||||
( emptyEnv
|
( emptyEnv
|
||||||
, AbsKappa' ["h0"] $ Halt [ValVar "h0"]
|
, AbsKappa' ["h0"] $ Halt [ValVar "h0"]
|
||||||
|
|||||||
@@ -82,13 +82,13 @@ popArg n = [expr|
|
|||||||
|
|
||||||
lowerVal :: (HasCallStack, GenMod :> es) => Env -> Val -> Eff es Wasm.Expr
|
lowerVal :: (HasCallStack, GenMod :> es) => Env -> Val -> Eff es Wasm.Expr
|
||||||
|
|
||||||
lowerVal g (ValLit l) =
|
lowerVal g (ValImm imm) =
|
||||||
pure $ case l of
|
pure $ case imm of
|
||||||
LitInt n -> [expr|
|
ImmInt n -> [expr|
|
||||||
(i32.const #{n})
|
(i32.const #{n})
|
||||||
##{makeSmallFixnum}
|
##{makeSmallFixnum}
|
||||||
|]
|
|]
|
||||||
LitBool b -> [expr|
|
ImmBool b -> [expr|
|
||||||
(i32.const #{b'})
|
(i32.const #{b'})
|
||||||
ref.i31
|
ref.i31
|
||||||
|]
|
|]
|
||||||
|
|||||||
@@ -87,8 +87,6 @@ stackify _ e = error [i|unimplemented exp: #{e}|]
|
|||||||
|
|
||||||
stackifyVal :: Env -> Val -> Stk.Val
|
stackifyVal :: Env -> Val -> Stk.Val
|
||||||
stackifyVal g = \case
|
stackifyVal g = \case
|
||||||
ValLit (LitInt n) -> Stk.ValImm (ImmInt n)
|
|
||||||
ValLit (LitBool b) -> Stk.ValImm (ImmBool b)
|
|
||||||
ValImm imm -> Stk.ValImm imm
|
ValImm imm -> Stk.ValImm imm
|
||||||
ValVar v -> var g v
|
ValVar v -> var g v
|
||||||
v -> error [i|unimplemented val: #{v}|]
|
v -> error [i|unimplemented val: #{v}|]
|
||||||
|
|||||||
@@ -63,7 +63,6 @@ import Gyehoek.Prelude hiding (op)
|
|||||||
|
|
||||||
data Val
|
data Val
|
||||||
= ValImm Imm
|
= ValImm Imm
|
||||||
| ValLit Lit
|
|
||||||
| ValVar Name
|
| ValVar Name
|
||||||
deriving (Show, Generic, Data, Eq)
|
deriving (Show, Generic, Data, Eq)
|
||||||
|
|
||||||
@@ -173,7 +172,6 @@ instance Plated Exp where
|
|||||||
|
|
||||||
instance S.SexpIso Val where
|
instance S.SexpIso Val where
|
||||||
sexpIso = match
|
sexpIso = match
|
||||||
$ With (\lit -> lit . S.sexpIso)
|
|
||||||
$ With (\imm -> imm . S.sexpIso)
|
$ With (\imm -> imm . S.sexpIso)
|
||||||
$ With (\var -> var . S.sexpIso)
|
$ With (\var -> var . S.sexpIso)
|
||||||
$ End
|
$ End
|
||||||
|
|||||||
Reference in New Issue
Block a user