In order to do currying via C++ functions*), I might use something
like an evaluator that evaluates an unbound symbol to itself. Is that
possible?
Translated into Scheme code, it corresponds to defining say
(define add (lambda (x) (lambda (y) (+ x y
by
(define add1 (lambda (y) (+ x y)
Hi Hans,
On Sat 06 Mar 2010 10:03, Hans Aberg writes:
> (define add1 (lambda (y) (+ x y)))
> and then
> (define add (lambda (x) ...))
> Thus in two separate steps, where the unbound symbol x in the first
> expression is bound only in the second.
If I understand you correctly, this is not po
On 6 Mar 2010, at 12:13, Andy Wingo wrote:
(define add1 (lambda (y) (+ x y)))
and then
(define add (lambda (x) ...))
Thus in two separate steps, where the unbound symbol x in the first
expression is bound only in the second.
If I understand you correctly, this is not possible in normal Schem
Typos, it should have been for the curried function type:
symbol x("x"), y("y");
function1 > add = x >>= y >>= x
+ y;
// Binds to the right.
Hans
I have a project which main purpose is to edit the cursor so that the
program can write from right to left (arabic language)
I downloaded the software from the website and the source for windows
version wintexmacs-1.0.5-src.exe .I use microsoft visual studio 2008
after i tried to convert the exist
