Scheme is a functional programming language in the Lisp family, closely modeled on lambda calculus with eager (applicative order) evaluation.
This is trivial implement of course, but I feel there is certainly something built in to Racket that does this. …
lisp scheme racketOn this site they say there are 10 LISP primitives. The primitives are: atom, quote, eq, car, cdr, cons, cond, lambda, …
clojure lisp scheme common-lisp primitiveI am planning on learning Scheme (by following SICP) and afterwards doing a project with this language. However, I was …
ide lisp schemeI come across the word 'thunk' at a lot of places in code and documentation related to Scheme, and similar …
programming-languages functional-programming schemeI am just trying to do very simple code with set-car! and set-cdr! in racket, but I got the error: …
scheme racketI'm in a Scheme class and I was curious about writing a recursive function without using define. The main problem, …
recursion lambda scheme anonymous-recursionI know that Lisp and Scheme programmers usually say that eval should be avoided unless strictly necessary. I’ve seen …
clojure scheme lisp common-lisp evalso here is the code: (define (time-prime-test n) (newline) (display n) (start-prime-test n (runtime))) (define (start-prime-test n start-time) (if (prime? …
recursion if-statement scheme racketI'm studying for a Christmas test and doing some sample exam questions, I've come across this one that has me …
recursion scheme tail-recursion