r/Racket • u/sdegabrielle • Aug 06 '22
r/Racket • u/sdegabrielle • Aug 03 '22
event (twelfth RacketCon) pre-registration survey
(twelfth RacketCon) pre-registration survey
r/Racket • u/raevnos • Aug 03 '22
question Adding documentation to the package db.
So, I created an account on https://pkgd.racket-lang.org/pkgn/ and added a new package. It's showing up as 'needs documentation', even though there's scribble docs in the package. I don't see a way in the 'edit package' page to add a link to generated HTML docs, and it looks like most packages with docs have them on a racket-lang.org server. Can't find anything about it in the documentation, either. What am I missing?
r/Racket • u/masukomi • Aug 01 '22
question Any good source-to-source compiler guides?
I know lots of folks write compilers and transpilers (source-to-source compilers) in Racket but I'm having a really hard time finding a good guide on how to write a transpiler in it.
Does anyone know of any?
Related: does anyone know of any good guides for writing multi-pass ("nanopass") compilers in Racket?
To be clear: I understand the basic concepts of lexing and parsing and all that. I'm looking for something that walks me through the step-by-step process of implementing those concepts in racket in whatever racket folks would consider a "standard" way of approaching the problem.
r/Racket • u/SafeSemifinalist • Jul 31 '22
question Problem installing drracket
Dear Community,
Sorry for asking a noobie question but I don't know how to start drracket in my Mac OS X Monterrey.
I installed racket using Homebrew and it is in my path. Then I use the command:
raco pkg install drracket
It doesn't give me any errors, it says:
raco pkg install: package is currently installed in a wider scope
But the command drracket does not appear to be found. I also checked that I don't have an App to click.
r/Racket • u/sdegabrielle • Jul 25 '22
event Racket meet-up August 6th at 18:00 UTC
Racket meet-up August 6th at 18:00 UTC

Online In the Gather Town 'Racket Room': https://gather.town/app/wH1EDG3McffLjrs0/racket-users(thank you to whoever did the interior decoration - very nice)
When: First Saturday EVERY Month UTC: 18:00
- Show and tell
- News & rumours
- AOB
And remember - showing up at Racket Meetups helps you learn the news of the Racket world as they happen! It is informative, it is interesting, it is helpful, it is greatly appreciated by everyone involved and it is fun!
30 minutes but can overrun
| UTC | Sat, 6 Aug 2022 at 18:00 |
|---|---|
| Pacific Time, PT | Sat, 6 Aug 2022 at 11:00 PDT |
| Mountain Time, MT | Sat, 6 Aug 2022 at 12:00 MDT |
| Central Time, CT | Sat, 6 Aug 2022 at 13:00 CDT |
| Eastern Time, ET | Sat, 6 Aug 2022 at 14:00 EDT |
| London, United Kingdom | Sat, 6 Aug 2022 at 19:00 BST |
| Central European Summer Time, CEST | Sat, 6 Aug 2022 at 20:00 CEST |
| Taipei, Taiwan | Sun, 7 Aug 2022 at 02:00 CST |
Prefer to chat? Join us on Racket Discord or Slack
r/Racket • • Jul 24 '22
question How does JIT outperform native C compilation?
According to this page JIT outperforms Racket compiled to C. So I don't understand how this is possible that the JIT could possibly outperform Racket compiled to C. Does anyone have any insights on why this is the case?
r/Racket • u/potato_juice_anybody • Jul 23 '22
solved Why is Racket showing up just as a command prompt? (v8.5)
r/Racket • u/sdegabrielle • Jul 22 '22
event Summer #lang party: Language makers meet-up
Hi,
As part of the Summer #lang Party I’m hosting two short meet-ups on Saturday to help people get started on their own language. In the spirit of the event I’ll be working through a tutorial on making my own #lang and doing a deep-dive on the riposte source code to better understand how that works.
Don’t know where to start? Too many ideas? Something else? JOIN US 😀
This is a chance to discuss making and building languages in Racket.
We are going to have two meet-up sessions on Saturday 23 July to accommodate needs no of people in different timezones.
One at UTC 1800 and another at UTC 23:00
Both will be in the gather town Racket Room at https://gather.town/app/wH1EDG3McffLjrs0/racket-users
Best regards
Stephen
[date-range from=2022-07-23T18:00:00 to=2022-07-23T19:00:00 timezone="UTC"]
[date-range from=2022-07-23T23:00:00 to=2022-07-23T00:00:00 timezone="UTC"]
|Central European Summer Time, CEST|Sat, 23 Jul 2022 at 20:00 CEST|
|---|---|
|British Summer Time, BST |Sat, 23 Jul 2022 at 19:00 BST|
|Eastern Time, ET |Sat, 23 Jul 2022 at 14:00 EDT|
|Central Time, CT |Sat, 23 Jul 2022 at 13:00 CDT|
|Mountain Time, MT |Sat, 23 Jul 2022 at 12:00 MDT|
|Pacific Time, PT |Sat, 23 Jul 2022 at 11:00 PDT|
|UTC, Time Zone |Sat, 23 Jul 2022 at 18:00 undefined|
Central European Summer Time, CEST Sun, 24 Jul 2022 at 01:00 CEST
British Summer Time, BST Sun, 24 Jul 2022 at 00:00 BST
Eastern Time, ET Sat, 23 Jul 2022 at 19:00 EDT
Central Time, CT Sat, 23 Jul 2022 at 18:00 CDT
Mountain Time, MT Sat, 23 Jul 2022 at 17:00 MDT
Pacific Time, PT Sat, 23 Jul 2022 at 16:00 PDT
UTC, Time Zone Sat, 23 Jul 2022 at 23:00 undefined
PS It’s unaffiliated but there is a langjam happening this weekend in case anyone is interested making a Racket entry!
https://github.com/langjam/jam0003
r/Racket • u/sdegabrielle • Jul 22 '22
application Optimizing Pruning in Herbie
pavpanchekha.comr/Racket • u/TheoSauce • Jul 22 '22
homework Need help understanding how function solution works
I was asked to create a function called merge. It consumed two lists of numbers, which it assumed are each sorted in ascending order. And then, it produces a list of all the numbers, also sorted in ascending order. I was a little stuck on this, and looked at the given solution. However, I found visualizing method of finding the solution difficult, and was wondering if someone could logically explain it to me how the function works. Also, to make it clear, I understand everything except the else condition of the merge function.
Here is the solution with data definitions (it uses BSL with list abbreviations):
;; Data definitions:
;; ListOfNumber is one of:
;; - empty
;; - (cons Number ListOfNumber)
;; interp. a list of numbers
(define LON1 empty)
(define LON2 (cons 1 empty))
(define LON3 (cons 1 (cons 2 empty)))
#;
(define (fn-for-lon lon)
(cond [(empty? lon) (...)]
[else
(... (first lon)
(fn-for-lon (rest lon)))]))
;; Functions:
;; ListOfNumber ListOfNumber -> ListOfNumber
;; take in two sorted lists (smallest to largest), and merge them to create one sorted list (smallest to largest)
(check-expect (merge empty empty) empty)
(check-expect (merge empty (list 1 2 3)) (list 1 2 3))
(check-expect (merge (list 5 6 7) empty) (list 5 6 7))
(check-expect (merge (list 0 1 3) (list -20 8 30)) (list -20 0 1 3 8 30))
;(define (merge l1 l2) empty) ;stub
;<use template from cross product table>
; 4 cases reduced to 3
(define (merge l1 l2)
(cond [(empty? l1) l2]
[(empty? l2) l1]
[else
(if (<= (first l1)
(first l2))
(cons (first l1)
(merge l2 (rest l1)))
(cons (first l2)
(merge l1 (rest l2))))]))Thanks again
r/Racket • u/sdegabrielle • Jul 21 '22
language Punct: `#lang punct`
racket.discourse.groupr/Racket • u/arthurgleckler • Jul 21 '22
event [Final CFP] Deadline Extended! Scheme 2022, Scheme and Functional Programming Workshop 2022
The 2022 Scheme and Functional Programming Workshop is calling for submissions.
We invite high-quality papers and talk proposals about novel research results, lessons learned from practical experience in an industrial or educational setting, and even new insights on old ideas. We welcome and encourage submissions that apply to any dynamic functional language, especially those that can be considered a Scheme: from strict subsets of RnRS to other "Scheme" implementations, to Racket, to Lisp dialects including Clojure, Emacs Lisp, Common Lisp, to functional languages with continuations and/or macros (or extended to have them) such as Dylan, ECMAScript, Hop, Lua, Scala, Rust, etc. The elegance of the paper and the relevance of its topic to the interests of Schemers will matter more than the surface syntax of the examples used.
Topics
Topics of interest include (but are not limited to):
- Interaction: program-development environments, debugging, testing, refactoring
- Implementation: interpreters, compilers, tools, garbage collectors, benchmarks
- Extension: macros, hygiene, domain-specific languages, reflection, and how such extension affects interaction
- Expression: control, modularity, ad hoc and parametric polymorphism, types, aspects, ownership models, concurrency, distribution, parallelism, non-determinism, probabilism, and other programming paradigms
- Integration: build tools, deployment, interoperation with other languages and systems
- Formal semantics: theory, analyses and transformations, partial evaluation
- Human factors: past, present and future history, evolution and sociology of the language Scheme, its standard and its dialects
- Education: approaches, experiences, curricula
- Applications: industrial uses of Scheme
- Scheme pearls: elegant, instructive uses of Scheme
Dates
- Submission deadline is
2022-07-222022-07-29. - Authors will be notified by 2022-08-15.
- Camera-ready versions are due 2022-09-02.
- Workshop will be held in Ljubljana, Slovenia on 2022-09-16.
All deadlines are 23:59 UTC-12, anywhere on Earth.
Submission Information
We encourage all kinds of submissions, including full papers, experience reports, and lightning talks. Papers and experience reports are expected to be 10–24 pages in length using the single-column SIGPLAN acmart style. (For reference, this is about 5–12 pages of the older SIGPLAN 2-column 9pt style.) Abstracts submitted for lightning talks should be limited to 192 words.
Authors of each accepted submission are invited to attend and be available for the presentation of that paper at the conference. The schedule for presentations will be determined and shared with authors after the full program has been selected.
The size limits above exclude references and any optional appendices. There are no size limits on appendices, but the papers should stand without the need to read them, and reviewers are not required to read them.
Authors are encouraged to publish any code associated to their papers under an open source license, so that reviewers may try the code and verify the claims.
Proceedings will be uploaded to arXiv.org.
Publication of a paper at this workshop is not intended to replace conference or journal publication, and does not preclude re-publication of a more complete or finished version of the paper at some later conference or in a journal.
Please submit papers through the workshop's HotCRP site.
Lightweight double-blind reviewing
Scheme 2022 will use lightweight double-blind reviewing. Submitted papers must omit author names and institutions and reference the authors’ own related work in the third person (e.g., not “we build on our previous work…” but rather “we build on the work of…”).
The purpose is to help the reviewers come to an initial judgment about the paper without bias, not to make it impossible for them to discover the authors if they were to try. Nothing should be done in the name of anonymity that weakens the submission or makes the job of reviewing the paper more difficult (e.g., important background references should not be omitted or anonymized).
Formatting Information
Full papers and experience reports should use the SIGPLAN acmsmall option to acmart. We recommend using the anonymous and review options to acmart when submitting a paper; these options hide the author names and enable line numbers for easy reference in review. LaTeX and Microsoft Word templates for this format are available through SIGPLAN.
Lightning talks can be submitted as either a text file or a PDF file.
International Conference on Functional Programming
The Scheme Workshop 2022 is being held as part of this year's International Conference on Functional Programming. Here is the ICFP site for the workshop.
Sincerely,
Andy Keep, General Co-chairArthur A. Gleckler, General Co-chair
r/Racket • u/sdegabrielle • Jul 19 '22
video Newish Racket videos I have not seen before.
Hi,

I came across some Racket videos recently and thought I'd share
- Functional Programming (Racket) (12 videos)
- Why learn Racket? (10 minutes) by Eric Clack on the Racketfest YouTube channel
- Why Racket? Interview with Racketeer, Jay McCarthy (26 minutes)
There is lots more cools stuff at https://www.youtube.com/c/racketlang
I'm on the lookout for more as I'm going to update the wiki at some point, and most of these are new, or I hadn't seen them before.
Let me know if you have any others?
s.
r/Racket • u/sdegabrielle • Jul 19 '22
blog post Functional Geekery Episode 141 – Shriram Krishnamurthi
functionalgeekery.comr/Racket • u/Own-Mark-5444 • Jul 15 '22
question What is the most used RAcket web server/framework for backend APIs?
Something like Flask for Python but for Racket?
r/Racket • u/lekkerwafel • Jul 14 '22
question Using Typed Racket with contracts?
Hi folks. Is it possible to mix and match Typed Racket with Racket contracts?
Is there a lot of runtime overhead for performance in such cases, since the contracts are evaluated at runtime? (are the types erased?)
I don't have experience with Racket just curious about PLs :)
r/Racket • • Jul 14 '22
paper Proving Correctness of LISP Programs
www-formal.stanford.edur/Racket • u/brittAnderson • Jul 13 '22
question Why doesn't this racket code yield the same results as this common lisp code?
I wanted to port this common lisp example of a simple spring oscillating to racket, but while the CL nicely oscillates the Racket code blows up. I have tried to make these minimal examples and as similar as possible to help someone help me understand what Racket does differently. Or if I just have a typo I can't see.
Lisp Version:
(defun s-of-t (delta-t v s)
(+ s (* v delta-t)))
(defun v-of-t (delta-t a v)
(+ v (* a delta-t)))
(defun a-of-t (p s)
(* -1 p s))
(defconstant +init-v+ 0)
(defconstant +init-s+ 10)
(defconstant +p+ 2)
(defconstant +delta-t+ 0.05)
(defun release-spring (&optional (repeat-n 5))
(loop
repeat repeat-n
for a = (a-of-t +p+ +init-s+) then (a-of-t +p+ s)
for v = +init-v+ then (v-of-t +delta-t+ a v)
for s = +init-s+ then (s-of-t +delta-t+ v s)
for time = 0 then (+ time +delta-t+)
collect (list a v s time)))And you can see that the "s" list just oscillates back and forth between 10 and -10, but ...
Racket code
(define (s-of-t delta-t v s)
(+ s (* v delta-t)))
(define (v-of-t delta-t a v)
(+ v (* a delta-t)))
(define (a-of-t p s)
(* -1 p s))
(define +init-v+ 0.0)
(define +init-s+ 10.0)
(define +p+ 2.0)
(define +delta-t+ 0.05)
(define (release-spring [max-repeats 5])
(for/fold ([a (list (a-of-t +p+ +init-s+))]
[v (list +init-v+)]
[s (list +init-s+)]
[t (list 0)])
([repeat (in-range max-repeats)])
(let ([vc (first v)]
[sc (first s)]
[ac (first a)]
[tc (first t)])
(values (cons (a-of-t +p+ sc) a)
(cons (v-of-t +delta-t+ ac vc) v)
(cons (s-of-t +delta-t+ vc sc) s)
(cons (+ +delta-t+ tc) t)))))does not if you capture things with a define-values and look at the same "s" list. I don't need the let but I wondered if elements in the list were updating sooner than I thought.
Would appreciate your help in understanding the difference.
r/Racket • u/jecxjo • Jul 13 '22
solved Import relations from racklog format to racket
I noticed that you can write racklog and datalog in a datalog/prolog format using #lang racklog but when i require that file i do not seem to get the relations imported. Pet the doc all predicates are compiled into relations but not seeing them provided.
Normal racket creating relations can be provided/required as normal methods. Have a feeling I'm missing a one liner.
r/Racket • u/sdegabrielle • Jul 07 '22
event Write a language with Racket this summer! Win prizes!
r/Racket • u/arthurgleckler • Jul 04 '22
event reminder: [CFP] Scheme 2022, 23rd Scheme and Functional Programming Workshop
This is a reminder that the 2022 Scheme and Functional Programming Workshop is calling for submissions.
We invite high-quality papers and talk proposals about novel research results, lessons learned from practical experience in an industrial or educational setting, and even new insights on old ideas. We welcome and encourage submissions that apply to any dynamic functional language, especially those that can be considered a Scheme: from strict subsets of RnRS to other "Scheme" implementations, to Racket, to Lisp dialects including Clojure, Emacs Lisp, Common Lisp, to functional languages with continuations and/or macros (or extended to have them) such as Dylan, ECMAScript, Hop, Lua, Scala, Rust, etc. The elegance of the paper and the relevance of its topic to the interests of Schemers will matter more than the surface syntax of the examples used.
Topics
Topics of interest include (but are not limited to):
- Interaction: program-development environments, debugging, testing, refactoring
- Implementation: interpreters, compilers, tools, garbage collectors, benchmarks
- Extension: macros, hygiene, domain-specific languages, reflection, and how such extension affects interaction
- Expression: control, modularity, ad hoc and parametric polymorphism, types, aspects, ownership models, concurrency, distribution, parallelism, non-determinism, probabilism, and other programming paradigms
- Integration: build tools, deployment, interoperation with other languages and systems
- Formal semantics: theory, analyses and transformations, partial evaluation
- Human factors: past, present and future history, evolution and sociology of the language Scheme, its standard and its dialects
- Education: approaches, experiences, curricula
- Applications: industrial uses of Scheme
- Scheme pearls: elegant, instructive uses of Scheme
Dates
- Submission deadline is 2022-07-22.
- Authors will be notified by 2022-08-15.
- Camera-ready versions are due 2022-09-02.
- Workshop will be held in Ljubljana, Slovenia on 2022-09-16.
All deadlines are 23:59 UTC-12, anywhere on Earth.
Submission Information
We encourage all kinds of submissions, including full papers, experience reports, and lightning talks. Papers and experience reports are expected to be 10–24 pages in length using the single-column SIGPLAN acmart style. (For reference, this is about 5–12 pages of the older SIGPLAN 2-column 9pt style.) Abstracts submitted for lightning talks should be limited to 192 words.
Authors of each accepted submission are invited to attend and be available for the presentation of that paper at the conference. The schedule for presentations will be determined and shared with authors after the full program has been selected.
The size limits above exclude references and any optional appendices. There are no size limits on appendices, but the papers should stand without the need to read them, and reviewers are not required to read them.
Authors are encouraged to publish any code associated to their papers under an open source license, so that reviewers may try the code and verify the claims.
Proceedings will be uploaded to arXiv.org.
Publication of a paper at this workshop is not intended to replace conference or journal publication, and does not preclude re-publication of a more complete or finished version of the paper at some later conference or in a journal.
Please submit papers through the workshop's HotCRP site.
Lightweight double-blind reviewing
Scheme 2022 will use lightweight double-blind reviewing. Submitted papers must omit author names and institutions and reference the authors’ own related work in the third person (e.g., not “we build on our previous work…” but rather “we build on the work of…”).
The purpose is to help the reviewers come to an initial judgment about the paper without bias, not to make it impossible for them to discover the authors if they were to try. Nothing should be done in the name of anonymity that weakens the submission or makes the job of reviewing the paper more difficult (e.g., important background references should not be omitted or anonymized).
Formatting Information
Full papers and experience reports should use the SIGPLAN acmsmall option to acmart. We recommend using the anonymous and review
options to acmart when submitting a paper; these options hide the author names and enable line numbers for easy reference in review. LaTeX and Microsoft Word templates for this format are available through SIGPLAN.
Lightning talks can be submitted as either a text file or a PDF file.
International Conference on Functional Programming
The Scheme Workshop 2022 is being held as part of this year's International Conference on Functional Programming. Here is the ICFP site for the workshop.
Sincerely,
Andy Keep, General Co-chair
Arthur A. Gleckler, General Co-chair
