All Questions
5 questions
0
votes
1
answer
820
views
Two dimensional matrix-like data type using lists and/or mutable lists
I am trying to think of an implementation of a two dimensional matrix-like data type.
Normally I would take an array of arrays but I'm bound to a relatively low language level which only provides ...
- 162
3
votes
0
answers
550
views
Abstract List Functions in Racket/Scheme
I'm completely stuck on a problem to write a function that does NOT use recursion, locals, or lambda. Only abstract list functions can be used.
The function must input a list of positive integers, ...
- 31
1
vote
1
answer
186
views
Why is (f . l) not allowed and equal to (apply f l)?
In scheme when defined
(define f (lambda (a b c d) d))
(define l (list 'a 'b 'c 'd))
Why it does not do argument destructuring? I mean arguments should evaluate first, why destructuring is not part ...
- 113
3
votes
3
answers
2k
views
If Scheme is untyped, how can it have numbers and lists?
Scheme is said to be just an extension of the Untyped Lambda Calculus (correct me if I am wrong). If that is the case, how can it have Lists and Numbers? Those, to me, look like 2 base types. So I'd ...
- 5,850
4
votes
1
answer
465
views
Why does DrRacket IDE considers some identifiers as "symbols" and some as "keywords"? What is the difference?
Why does DrRacket (kind of Scheme) IDE highlights some of the identifiers as "keywords" (for example define, lambda, send*), and the others as "symbols" (user defined identifiers, +, -, abs, send, ...
- 942