(define affiche-gagnant (lambda (j1 j2 g1 g2) (begin (display \"Le gagnant est : \") (cond ((> g1 g2) j1)
I\'m trying to use \"map\" and \"accumulating\" functions in scheme for sorting unknown amount of listing into a lists that the first will have all the first places of the olds lists and so on.
I have written a Scheme evaluator in Java that does some parallelisation tricks. It\'s not usable by anyone but me for the moment, but I\'m getting some results.
I\'d like to add all items in a vector in Scheme. I believe my problem areas are in the way I use lambda (very unsure of this expression\'s correct usage), assign the length of the vector to variable
I am writing a tiny evaluator for Scheme. I need to write the evaluator with substi开发者_开发知识库tution model, therefore no assignments like set! are to be used.
ok i have this tree: a6 /|\\ a1a2p1 /\\ a1a2 and i need some code to traverse it. in a deep-list represantati开发者_运维技巧on it\'s like this right?
I\'m quite interested in learning F#. My开发者_Python百科 only experience with functional languages has been 2 introductory courses on Scheme in college.
How can I implement an equality function in Scheme that takes 2 trees a开发者_如何学JAVAnd checks if they have both the same elements and structure?recursion from the root each of the trees
I\'m using Dr. Racket, language Pretty Big, and I\'m trying to make a simple binary search tree \"in?\" method, that will return if a value is in the binary search tree or not. It needs to be general,
For example I have two async methods (get-a 10 (lambda (a) (get-b a (lambda (b) (display b))) but I want to write something similar to
加载中,请稍侯......