I'm using VSCode as my racket IDE, and while all the code compiles, none of the indentation features work. I've installed a variety of racket extensions (Magic Racket and such), so the code is al...

Im trying to write a simple scheme function that returns the last element of a list. My function looks like it should work, but I managed to fail on something: (define (last_element l)( (cond (nu...

I am trying to use unit-tests with Racket. Usually, I am successful and I really like rackunit. However, I am having trouble with this specific case. The function to be tested outputs two values....

Does Scheme or do any dialects of scheme have a kind of "self" operator so that anonymous lambdas can recur on themselves without doing something like a Y-combinator or being named in a letrec etc....

I'm having no luck finding a way to have this work the way I'd like it to, so if anyone could help that would be so greatly appreciated. What I'd like is to be able to do this on Terminal: > r...

So I have to remove the last element of a list in scheme. For example, let's say I have a list (1 2 3 4). I need to return: (1 2 3) My idea: reverse(list) car(list) reverse(list) Is there a ...

Is there any way of adding sections to an already-linked executable? I'm trying to code-sign an OS X executable, based on the Apple instructions. These include the instruction to create a suitable...

I'm trying to use the json package in Typed Racket, but I'm having some trouble handling how to type the jsexpr? predicate. My first attempt was simply using #:opaque. (require/typed json [#:opaq...

I am just trying to do very simple code with set-car! and set-cdr! in racket, but I got the error: expand: unbound identifier in module in: set-car! and expand: unbound identifier in module in: set...

Okay, I am new with scheme/racket/lisp. I am practicing creating my own functions, syntax, and recursion, so I want to make my own foldl and foldr functions that do exactly what the predefined vers...

I want to map a function over the values in a hash table, like so: (hash-map add1 (hash "apple" 1 "pear" 2)) => #hash(("apple" . 2) ("pear" . 3)) Is there a library function to do this? It'd ...

I've started learning Scheme, for fun mostly, and because I've never used a functional language before. I chose Scheme because I wanted to read SICP for a long time. Anyway, I'm currently learning...

According to SICP section 1.2.6, exercise 1.22: Most Lisp implementations include a primitive called runtime that returns an integer that specifies the amount of time the system has been running...

I am studying the language racket and trying to grasp what call/cc is actually for. Could someone please explain it in simple words and give an example or two? Thanks.

Need to write a to-string function that accepts integer and string. (to-string 3) ; -> "3" (to-string "hello") ; -> "\"hello\"" (to-string "hel\"lo") ; -> "\"hel\\\"lo\"" I managed to d...

Example: How to convert list: '(0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15) Into list of lists: '((0 1 2 3) (4 5 6 7) (8 9 10 11) (12 13 14 15)) Based on answers provided here so far, this is what...

For the love of the almighty I have yet to understand the purpose of the symbol 'iamasymbol. I understand numbers, booleans, strings... variables. But symbols are just too much for my little impera...

I got a list of lists in racket and have to transpose them. (: transpose ((list-of(list-of %a)) -> (list-of (list-of %a)))) (check-expect (transpose (list (list 1 2 3) (list 4 5 6))) (list (...

I'm trying to reverse a list, here's my code: (define (reverse list) (if (null? list) list (list (reverse (cdr list)) (car list)))) so if i enter (reverse '(1 2 3 4)), I want it to come out ...

It’s common for explanations of continuations to say that a continuation represents the “rest of the program” (or similar phrasing). But there’s plainly a boundary at which the continuation stops c...

I am going through SICP as a self-study and am on the picture language section in Chapter 2. I have been using DrRacket for the earlier exercises, but I get compilation errors when trying to do an ...

I am currently learning miniKanren by The Reasoned Schemer and Racket. I have three versions of minikanren implementation: The Reasoned Schemer, First Edition (MIT Press, 2005). I called it TRS1 h...

I started to study Scheme and I do not understand some of it. I'm using DrRacket. I wrote the following code: (define mult_mat (λ (A B) (Trans_Mat (map (λ (x) (mul_Mat_vec A x)) (Trans_Mat B))...

What's the best way to read input from stdin in racket? In particular I'd like something like cin from c++ or scanf from c where I specify the types of things I want read and they are returned.

Given two lists, return a list whose elements are lists of size two, such that for the i-th list, the first element is the i-th element of the first original list, and the second element is the i-t...