Skip to main content

Questions tagged [continuations]

2 votes
0 answers
208 views

The IR given in Appel's book (Compiling with Continuations) is certainly well explored and battle-tested in production compilers. I have been able to find several works based on or inspired by it (...
paulotorrens's user avatar
4 votes
1 answer
274 views

I am struggling to wrap my head around this compiler technique, so let's say here's my factorial function ...
hello world's user avatar
0 votes
1 answer
159 views

I'm stuck on something in in Shan's article Shift to Control, about CPS. On page three he writes the CPS transform ...
Eric Auld's user avatar
  • 115
-1 votes
1 answer
2k views

I have an array of numbers, and I need to check if there is a repeating pattern in the array. Like, for example, if I have an array A=[1,1,6,1,1,6,1,1,6,1,1,6...] this should return "Yes" (...
Ishraaq Parvez's user avatar
1 vote
0 answers
42 views

A defer statement takes another statement and evaluates the given statement at the end of the current function call. See how Go does it. Delimited continuations can be abused to provide throw/catch ...
kkeey's user avatar
  • 113
1 vote
0 answers
56 views

Quoting from Wikipedia: In mathematical logic, the disjunction and existence properties are the "hallmarks" of constructive theories such as Heyting arithmetic and constructive set theories ...
glaebhoerl's user avatar
6 votes
0 answers
539 views

I am learning $\lambda \mu$-calculus (self-study). I learned it because it seems very useful for understanding Curry-Howard correspondence (e.g understanding the connection between classical logic ...
chansey's user avatar
  • 295
2 votes
0 answers
66 views

The Scheme Programming Language says It turns out that any program that uses call/cc can be rewritten in CPS without call/cc, but a total rewrite of the program (sometimes including even system-...
Tim's user avatar
  • 5,045
5 votes
1 answer
160 views

Recently I saw 3 cps transformation rules, but no explanations were given. expressions: $e :=x\left|e e^{\prime}\right| \lambda x \cdot e$ rules: $$ \begin{array}{l}{[[x]]=\lambda \kappa \cdot \...
Shuumatsu's user avatar
  • 151
4 votes
1 answer
459 views

Let's call the two languages in question (untyped lambda calculus with single or multiple prompt delimited continuations) L_delim and L_prompt. Is it possible to express multi-prompt delimited ...
river's user avatar
  • 163
1 vote
0 answers
84 views

In a language supporting CPS, but no built in global state, we can represent a state based computation using a function. We call this function a state function. Assume the function takes three ...
Christopher King's user avatar
4 votes
1 answer
264 views

I'm reading Dijkstra Monads for Free for a presentation I'll be doing and it's pretty meaty. One of the things that I keep running into is the term "CPS'ing". I've read a little bit on ...
Ben Kushigian's user avatar
3 votes
0 answers
116 views

I am not a computer scientist and have no knowledge of programming. However, I wondered continuations occur as natural and interesting mathematical structures, perhaps as algebraic or type theoretic ...
user65526's user avatar
  • 194
26 votes
2 answers
6k views

According to the Wikipedia page on static-single assignment (SSA), SSA is used by large and well-known projects such as LLVM, GCC, MSVC, Mono, Dalvik, SpiderMonkey, and V8 while the page on projects ...
CinchBlue's user avatar
  • 634
2 votes
0 answers
159 views

I have a computational problem where I'm given the values of a function $f(x,y)$ sampled on 2D regular grid. The function is given in a compact domain of a grid and it is strictly monotone w.r.t. $x$ ...
Igor's user avatar
  • 21

15 30 50 per page