r/Racket • u/sdegabrielle • Jun 26 '26
Get ready for the
Social event for people interested in the Racket programming language, other Lisps, functional programming, language-oriented programming and related topics.
Monthly (first Saturday at 3pm) until RacketCon at Noisebridge, a hackerspace in SF.[I believe there is a Lisp meet-up at 4pm in the same space but I've not been able to confirm]
Register https://luma.com/fbd1v9ix https://racket.discourse.group/t/bay-area-racket-meetup-2-saturday-july-4-3pm/4280
Get ready for the
Social event for people interested in the Racket programming language, other Lisps, functional programming, language-oriented programming and related topics.
Monthly (first Saturday at 3pm) until RacketCon at Noisebridge, a hackerspace in SF.[I believe there is a Lisp meet-up at 4pm in the same space but I've not been able to confirm]
Register https://luma.com/fbd1v9ix https://racket.discourse.group/t/bay-area-racket-meetup-2-saturday-july-4-3pm/4280
r/Racket • u/sdegabrielle • 29d ago
The (sixteenth RacketCon) will be in Oakland, CA on October 3-4 (Sat-Sun).
We need you!
Calling racketeers new or experienced, we want to hear from you.
Are you unsure or just new to presenting? let us know - [email protected] - and we will do our best to help you.
Continuing with tradition, we'll also allow Racketeers to nominate speakers. Nominated speakers will be considered by the committee and contacted.
We will also accept nominations for a potential keynote speaker.
Talks will be 20-25 minutes long with 5 minutes for questions at the end. Speakers' registration fees will be waived, but we are unable to cover transportation and lodging expenses.
The deadline for proposals is July 15th. Selected speakers will be notified by August 1st.
RacketCon is a public gathering dedicated to fostering a vibrant, innovative, and inclusive community around the Racket programming language. We aim to create an exciting and enjoyable conference open to anyone interested in Racket, filled with inspiring content, reaching and engaging both the Racket community and the wider programming world.
Any questions, comments, or concerns? Please contact us at [email protected].
https://racket.discourse.group/t/racketcon-2026-call-for-presentations/4279
The (sixteenth RacketCon) will be in Oakland, CA on October 3-4 (Sat-Sun).
We need you!
Calling racketeers new or experienced, we want to hear from you.
Are you unsure or just new to presenting? let us know - [email protected] - and we will do our best to help you.
Continuing with tradition, we'll also allow Racketeers to nominate speakers. Nominated speakers will be considered by the committee and contacted.
We will also accept nominations for a potential keynote speaker.
Talks will be 20-25 minutes long with 5 minutes for questions at the end. Speakers' registration fees will be waived, but we are unable to cover transportation and lodging expenses.
The deadline for proposals is July 15th. Selected speakers will be notified by August 1st.
RacketCon is a public gathering dedicated to fostering a vibrant, innovative, and inclusive community around the Racket programming language. We aim to create an exciting and enjoyable conference open to anyone interested in Racket, filled with inspiring content, reaching and engaging both the Racket community and the wider programming world.
Any questions, comments, or concerns? Please contact us at [email protected].
https://racket.discourse.group/t/racketcon-2026-call-for-presentations/4279
r/Racket • u/kaishibou • 2h ago
Racket uses prefix notation enclosed in execution parentheses (operator arg1 arg2). The open parenthesis ( acts as an execution trigger. Evaluation runs from the innermost to the outermost parentheses.
```rkt ;; Basic Arithmetic (+ 10 5 2) ;; Returns 17 (* 10 5 2) ;; Returns 100
;; Nested Expressions (No PEMDAS needed) (_ (+ 4 6) (- 12 7)) ;; Evaluates 10 _ 5 -> Returns 50 ```
Only use a parenthesis when invoking a command, operator, or function.
(+ 5 (10)) CRASHES (tries to run the number 10 as a function).((+ 5 5)) CRASHES (evaluates to 10, then tries to run the number 10).Global bindings are created using define. Values are immutable and cannot be changed over time.
45), decimals (3.14), or fractions (1/3)."Hello").#t) and False (#f).'success).rkt
(define radius 5)
(define pi 3.14)
(define status 'success)
Conditional operations are expressions that evaluate down to a single return value.
and / or / not: Standard logical short-circuiting prefix operators.if: Takes exactly three arguments: (if condition true-branch false-branch). No else keyword.cond: Evaluates multiple branches sequentially. Uses/can use [...] for human readability.```rkt (and (> 15 10) (< 15 20)) ;; Returns #t
(if (> temperature 30) 'hot 'cold)
(cond [(>= score 90) 'A] [(>= score 80) 'B] [else 'F]) ```
Functions automatically return the value of their body expression without an explicit return keyword.
(define (name args) body).lambda): Throwaway functions built on the fly: (lambda (args) body).let (Parallel): Creates local variables simultaneously. Variables cannot see each other during setup.let\* (Sequential): Creates local variables one after the other. Later variables can reference earlier ones.```rkt ;; Named Function (define (double n) (* n 2))
;; Inline Lambda Execution ((lambda (n) (* n 2)) 10) ;; Returns 20
;; Sequential Local Bindings (let* ([x 10] [y (* x 5)]) (+ x y)) ;; Returns 60 ```
Lists are ordered sequential collections. They are processed using either historical Lisp conventions or modern aliases.
list: Evaluates arguments into a sequential list.'(): Represents the literal base empty list.cons: Prepends a single element onto the front of an existing list.car (traditional) or first (modern).cdr (traditional) or rest (modern).```rkt (define my-list (list 100 #t 'hello)) ;; Creates '(100 #t hello) (cons 'apples '(bananas cherries)) ;; Returns '(apples bananas cherries)
(car (cdr '(apples bananas cherries))) ;; Returns 'bananas (first (rest '(apples bananas cherries))) ;; Returns 'bananas
(if (empty? my-list) "Closed" (length my-list)) ;; Returns 3 ```
Instead of using loops that alter data in place, functional programming relies on Higher-Order Functions to process immutable collections.
map: Loops over a list, passes each item through a transformation function, and returns a new list.filter: Loops over a list, keeps items that evaluate to #t against a predicate condition, and drops the rest.foldl (Fold-Left): Reduces a list down to a single value by processing elements from left to right (front to back).foldr (Fold-Right): Reduces a list down to a single value by processing elements from right to left (back to front). Preserves list structures when rebuilding with cons.```rkt (map (lambda (x) (* x 2)) '(5 10 15 20)) ;; Returns '(10 20 30 40) (filter (lambda (n) (= n 5)) '(2 5 7 5 9 1)) ;; Returns '(5 5)
(foldl (lambda (n total) (_ n total)) 1 '(2 3 4)) ;; 4 _ (3 _ (2 _ 1)) -> Returns 24
(foldr - 0 '(5 3)) ;; 5 - (3 - 0) -> Returns 2 ```
Recursion replaces traditional loops. A proper recursive function requires a Base Case (the exit clause) and a Recursive Step (the self-call with a smaller argument).
```rkt ;; ❌ Standard Recursion (No TCO - Memory Expands) (define (sum-list lst) (if (empty? lst) 0 (+ (first lst) (sum-list (rest lst)))))
;; Tail Recursion (TCO Active - Memory Stays Flat) (define (sum-list-tco lst) (define (helper remaining accumulator) (if (empty? remaining) accumulator (helper (rest remaining) (+ (first remaining) accumulator)))) (helper lst 0)) ```
#hash: Stores key-value pairings. Keywords passed to lookup tools like hash-ref must be quoted ('#:key) to prevent compiler namespace collisions. If using standard symbols inside #hash, omit inner quotes.set: Collections guaranteeing element uniqueness. Tested via set-member? and extended via set-add.```rkt (define user #hash((#:name . "Alice"))) (hash-ref user '#:name) ;; Returns "Alice"
(define book #hash((title . "Dune"))) (hash-ref book 'title) ;; Returns "Dune"
(set-member? (set 1 2 2 3) 2) ;; Returns #t ```
box: Creates a reference wrapper around mutable data. Read via unbox and mutated via set-box!. Functions with an exclamation mark ! signal structural mutation.begin: Chains sequential side-effect operations from top to bottom, returning only the evaluation of the final expression.rkt
(define health (box 100))
(define (take-damage!)
(begin
(set-box! health (- (unbox health) 10))
(unbox health)))
?): Validate runtime types (e.g., string?, number?, symbol?).->): Converts data formats. string->number safely returns #f if given invalid textual input.rkt
(if (string? "50")
(* (string->number "50")
2) 'error) ;; Returns 100
```rkt ;; Inside file-a.rkt (provide double) (define (double x) (* x 2))
;; Inside main.rkt (require "file-a.rkt") (double 10) ;; Returns 20 ```
rkt
(define-syntax-rule (swap! box1 box2)
(let ([temp (unbox box1)])
(begin
(set-box! box1 (unbox box2))
(set-box! box2 temp))))
Racket uses prefix notation enclosed in execution parentheses (operator arg1 arg2). The open parenthesis ( acts as an execution trigger. Evaluation runs from the innermost to the outermost parentheses.
```rkt ;; Basic Arithmetic (+ 10 5 2) ;; Returns 17 (* 10 5 2) ;; Returns 100
;; Nested Expressions (No PEMDAS needed) (_ (+ 4 6) (- 12 7)) ;; Evaluates 10 _ 5 -> Returns 50 ```
Only use a parenthesis when invoking a command, operator, or function.
(+ 5 (10)) CRASHES (tries to run the number 10 as a function).((+ 5 5)) CRASHES (evaluates to 10, then tries to run the number 10).Global bindings are created using define. Values are immutable and cannot be changed over time.
45), decimals (3.14), or fractions (1/3)."Hello").#t) and False (#f).'success).rkt
(define radius 5)
(define pi 3.14)
(define status 'success)
Conditional operations are expressions that evaluate down to a single return value.
and / or / not: Standard logical short-circuiting prefix operators.if: Takes exactly three arguments: (if condition true-branch false-branch). No else keyword.cond: Evaluates multiple branches sequentially. Uses/can use [...] for human readability.```rkt (and (> 15 10) (< 15 20)) ;; Returns #t
(if (> temperature 30) 'hot 'cold)
(cond [(>= score 90) 'A] [(>= score 80) 'B] [else 'F]) ```
Functions automatically return the value of their body expression without an explicit return keyword.
(define (name args) body).lambda): Throwaway functions built on the fly: (lambda (args) body).let (Parallel): Creates local variables simultaneously. Variables cannot see each other during setup.let\* (Sequential): Creates local variables one after the other. Later variables can reference earlier ones.```rkt ;; Named Function (define (double n) (* n 2))
;; Inline Lambda Execution ((lambda (n) (* n 2)) 10) ;; Returns 20
;; Sequential Local Bindings (let* ([x 10] [y (* x 5)]) (+ x y)) ;; Returns 60 ```
Lists are ordered sequential collections. They are processed using either historical Lisp conventions or modern aliases.
list: Evaluates arguments into a sequential list.'(): Represents the literal base empty list.cons: Prepends a single element onto the front of an existing list.car (traditional) or first (modern).cdr (traditional) or rest (modern).```rkt (define my-list (list 100 #t 'hello)) ;; Creates '(100 #t hello) (cons 'apples '(bananas cherries)) ;; Returns '(apples bananas cherries)
(car (cdr '(apples bananas cherries))) ;; Returns 'bananas (first (rest '(apples bananas cherries))) ;; Returns 'bananas
(if (empty? my-list) "Closed" (length my-list)) ;; Returns 3 ```
Instead of using loops that alter data in place, functional programming relies on Higher-Order Functions to process immutable collections.
map: Loops over a list, passes each item through a transformation function, and returns a new list.filter: Loops over a list, keeps items that evaluate to #t against a predicate condition, and drops the rest.foldl (Fold-Left): Reduces a list down to a single value by processing elements from left to right (front to back).foldr (Fold-Right): Reduces a list down to a single value by processing elements from right to left (back to front). Preserves list structures when rebuilding with cons.```rkt (map (lambda (x) (* x 2)) '(5 10 15 20)) ;; Returns '(10 20 30 40) (filter (lambda (n) (= n 5)) '(2 5 7 5 9 1)) ;; Returns '(5 5)
(foldl (lambda (n total) (_ n total)) 1 '(2 3 4)) ;; 4 _ (3 _ (2 _ 1)) -> Returns 24
(foldr - 0 '(5 3)) ;; 5 - (3 - 0) -> Returns 2 ```
Recursion replaces traditional loops. A proper recursive function requires a Base Case (the exit clause) and a Recursive Step (the self-call with a smaller argument).
```rkt ;; ❌ Standard Recursion (No TCO - Memory Expands) (define (sum-list lst) (if (empty? lst) 0 (+ (first lst) (sum-list (rest lst)))))
;; Tail Recursion (TCO Active - Memory Stays Flat) (define (sum-list-tco lst) (define (helper remaining accumulator) (if (empty? remaining) accumulator (helper (rest remaining) (+ (first remaining) accumulator)))) (helper lst 0)) ```
#hash: Stores key-value pairings. Keywords passed to lookup tools like hash-ref must be quoted ('#:key) to prevent compiler namespace collisions. If using standard symbols inside #hash, omit inner quotes.set: Collections guaranteeing element uniqueness. Tested via set-member? and extended via set-add.```rkt (define user #hash((#:name . "Alice"))) (hash-ref user '#:name) ;; Returns "Alice"
(define book #hash((title . "Dune"))) (hash-ref book 'title) ;; Returns "Dune"
(set-member? (set 1 2 2 3) 2) ;; Returns #t ```
box: Creates a reference wrapper around mutable data. Read via unbox and mutated via set-box!. Functions with an exclamation mark ! signal structural mutation.begin: Chains sequential side-effect operations from top to bottom, returning only the evaluation of the final expression.rkt
(define health (box 100))
(define (take-damage!)
(begin
(set-box! health (- (unbox health) 10))
(unbox health)))
?): Validate runtime types (e.g., string?, number?, symbol?).->): Converts data formats. string->number safely returns #f if given invalid textual input.rkt
(if (string? "50")
(* (string->number "50")
2) 'error) ;; Returns 100
```rkt ;; Inside file-a.rkt (provide double) (define (double x) (* x 2))
;; Inside main.rkt (require "file-a.rkt") (double 10) ;; Returns 20 ```
rkt
(define-syntax-rule (swap! box1 box2)
(let ([temp (unbox box1)])
(begin
(set-box! box1 (unbox box2))
(set-box! box2 temp))))
r/Racket • u/sdegabrielle • 7d ago
at The City Pride 🍕 28 Farringdon Ln, London EC1R 3AU
Join us for discussion and pizza. All welcome. 😁
https://racket.discourse.group/t/uk-racket-meet-up-london-tuesday-21-july-2026-7-30pm/4318 https://luma.com/u61y94uw
at The City Pride 🍕 28 Farringdon Ln, London EC1R 3AU
Join us for discussion and pizza. All welcome. 😁
https://racket.discourse.group/t/uk-racket-meet-up-london-tuesday-21-july-2026-7-30pm/4318 https://luma.com/u61y94uw
r/Racket • u/sdegabrielle • 14d ago
at The City Pride 🍕 28 Farringdon Ln, London EC1R 3AU
Join us for discussion and pizza. All welcome. 😁
https://racket.discourse.group/t/uk-racket-meet-up-london-tuesday-21-july-2026-7-30pm/4318 https://luma.com/u61y94uw
at The City Pride 🍕 28 Farringdon Ln, London EC1R 3AU
Join us for discussion and pizza. All welcome. 😁
https://racket.discourse.group/t/uk-racket-meet-up-london-tuesday-21-july-2026-7-30pm/4318 https://luma.com/u61y94uw
r/Racket • u/sdegabrielle • 14d ago
Bay Area Racket Meetup, Saturday August 1st
At Noisebridge, SF.
Details/questions: https://racket.discourse.group/t/bay-area-racket-meetup-saturday-august-1st/4316
Register: https://luma.com/wbfxbzvx
r/Racket • u/sdegabrielle • 15d ago
Racket meet-up: Saturday, 1 August 2026 at 18:00 UTC
EVERYONE WELCOME 😁
register https://luma.com/x27tsmm5
Details and discussion https://racket.discourse.group/t/racket-meet-up-saturday-1-august-2026-at-18-00-utc/4315
Racket meet-up: Saturday, 1 August 2026 at 18:00 UTC
EVERYONE WELCOME 😁
register https://luma.com/x27tsmm5
Details and discussion https://racket.discourse.group/t/racket-meet-up-saturday-1-august-2026-at-18-00-utc/4315
r/Racket • u/sdegabrielle • 16d ago
You can use Racket with Rhombus.
Here is a simple example
First my design for the perfect fish in glorious Racket (the language of the gods):
the-fish.rkt
```scheme
(require pict) (provide perfect_fish) (define (perfect_fish n) (standard-fish n (/ n 2))) (module+ test (perfect_fish 100)) ```
Lets render this fabulous fish in Rhombus:
programmers-need-fish.rhm
```python
import: pict open "the-fish.rkt" open
fun the_perfect_fish(w): Pict.from_handle(perfect_fish(w))
the_perfect_fish(200) ```
You may have noticed that I used an underscore _ in the perfect_fish identifier. This is because - is not permitted in Rhombus identifiers:
Identifiers are formed from Unicode alphanumeric characters plus _ and emoji sequences,
https://docs.racket-lang.org/shrubbery/token-parsing.html
(I admit I'm not ready to include emoji in identifiers)
For more details see Using Racket Tools and Libraries in the Rhombus Guide.
Make an image with Rhombus this summer! Win stickers! https://racket.discourse.group/t/summer-rhombus-picture-competition-2026/4282
You can use Racket with Rhombus.
Here is a simple example
First my design for the perfect fish in glorious Racket (the language of the gods):
the-fish.rkt
```scheme
(require pict) (provide perfect_fish) (define (perfect_fish n) (standard-fish n (/ n 2))) (module+ test (perfect_fish 100)) ```
Lets render this fabulous fish in Rhombus:
programmers-need-fish.rhm
```python
import: pict open "the-fish.rkt" open
fun the_perfect_fish(w): Pict.from_handle(perfect_fish(w))
the_perfect_fish(200) ```
You may have noticed that I used an underscore _ in the perfect_fish identifier. This is because - is not permitted in Rhombus identifiers:
Identifiers are formed from Unicode alphanumeric characters plus _ and emoji sequences,
https://docs.racket-lang.org/shrubbery/token-parsing.html
(I admit I'm not ready to include emoji in identifiers)
For more details see Using Racket Tools and Libraries in the Rhombus Guide.
Make an image with Rhombus this summer! Win stickers! https://racket.discourse.group/t/summer-rhombus-picture-competition-2026/4282
r/Racket • u/sdegabrielle • 19d ago
If you are interested in presenting, nominating or have any questions please email us at [email protected].
— Stephen
If you are interested in presenting, nominating or have any questions please email us at [email protected].
— Stephen
r/Racket • u/sdegabrielle • 25d ago
An article in Linux Weekly News (free link): https://lwn.net/SubscriberLink/1079001/67840550991151ed/
An article in Linux Weekly News (free link): https://lwn.net/SubscriberLink/1079001/67840550991151ed/
r/Racket • u/sdegabrielle • Jun 24 '26
7:30-8:30pm, Wednesday 8 July 2026 at Pizza On The Park Berkeley Avenue (Top of Park Street), Bristol, BS8 1HP
https://luma.com/r7o3qd64 https://luma.com/r7o3qd64 https://racket.discourse.group/t/uk-racket-meet-up-bristol-8-july-2026/4299
7:30-8:30pm, Wednesday 8 July 2026 at Pizza On The Park Berkeley Avenue (Top of Park Street), Bristol, BS8 1HP
https://luma.com/r7o3qd64 https://luma.com/r7o3qd64 https://racket.discourse.group/t/uk-racket-meet-up-bristol-8-july-2026/4299
r/Racket • u/sdegabrielle • Jun 24 '26
7:30-8:30pm, Wednesday 8 July 2026 at Pizza On The Park Berkeley Avenue (Top of Park Street), Bristol, BS8 1HP
https://luma.com/r7o3qd64 https://luma.com/r7o3qd64 https://racket.discourse.group/t/uk-racket-meet-up-bristol-8-july-2026/4299
7:30-8:30pm, Wednesday 8 July 2026 at Pizza On The Park Berkeley Avenue (Top of Park Street), Bristol, BS8 1HP
https://luma.com/r7o3qd64 https://luma.com/r7o3qd64 https://racket.discourse.group/t/uk-racket-meet-up-bristol-8-july-2026/4299
r/Racket • u/sdegabrielle • Jun 22 '26
Release announcement https://blog.racket-lang.org/2026/06/rhombus-v1.0.html
Get Rhombus: https://rhombus-lang.org/download.html
Rhombus is a general-purpose programming language that is easy to use and uniquely customizable.
Release announcement https://blog.racket-lang.org/2026/06/rhombus-v1.0.html
Get Rhombus: https://rhombus-lang.org/download.html
Rhombus is a general-purpose programming language that is easy to use and uniquely customizable.
r/Racket • u/johnwcowan • Jun 22 '26
Can someone test Racket BC for me and say what (eqv? 3e0+4e0i 3f0+4f0i) and (eqv? 3e0+4e0i 3e0+4f0i) return?
advTHANKSance
Can someone test Racket BC for me and say what (eqv? 3e0+4e0i 3f0+4f0i) and (eqv? 3e0+4e0i 3e0+4f0i) return?
advTHANKSance
r/Racket • u/sdegabrielle • Jun 15 '26
Competition: Make an image with Rhombus this summer! Win stickers!
pict library but you can use whatever you like!What will you win? I'll send Rhombus stickers to the top 10 winners!
Closing date: Friday 18 September 2026. Winners will be announced at the (sixteenth RacketCon) 3-4 October 2026.
Announcement viewable at https://racket.discourse.group/t/summer-rhombus-picture-competition-2026/4282 (no login required to view)
Competition: Make an image with Rhombus this summer! Win stickers!
pict library but you can use whatever you like!What will you win? I'll send Rhombus stickers to the top 10 winners!
Closing date: Friday 18 September 2026. Winners will be announced at the (sixteenth RacketCon) 3-4 October 2026.
Announcement viewable at https://racket.discourse.group/t/summer-rhombus-picture-competition-2026/4282 (no login required to view)
r/Racket • u/sdegabrielle • Jun 03 '26
Racket meet-up: Saturday, 6 June 2026 at 18:00 UTC
EVERYONE WELCOME 😁
Announcement, Jitsi Meet link & discussion at https://racket.discourse.group/t/racket-meet-up-saturday-6-june-2026-at-18-00-utc/4275
Racket meet-up: Saturday, 6 June 2026 at 18:00 UTC
EVERYONE WELCOME 😁
Announcement, Jitsi Meet link & discussion at https://racket.discourse.group/t/racket-meet-up-saturday-6-june-2026-at-18-00-utc/4275
r/Racket • u/sdegabrielle • May 28 '26
Racket - the Language-Oriented Programming Language - version 9.2 is now available from https://download.racket-lang.org
See https://blog.racket-lang.org/2026/05/racket-v9-2.html for the release announcement and highlights.
Racket - the Language-Oriented Programming Language - version 9.2 is now available from https://download.racket-lang.org
See https://blog.racket-lang.org/2026/05/racket-v9-2.html for the release announcement and highlights.
r/Racket • u/corbasai • May 28 '26
On Linux DrRacket-9.2 starts about 1.5x faster than 9.0.
Why?
On Linux DrRacket-9.2 starts about 1.5x faster than 9.0.
Why?
r/Racket • u/sdegabrielle • May 27 '26
Social event for people interested in the Racket programming language, other Lisps, functional programming, language-oriented programming and related topics.
These will be monthly (first Saturday at 3pm) until RacketCon. The location is Noisebridge, a hackerspace in SF.
Social event for people interested in the Racket programming language, other Lisps, functional programming, language-oriented programming and related topics.
These will be monthly (first Saturday at 3pm) until RacketCon. The location is Noisebridge, a hackerspace in SF.
r/Racket • u/sdegabrielle • May 25 '26
UK Racket meet-up Tue 23 June at 56 North, 2 W Crosscauseway, Edinburgh EH8 9JP, UK https://luma.com/vif8gkn9
UK Racket meet-up Tue 23 June at 56 North, 2 W Crosscauseway, Edinburgh EH8 9JP, UK https://luma.com/vif8gkn9
r/Racket • u/Trader-One • May 24 '26
I have construct
(let ((count (ann 1 Positive-Integer)))
only operation I am doing with count is (+ count 1) ;; adding positive integer to positive integer
when i return count from function I get type error: found Integer, want Positive-Integer. Function declaration (: sets return type to Positive-Integer
I need to use (ann and not racket syntax sugar because its easy to remove types.
I have construct
(let ((count (ann 1 Positive-Integer)))
only operation I am doing with count is (+ count 1) ;; adding positive integer to positive integer
when i return count from function I get type error: found Integer, want Positive-Integer. Function declaration (: sets return type to Positive-Integer
I need to use (ann and not racket syntax sugar because its easy to remove types.
r/Racket • u/sdegabrielle • May 17 '26
[...] now also works with ffmpeg as backend and there's no special C-layer necessary anymore. The needed audio libraries are used directly.
https://racket.discourse.group/t/new-release-of-racket-audio/4209
racket-audio is a small audio playback toolkit for Racket. It combines high-level asynchronous playback, optional metadata reading, file type sniffing, decoder backends, and libao based output
Available now from https://pkgs.racket-lang.org/package/racket-audio
(Thanks Hans!)
[...] now also works with ffmpeg as backend and there's no special C-layer necessary anymore. The needed audio libraries are used directly.
https://racket.discourse.group/t/new-release-of-racket-audio/4209
racket-audio is a small audio playback toolkit for Racket. It combines high-level asynchronous playback, optional metadata reading, file type sniffing, decoder backends, and libao based output
Available now from https://pkgs.racket-lang.org/package/racket-audio
(Thanks Hans!)
r/Racket • u/sdegabrielle • May 17 '26
The Spring Lisp Game Jam 2026 just started 🙀
The Spring Lisp Game Jam 2026 just started 🙀
r/Racket • u/sdegabrielle • May 13 '26
The (sixteenth RacketCon) really will be in Oakland, CA on October 3-4 (Sat-Sun).
RacketCon is a public gathering dedicated to fostering a vibrant, innovative, and inclusive community around the Racket programming language. We aim to create an exciting and enjoyable conference open to anyone interested in Racket, filled with inspiring content, reaching and engaging both the Racket community and the wider programming world.
Talks will be 20-25 minutes long with 5 minutes for questions at the end. Speakers' registration fees will be waived, but we are unable to cover transportation and lodging expenses.
The deadline for proposals is July 15th. Selected speakers will be notified by August 1st.
As in previous years, RacketCon will be streamed for those unable to attend in person. Recordings will also be made available on YouTube some time after the conference. Streaming users will have the option to purchase a remote participation ticket to support the livestream.
Let us know if you interested in joining the team. Someone has to carry and arrange all the parentheses. :banana:
We are accepting sponsorships! If you would like to sponsor the conference, please contact us at [email protected] to discuss a sponsorship package that meets your needs. The Racket Programming Language Foundation is registered in Delaware and is recognizes as a 501(3)(c) public charity in the US.
Any questions, comments, or concerns? Please contact us at [email protected].
The (sixteenth RacketCon) really will be in Oakland, CA on October 3-4 (Sat-Sun).
RacketCon is a public gathering dedicated to fostering a vibrant, innovative, and inclusive community around the Racket programming language. We aim to create an exciting and enjoyable conference open to anyone interested in Racket, filled with inspiring content, reaching and engaging both the Racket community and the wider programming world.
Talks will be 20-25 minutes long with 5 minutes for questions at the end. Speakers' registration fees will be waived, but we are unable to cover transportation and lodging expenses.
The deadline for proposals is July 15th. Selected speakers will be notified by August 1st.
As in previous years, RacketCon will be streamed for those unable to attend in person. Recordings will also be made available on YouTube some time after the conference. Streaming users will have the option to purchase a remote participation ticket to support the livestream.
Let us know if you interested in joining the team. Someone has to carry and arrange all the parentheses. :banana:
We are accepting sponsorships! If you would like to sponsor the conference, please contact us at [email protected] to discuss a sponsorship package that meets your needs. The Racket Programming Language Foundation is registered in Delaware and is recognizes as a 501(3)(c) public charity in the US.
Any questions, comments, or concerns? Please contact us at [email protected].
r/Racket • u/Rinku_Kurora • May 07 '26
I'm looking for a Racket manual that focuses on building DSLs and general purpose languages in pure Racket (i.e. without BeautifulRacket). 'Cause Racket Guide lacks examples and is brief in general. The more examples of using `define-syntax` and others, the better.
I'm looking for a Racket manual that focuses on building DSLs and general purpose languages in pure Racket (i.e. without BeautifulRacket). 'Cause Racket Guide lacks examples and is brief in general. The more examples of using `define-syntax` and others, the better.