A rookie Racket question. I\'m using Krishnamurthi\'s PLAI textbook for this one, and the associated Racket programming language.
I 开发者_JAVA百科have this lambda lambda expression : λx.(λy.(λz.x(yz))) I\'m trying to write a Scheme expression out of it.
I am a new Scheme/Racket student, so please excuse any blatant syntax errors. It came up in class today that the scheme list \'(a, b, c) should be invalid, but when we ran it, it returned:
Let\'s say that I have a list of lists in Scheme, like so: (define a-list(list (list a b) (list c d) (list e f) (list g h) (list i j)))
As it currently stands, this question is not a good fit for our Q&A format. We expect answers to be supported by facts, references,or expertise, but this question will likely solicit debate, a
I hate using SO as a way to find simple functions, but I really can\'t find a function like this anywhere:开发者_如何学JAVA
(require racket/mpair) (define (bld-mlst . args) (list->mlist args)) (define mlst-my (bld-mlst)) mlst-my
Is there a way to find out at ru开发者_Go百科ntime, how many inputs (arguments, parameters) a function has?
I\'m learning Racket (formerly PLT Scheme, a LISP dialect) and try to discover how to handle events different than paint-callback (maybe it\'s not even one).
I\'m going through The LIttle Schemer to learn Scheme (as an old C 开发者_StackOverflow社区programmer) and as an exercise I tried to write a procedure to flatten a list using only the forms in The Lit
加载中,请稍侯......