(define (minim lst) (COND ((NULL? (CDR lst)) 开发者_C百科(CAR lst)) (< (CAR lst) (minim (CDR lst)) (CAR lst))
I\'m trying to create a scheme function wh开发者_如何学Goich given two lists L1 and L2, will remove any items present in L2 from L1.
I have now seen several projects ending at a point where the actual configuration depended on things only available at run-time.
I\'ve been trying this question for a long time but am not getting very far with it. The question is asking to produce a string where all the repeated characters from the inputed string are replaced b
In Python\'s interactive shell you can get a list of built-in functions (if you know where to look) using the dir command.
I am trying to finish a finite state machine in Scheme. The problem is, that I am not sure how to tell it what characters it should test. If I want to test a String \"abc112\" then how do I do that?
I want to solve a problem in Scheme (R5RS). Here\'s my sample data: (define zipcodes \'( (96774 ookala hawaii)
I am trying to make little human like text searching program in scheme but this program doesn\'t work properly time to time
in scheme, there is \"hello hellu-#\\\"hella.helloo,hallo#\\return#\\\"\" string I want to list them as (\"hello\" \"hellu\" \"h开发者_C百科ella\" \"helloo\" \"hallo\")
I\'m running the latest downloadable mac version of Fluxus from the official site. 开发者_运维技巧When I do
加载中,请稍侯......