-is-it-the-most-popular-paradigm-when-everybody-seems-to-say-functional-programming-is-superior/answer/Panicz-Godek/comment/89048060
W dniu czwartek, 13 czerwca 2019 13:40:46 UTC+2 użytkownik Maciek Godek
napisał:
>
>
> W dniu niedziela, 2 czerwca 2019 01:47:20 UTC+2 użytkownik Matthias
&g
W dniu niedziela, 2 czerwca 2019 01:47:20 UTC+2 użytkownik Matthias
Felleisen napisał:
>
>
> Someone recently mentioned the “7 GUIs” task. I spent a couple of days to
> write up minimal solutions:
>
> https://github.com/mfelleisen/7GUI/blob/master/task-7.rkt
>
> In my spare time, I will
Hi Bob!
W dniu czwartek, 11 lipca 2019 03:36:32 UTC+2 użytkownik Bob Heffernan
napisał:
>
> On 19-07-10 02:46, Maciek Godek wrote:
> > A while ago, I wrote a booklet which used almost the same problem to
> > introduce to, what you called nicely in the title of this th
I hope you don't mind me adding my two cents to the discussion.
I believe that people who use Lisp tend to see the advantage of its syntax
for meta-programming.
As Richard Gabriel and Guy Steele wrote in "The Evolution of Lisp",
Algol-style syntax makes programs look less like the data
Hi,
is there any way to deploy Racket's big-bang applications to run in a
browser (or any plans to enable that feature)?
--
You received this message because you are subscribed to the Google Groups
"Racket Users" group.
To unsubscribe from this group and stop receiving emails from it, send an
Hi,
is it possible to take Racket's hash tables and sets, and make them
applicable (like in Clojure)?
So that, for example
(#hash((a . 1) (b . 2)) 'a)
would be equivalent to
(hash-ref #hash((a . 1) (b . 2)) 'a)
and
((set 1 2 3) 1)
would be equivalent to
(set-member? (set 1 2 3) 1)
--
Great, thanks!
W dniu niedziela, 8 września 2019 11:57:47 UTC+2 użytkownik ricardo.g.herdt
napisał:
>
> Hi Maciek,
>
> yes, it is. Take a look at rackjure:
>
> https://docs.racket-lang.org/rackjure/index.html#(part._dict-app)
>
> Regards,
>
> Ricardo
>
>
W dniu niedziela, 14 lipca 2019 19:44:30 UTC+2 użytkownik cwebber napisał:
>
> [...]
> - Nonetheless, assumptions that various math operators should be infix
>is understandable because that's what people see today.
>
I'd recommend to do some crawling on Racket code base to see what
W dniu wtorek, 9 lipca 2019 14:09:04 UTC+2 użytkownik Bob Heffernan napisał:
>
> Dear all,
>
> I recently wanted to count the number of primes in the sequences 2^n+3
> and 2^n-3 (and a few more besides) where n is a positive integer.
>
>
Hi!
A while ago, I wrote a booklet which used almost
9 matches
Mail list logo
