Question

我研究定界延续，并且目前正在玩抛弃它们来获得类似于引发异常的效果。

这是给我带来麻烦的原因：

const structure = type => cons => {
  const f = (f, args) =>
   ({["run" + type]: f, [Symbol.toStringTag]: type, [Symbol("args")]: args});

  return cons(f);
};

const Cont = structure("Cont")
  (Cont => f => Cont(f));

const runCont = tf => k =>
  tf.runCont(k);

const reset = tf =>
  of(tf.runCont(id));
  
const shift = f =>
  Cont(k => f(k).runCont(id));

const of = x =>
  Cont(k => k(x));
  
const liftM2 = f => tf => tg =>
  of(runCont(tf) (x => runCont(tg) (y => f(x) (y))));

const id = x => x;

const mulM = liftM2(x => y => x * y);
const addM = liftM2(x => y => x + y);
const subM = liftM2(x => y => x - y);

const z1 = mulM(of(5))
  (reset
    (addM
      (shift(k => of(3)))
        (of(3)))
  ).runCont(id); // 5 * 3 = 15 (as expected)

const z2 = mulM(of(5))
  (reset // A
    (mulM // B
      (addM
        (shift(k => of(3))) // C should unwind up to A instead of B
          (of(3)))
            (of(4)))
  ).runCont(id); // 5 * 3 * 4 = 60 (but 15 expected)

console.log(z1);
console.log(z2);

似乎我只能将堆栈展开一帧。是设计shift / reset还是由我的实现中的缺陷引起的？

[编辑]

我让它在Haskell中工作，即是一个实现问题：

reset :: ((a -> a) -> a) -> (a -> r) -> r
reset k f = f $ k id

shift :: ((a -> r) -> (r -> r) -> r) -> (a -> r) -> r
shift f k = f k id

return :: a -> (a -> r) -> r
return a k = k a

liftM2 :: (a -> b -> c) -> ((a -> r) -> r) -> ((b -> r) -> r) -> (c -> r) -> r
liftM2 f ma mb k = ma $ \a -> mb $ \b -> k (f a b)

example :: Num a => (a -> r) -> r
example = liftM2 (*) (return 5) (reset (liftM2 (*) (return 3) (liftM2 (+) (return 2) (shift (\k -> return 3)))))

Answer 1

我认为您的liftM2已损坏，因为它并不懒惰。代替使用of，它应该构造一个新的延续：

const liftM2 = f => tf => tg =>
  Cont(k => runCont(tf) (x => runCont(tg) (y => k(f(x)(y)))));

如何从多个嵌套函数中丢弃定界的延续？

1 个答案: