1
Name:
Anonymous
2013-03-02 2:18
In this thread, you may post code that makes use of continuations, and I will attempt to produce code that does the same and looks reasonably similar, without using continuations.
3
Name:
Anonymous 2013-03-02 4:04
>>2
I need a more complete usage in order to bring the generality down to higher order functions alone...
4
Name:
Anonymous 2013-03-02 4:17
ehhhhhh maybe this...
5
Name:
THEOREM OF THE DAY
2013-03-02 4:25
Theorem. Let R be a ring and let a ∈R ). Then then the evaluation map φa R [x ] → R , φa f (x )) = f (a ) is a surjective ring homomorphism.
7
Name:
Anonymous
2013-03-02 4:51
>>6
A
countably infinite set is a set that can be put in one-to-one correspondence with the natural numbers.
8
Name:
Anonymous
2013-03-02 5:25
>>7
define "the natural numbers"
11
Name:
Anonymous
2013-03-02 6:02
>>1
I'll give you a better task: write fibs using delimited continuations.
13
Name:
Anonymous
2013-03-02 6:16
>>9
how do you know, that "for every natural number n, if n is in K, then S(n) is in K"?
14
Name:
Anonymous 2013-03-02 6:22
>>13
From axiom 6, step it up.
15
Name:
Anonymous
2013-03-02 6:27
>>14
How do you know "axiom 6" is correct?
16
Name:
Anonymous
2013-03-02 6:29
>>15
You write gibberish, please don't write random sequences of symbols.
17
Name:
Anonymous
2013-03-02 6:43
>>16
How do you know "i write gibberish"?
18
Name:
Anonymous 2013-03-02 6:57
>>17
Do you even write English? You know, symbols, like letters, have only meaning if you order them correctly.
21
Name:
Anonymous
2013-03-02 9:46
>>20
Are you chinese or something?
23
Name:
Anonymous 2013-03-02 9:50
>>22
Cannot parse alien signs.
24
Name:
Anonymous 2013-03-02 9:50
>>23
Cannot parse alien signs.
25
Name:
Anonymous
2013-03-02 9:51
>>24
>>26
Cannot parse alien signs.
26
Name:
Anonymous 2013-03-02 9:51
>>25
Cannot parse alien signs.
27
Name:
Anonymous
2013-03-02 9:54
Define "define", "cannot", "parse", "alien", "signs" and ".", Nikita.
28
Name:
Anonymous
2013-03-02 9:55
>>1-28
Cannot parse alien signs.