Hi! Can somebody show me a very minimal usage of the Stack? I need just the syntax. thx Gergo +-[Kontra, Gergely @ Budapest University of Technology and...
420
Oliver Bandel
oliver@...
Aug 16, 2002 10:50 pm
Hello, I'm looking for a library, which is able to read different graphic-files-formats and load it into an array or into a format, useable by the...
421
Stalkern 2
stalkern2
Aug 19, 2002 2:18 pm
Dear Oliver, in thes sunny days I could come back to Ocaml and reading the latest messages I've appreciated your posting very much. Actually, I've always asked...
422
Stalkern 2
stalkern2
Aug 19, 2002 2:36 pm
... Sorry for this. Where I am it's quite sunny and most of all I was not thinking of where you can be. Please excuse me. Ernesto...
423
Oliver Bandel
oliver@...
Aug 23, 2002 1:45 pm
Hello Ocaml-Programmers, I'm in complete disorder now. I solved a programming task in the imperative way. Now I wanted to rewrite the program into FP-style. ...
424
Stalkern 2
stalkern2
Aug 29, 2002 1:28 pm
... In my knowledge and practice functional programming is mainly useful for using functions as arguments. So, you can forget values while programming. ... ...
425
giangiammy
Aug 29, 2002 3:40 pm
... Sorry for the intrusion in the discussion, but I'd like to write some considerations about continuations, as I see them quoted, and they are something I...
426
aoandrade
Aug 30, 2002 2:12 pm
I am having problems when using the labltk library, in particular with the Text.tag_add function. When I run my program I receive an exception message:...
427
Stalkern 2
stalkern2
Aug 30, 2002 3:06 pm
... _1 Do you have a link-ography for Continuation Passing Style? Could you please tell the list? _2 I found on...
428
giangiammy
Sep 2, 2002 6:57 am
... Well, starting from the fibonacci example here my exercises: (* standard recursive: nothing to say *) let rec fibr n = if n < 2 then 1 else fibr(n-1) +...
429
giangiammy
Sep 2, 2002 10:15 am
... Sorry, but in my last message I forget to insert the link I spoke of : http://theory.lcs.mit.edu/~athena/hacks/pipe.ml bye Gianluca...
430
Stalkern 2
stalkern2
Sep 2, 2002 11:17 am
... OK, this is *really* senseful, it sounds like CPS, and shows that I don't know Scheme ;-) So by writing continuation as you did, e.g. something like let...
431
Ryan Tarpine
rtarpine
Sep 2, 2002 3:06 pm
All of you really piqued my interest, and made me look into CPS (which I always heard people talking about in comp.lang.functional). The best explanation I...
432
Stalkern 2
stalkern2
Sep 3, 2002 7:57 am
... Yes... in Scheme! :-( I'll try to manage it... thank you Ryan Ernesto...
433
Ryan Tarpine
rtarpine
Sep 3, 2002 1:25 pm
... Sorry about that! I wasn't thinking correctly :) As an exercise for myself, I translated all the examples to OCaml. These should run without any changes,...
434
giangiammy
Sep 3, 2002 2:03 pm
... ***how do you "linearize" a function?*** I have not a format method. Sorry. The idea is the following: line 1: define a function fibk to compute...
435
Oliver Bandel
oliver@...
Sep 3, 2002 7:55 pm
Hello, are there Examples for the labltk-library? And maybe a documentation? TIA, Oliver...
436
Oliver Bandel
oliver@...
Sep 3, 2002 9:45 pm
Hello, I often read about tail-recursiveness, and I know a littlebid about it, e.g. that tail-recursiveness mean, that a function that returns in the last...
437
Ryan Tarpine
rtarpine
Sep 3, 2002 10:57 pm
... Hi. Why did you call this question OT? ;) ... From what I understand, the last line of a function must be a direct call to another function. This way,...
438
Remi VANICAT
dl_ens
Sep 3, 2002 11:42 pm
... well, this is a tail call, a tail recursion is when the tail call is recursive call. ... [...] ... one can also write : let sum n = let rec aux n acc = if...
439
Stalkern 2
stalkern2
Sep 3, 2002 11:56 pm
Wow! Ryan's link is amazing. In short, it says that: _______________________ If you take a function for summing up 0 to n integers, let rec sum = fun n -> if...
440
Stalkern 2
stalkern2
Sep 4, 2002 12:05 am
... This is just to add that as Rémi said in a previous *great* posting, " most of the time one can transform a normal recursive function into a tail...
441
Stalkern 2
stalkern2
Sep 4, 2002 12:13 am
... An odd question: I've often seen this nick, "aux", used by French speaking programmers. Where does it come from ? I can't translate it immediately into its...
442
Remi VANICAT
dl_ens
Sep 4, 2002 2:20 am
... and I think you are wrong, it will use more place than the whole list. More precisely The closure will use 4 word, while the list use 3. In fact the main...
443
Remi VANICAT
dl_ens
Sep 4, 2002 2:29 am
... it is auxiliaire. Dict tell me : moi@debian:~/lang/ocaml/test$ dict auxiliary [...] 1. A helper; an assistant; a confederate in some action or enterprise. ...
444
Oliver Bandel
oliver@...
Sep 4, 2002 7:15 am
Hello Ryan, ... Hmhh, because it's nit language-specific and is more an algorithmic question. [...] ... [...] ... OK, then the following is *not*...
445
Stalkern 2
stalkern2
Sep 4, 2002 8:31 am
... What do you mean by "word"? I can't see this. ... OK, I see that you can measure times exactly. Are you using a timer like the one that Doug Bagley's...
446
Stalkern 2
stalkern2
Sep 4, 2002 9:48 am
... Hey, what a mess. I can't find examples about labltk, docs are missing as usual. I'm attempting to compile and run an example by Pierre Weis (a camltk...
447
Ryan Tarpine
rtarpine
Sep 4, 2002 11:41 am
... I am assuming he means words of memory? That while writing something in the CPS way does not use lots of stack space like a normal recursive function ...
448
Ryan Tarpine
rtarpine
Sep 4, 2002 12:03 pm
... Yet you won't get an important feature of OCaml if you don't know it :) Stack overflows aren't fun for anyone, plus tail recursion often makes things...
