soegaard

26 ms·

1. 331.▲
   by soegaard 6y ago

   https://www.researchgate.net/publication/221241381_Scribble_...
2. 332.▲
   by soegaard 6y ago

   Racket.
3. 333.▲
   by soegaard 6y ago

   Are you using Racket BC or CS?
4. 334.▲
   by soegaard 6y ago

   Running Racket BC on iOS https://defn.io/2020/01/05/racket-on-ios/
5. 335.▲
   by soegaard 6y ago

   Are those actually used in the book? But if needed, the user can write: (define (1+ x) (+ x 1)) (define (1- x) (- x 1)) Although, I think, add1 and sub1 are more common nowadays.
6. 336.▲
   by soegaard 6y ago

   It's answered here: https://stackoverflow.com/q/49912204/23567
7. 337.▲
   by soegaard 6y ago

   Probably this one. See "Movies as Programs" here for an introduction. https://www.youtube.com/watch?v=OZXslNVaCOQ
8. 338.▲
   by soegaard 6y ago

   No worries on that front: https://www.amarisoft.com/about-us/
9. 339.▲
   by soegaard 6y ago

   Still in the brain storm phase.
10. 340.▲
    by soegaard 6y ago

    Yes. https://github.com/racket/racket/wiki/Organizations-using-Ra... Besides of course all the Racket pages/systems (home page, package system, continuous integration system etc). E-commerce is also poss
11. 341.▲
    by soegaard 6y ago

    Is this the inspiration for the Donald Duck story "Lost in the Andes" where the hens lay square eggs. Google: donald duck square eggs
12. 342.▲
    by soegaard 6y ago

    Check 1.3 and 1.4 at https://school.racket-lang.org/2019/plan/mon-mor-lecture.htm... to get an idea.
13. 343.▲
    by soegaard 6y ago

    The Racket distribution comes with several languages. You were probably using the socalled teaching languages, which are small subsets of real Racket. Using a subset of the real language allows better and more beginner friendly error messag
14. 344.▲
    Space Invaders – Alex Harsányi(alex-hhh.github.io)

    4 points by soegaard 6y ago|1 comments
15. 345.▲
    by soegaard 6y ago

    I agree that Racket parameters work very well. FWIW the Racket parameters are inspired by: "Processes vs. User-Level Threads in SCSH" by Martin Gasbichler and Michael Sperber https://www.researchgate.net/publicatio
16. 346.▲
    by soegaard 6y ago

    Just tested and `(require foo)` works fine in `#lang eopl`. That is, if you define `define-macro` and put it in package, say, `eopl1`, then you can use #lang eopl (require eopl1)
17. 347.▲
    by soegaard 6y ago

    You need it for graphics (and the ulas).
18. 348.▲
    Automating Tests for the Plot Package – Alex Harsányi(alex-hhh.github.io)

    1 points by soegaard 6y ago|0 comments
19. 349.▲
    by soegaard 6y ago

    Use https://racket-stories.com to find old Racket stories.
20. 350.▲
    by soegaard 6y ago

    https://defn.io/2020/01/05/racket-on-ios/
21. 351.▲
    Racket News – Issue 35(racket-news.com)

    2 points by soegaard 6y ago|0 comments
22. 352.▲
    Racket News Issue 34(racket-news.com)

    2 points by soegaard 6y ago|0 comments
23. 353.▲
    Implementing Ishido, a game from the 90s, using the Racket graphical facilities(alex-hhh.github.io)

    45 points by soegaard 6y ago|3 comments
24. 354.▲
    by soegaard 6y ago

    I think we agree: an implementation that uses a stack to make normal calls fast, needs to move/copy the stack to the heap, when the stack runs out (or when a continuation is captured). I don't know whether Chez still uses the same
25. 355.▲
    by soegaard 6y ago

    I agree that some Scheme implementations have the same guarantee - it's not in the Scheme standard though (as far as I know), which makes it difficult to rely on, if you are programming to the spec. It is difficult to use the machine s
26. 356.▲
    by soegaard 6y ago

    Have you checked the new features recently? https://www.racket-mode.com/
27. 357.▲
    by soegaard 6y ago

    There is a difference between Racket and Scheme. In Racket you will never get a stack overflow. You can of course exhaust memory, if you allocate too much, but the stack is guaranteed not to overflow. > At the same time, recursion
28. 358.▲
    by soegaard 6y ago

    FWIW there is of course pattern matching in Racket. The program is practically identical to the Haskell version. (define (concast as bs) (match as ['() bs] [(cons a as) (cons a (concat as bs)
29. 359.▲
    by soegaard 7y ago

    Generating HTML is a common task. Over the years we have seen multiple approaches in the Racket community. Representing HTML as S-expressions is common. There is even two approaches in use `xexprs` and `sxml`. There are other solutions, suc
30. 360.▲
    by soegaard 7y ago

    X-expressions (as [1]) is simply a subset of S-expressions. [1] https://docs.racket-lang.org/teachpack/2htdpbatch-io.html?q=...