The tag has no usage guidance.

learn more… | top users | synonyms

0
votes
2answers
74 views

reset and shift only one level deep (delimited continuations)? [closed]

I'm looking at the following tutorial on delimited (or composable) continuations: http://community.schemewiki.org/?composable-continuations-tutorial The author(s) propose the following "rewrite ...
-2
votes
1answer
49 views

How is does a scheme lambda function relate to lambda calculus?

For example: (define fact (lambda (n) (if (< n 2) 1 (* n (fact (- n 1))))) How is this an example of applied lambda calculus? I tried to read the ...
0
votes
1answer
57 views

Can we design our own `if` clause in Normal Order evaluation

I have been reading SICP and have been thinking over a thing for quite some time related to evaluation using Substitution with ...
12
votes
1answer
813 views

Can Scheme's call/cc implement all known control flow structures?

The page "Advanced Scheme: Some Naughty Bits" states: Continuations are a powerful control-flow construct from which nearly any other control-flow structure [...] may be derived. I thought ...
13
votes
1answer
342 views

Is contextual equivalence of a language with `quote`-`eval` trivial or not?

In [1], Mitchell Wand demonstrated that adding fexprs to the pure lambda calculus trivializes the theory of contextual equivalence, meaning two terms are contextually equivalent iff they are $\alpha$-...
4
votes
2answers
226 views

Mathematical explanation of recursion and lambda (referenced in The Little Schemer)

In the preface of Friedman and Felleisen's book The Little Schemer it states: We could, for example, describe the entire technical content of this book in less than a page of mathematics, but a ...