Re: [racket-users] How 'Pythonic' Can Racket Be Made?

We tried embedding Python into Racket nee PLT Scheme some 20 years ago, twice: Here is a paper on the second attempt: From Python to PLT Scheme https://www2.ccs.neu.edu/racket/pubs/#scheme2003-ms Daniel Silva took the lead on this initiative. The surface language was (back then)

Re: [racket-users] Core Team: I need you decide what I should do about the spammer.

Thank you Sage for taking on this task. — Matthias -- 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 email to racket-users+unsubscr...@googlegroups.com. To view this

Re: [racket-users] Core Team: I need you decide what I should do about the spammer.

+2! And many thanks. (I was personally spared this spam until very recently. No clue why) — Matthias > On Dec 18, 2021, at 2:55 PM, Robby Findler wrote: > > +1! Thank you. > > Robby > > On Sat, Dec 18, 2021 at 1:43 PM Matthew Flatt > wrote: > The "members"

Re: [racket-users] The case, and a proposal, for elegant syntax in #lang racket2

onday, July 15, 2019 at 10:19:16 AM UTC-6, Matthias Felleisen wrote: > > > > On Jul 14, 2019, at 1:44 PM, someone wrote: > > > > - I am indeed very for growth in the community, though my main interest > > in growth is in seeing a wider diversity of participant

Re: [racket-users] The case, and a proposal, for elegant syntax in #lang racket2

> On Jul 14, 2019, at 1:44 PM, someone wrote: > > - I am indeed very for growth in the community, though my main interest > in growth is in seeing a wider diversity of participants than just > raw numbers. Obviously other peoples' mileage may vary. This is politics and politics has no

Re: [racket-users] Re: Thinking in scheme / racket

If I may, let me address the (at least) four dimensions of coding that have come up in this thread, as concretely as possible but with some generalizations added: 1. Performance Generally speaking, Python is a thin layer over C. It comes with almost all the performance advantages of C and

Re: [racket-users] Contracts in lambda?

[(contract (-> string? integer?) (λ (x) x) 'a 'b) "hello”] > On Jul 10, 2019, at 10:11 PM, Kevin Forchione wrote: > > Hi guys, > Is there a way to apply contracts to a lambda without associating it with an > identifier? What I want is to be able to pass lambda functions around without >

Re: [racket-users] raise-argument-error missing list?

We all are indeed at Racket school. The arguments for/against contracts have been made over and over again especially by Betrand Meyers, before we even introduced and studied the higher-order boundary-tied variant. + Contracts separate the core functionality of a service module from its

Re: [racket-users] What's wrong with my code?

With some for/loops in TR you’re out of luck. The expansion are too complex to type-check easily. > On Jul 7, 2019, at 10:24 AM, 曹朝 wrote: > > This is a simple algorithm for compute the shortest edit distance, it can > work with `#lang racket/base`. > But in Typed Racket, I just got the

Re: [racket-users] resources on PL design

Stephen, since Neil mentioned Alan Kay’s highly informative(*) HOPL essay, let me also point you to Ingalls’ essay (which Robby pointed out to me about a year ago): http://web.archive.org/web/20070213165045/users.ipa.net/~dwighth/smalltalk/byte_aug81/design_principles_behind_smalltalk.html

Re: [racket-users] Re: resources on PL design

Sam’s advice is good. You might be able to find draft versions of ACM HOPL articles on the authors’ web sites (or likely others who taught from these articles, because many of these articles appeared before the web and some of the authors are dead). In general, I think we lack a design

Re: [racket-users] images for Dr Racket 7.2 (Mac)

There is a small image collection available in 2htdp/image but the idea is that you do such examples with your own ideas and your own images. ~~ The next on-line release will suggest John's mouse-click suggestion. — Matthias > On Jun 30, 2019, at 4:31 AM, Bryan Pierce wrote: > > Yeah,

Re: [racket-users] new or make-object?

> On Jun 27, 2019, at 6:18 AM, Amir Teymuri wrote: > > According to the docs: > > The make-object > > procedure creates a new object with by-position

Re: [racket-users] leetcode

We’re way way way off topic here, so I’ll > On Jun 16, 2019, at 3:01 PM, Neil Van Dyke wrote: > > Just to define my terms, I distinguish Leetcode-style "coding tests" from the > old MS-style "puzzles" that Google later adopted for a while I equated puzzles w/ undergraduate algorithm

Re: [racket-users] leetcode

> On Jun 16, 2019, at 3:38 AM, Neil Van Dyke wrote: > > Anyone have thoughts on whether there's anything Racket can/should do > involving Leetcode? > > If you're not familiar, Leetcode is a site with bunch of coding interview > problems that huge numbers of CS students and professionals

Re: [racket-users] The search for routy

You may be interested in https://github.com/adjkant/web-sourcery (wip) > On Jun 14, 2019, at 3:15 AM, Gregor Kopp wrote: > > Thank you very much! > It's hot here... > > Am Freitag, 14. Juni 2019 08:58:53 UTC+2 schrieb Tom Gillespie: > https://github.com/Junker/routy found via

[racket-users] Re: 7 GUIs

> On Jun 1, 2019, at 7:47 PM, Matthias Felleisen wrote: > > > 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 wil

Re: [racket-users] Re: nannou

big-bang is intended for beginners. I understand that it can be used beyond the intended course material but I want to say that “adult programmers” are better off with the underlying graphics tool box :) > On Jun 11, 2019, at 8:10 AM, Darren Newton wrote: > > I spent a couple of weeks

Re: [racket-users] macros and let/cc

> On Jun 3, 2019, at 12:33 PM, Kevin Forchione wrote: > > Oh! I see! That solves the expansio issue! Wonderful. You’ve opened up a > whole new set of possibilities for me. Thanks, Matthias. I am glad I sent my solution a second time :) -- You received this message because you are

Re: [racket-users] macros and let/cc

Or, #lang racket (require (for-syntax ) racket/stxparam) (define-syntax-parameter return (syntax-rules ())) (define-syntax-parameter false (syntax-rules ())) (define-syntax fn (syntax-rules () [(_ (arg ...) body ...) (λ (arg ...) (let/cc fn-exit (syntax-parameterize

Re: [racket-users] macros and let/cc

#lang racket (require (for-syntax ) racket/stxparam) (define-syntax-parameter return (syntax-rules ())) (define-syntax fn (syntax-rules () [(_ (arg ...) body ...) (λ (arg ...) (let/cc fn-exit (syntax-parameterize ([return (syntax-rules () [(_ x) (fn-exit x)])])

Re: [racket-users] macros and let/cc

My code run your examples. Whay is missinng? > On Jun 3, 2019, at 11:36 AM, Kevin Forchione wrote: > > > >> On Jun 3, 2019, at 4:54 AM, Alex Knauth wrote: >> >> >> >>> On Jun 3, 2019, at 1:02 AM, Kevin Forchione wrote: >>>> On

Re: [racket-users] macros and let/cc

> On Jun 2, 2019, at 9:41 PM, Kevin Forchione wrote: > > Hi guys, > I’ve been working with macros and let/cc and have a situation where I have > the 2nd macro bound to the let/cc return of the first. No idea how I’d do > that, but here’s an example of what I’m attempting to do: > > #lang

[racket-users] 7 GUIs

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 develop this repo in more depth (types,

Re: [racket-users] Macro help

Let me propose the use of syntax-parse as an alternative here. I think it clarifies the purpose of the maco. — Matthias #lang racket (require (for-syntax syntax/parse)) #; (aux a (b (* 2 pi)) c (d pi)) ;; => #; (define-values (a b c d) (values #f 6.28318530717958 #f 3.141592653589793))

Re: [racket-users] Abstract run times (HTDP)

> On May 24, 2019, at 6:27 AM, Sean Kemplay wrote: > > Hi all, > > I trying to work out the ART of the sum-tree question from HTDP2e. > > I have worked through the book before however am going through it again, this > time am doing every exercise - this is not homework! > > Here is my

Re: [racket-users] chez-runner plugin

Off topic. ~~ It is ironic how 23 years after we started out and had an option for DrRacket, née DrScheme, to run its programs in Chez instead Mz .. and now we’re getting back to that :) > On May 22, 2019, at 11:10 AM, 'Paulo Matos' via Racket Users > wrote: > > Hi, > > It seems you

Re: [racket-users] Haskell

> On May 15, 2019, at 1:26 PM, Josh Rubin wrote: > > Type inference; laziness as the default; the language forces me to think in a > different way than racket (or scheme) makes me think. > > The examples I have seen have a breath-taking level of abstraction that > appeals to the

Re: [racket-users] Re: Keeping my mind sharp

> On May 11, 2019, at 8:41 PM, Josh Rubin wrote: > > > This is going to be easier than I thought. Nobody told me (mostly-equal? > Racket Scheme) > > Racket seems to be a superset of the Scheme I know, with more restrictions on > mutation. I was conservative about mutations. My worst habit

Re: [racket-users] tilda - a threading macro full of itself

> On May 7, 2019, at 1:29 PM, zeRusski wrote: > > It just names the threaded value. Did I overlook anything? > > That's right, nothing fancy. Think let-binding the threaded value at that > point. #:with id ~ would achieve the same thing, so as it is now #:as is > redundant. With #:do both

Re: [racket-users] tilda - a threading macro full of itself

> On May 7, 2019, at 9:39 AM, zeRusski wrote: > > I asked in a separate thread how one debugs set of scopes in Racket macros. I > appreciate the question may read a bit hand-wavy and abstract, so I split out > the piece of code I had in mind into a separate package so that interested >

Re: [racket-users] how do you read, manipulate, debug scope sets?

> On May 6, 2019, at 10:53 AM, zeRusski wrote: > > Suddenly I find myself playing games with hygiene and not really knowing the > rules. Hygiene is a default not an absolute. The idea of hygiene is that, unless the macro writer goes out of his way, the expander assumes that identifiers

Re: [racket-users] Stack trace

> On May 3, 2019, at 4:17 AM, Mark Engelberg wrote: > > f tracing is not easily available in BSL, my ideal would be that every error > prints out not only the function/line where the error occurred, but also the > input(s) to the function which triggered the error. (Example: a function >

Re: [racket-users] Re: RacketCon: These 8 INSANE talks about Racket will change your life! I can't believe #7! --- (ninth RacketCon) on July 13th, 2019 --- Speakers Announced!

Yes, Jay is about to send it out to people who signed up and/or asked for financial help. — Matthias > On Apr 29, 2019, at 9:30 PM, calminfe...@gmail.com wrote: > > For Racket School is there any information yet about scoring a dorm room? Or > if preferred any conference rates at any near

Re: [racket-users] Are syntax transformations tree automata?

The coimputational power of Racket’s syntax transformation system is equivalent to that of Turing machines. [[ The expressive power is a bit limited and we’re working on expanding it, but I don’r think you’re asking about this. ]] — Matthias > On Apr 23, 2019, at 7:29 AM, Ilnar

Re: [racket-users] Being a good macro citizen: patterns to follow for good error reporting

> On Apr 21, 2019, at 6:48 AM, zeRusski wrote: > > I just had an epiphany, or rather a very painful revelation, that if your > macro does not report errors in terms of user code, say, when inputs are > wrong, you ought to be ostracized by the community if not banished from any > social

Re: [racket-users] From HtDP to Racket

> On Apr 18, 2019, at 12:08 PM, Luis Sanjuán wrote: > > The last month or so we all read some interesting posts about the convenience > of examples or docs to facilitate the transition from other languages to > Racket (from Python to Racket, from R to Racket, ...). Then I thought about >

Re: [racket-users] catch and bind an unbound id in a macro

Yes, I wanted to recall this trick for you and overshot :) > On Apr 19, 2019, at 6:04 PM, zeRusski wrote: > > Matthias, FWIW your first solution gave me a flashback from last year's > Summer School. I remember using this trick. Now I hope I don't forget when I > actually need it. > >

Re: [racket-users] catch and bind an unbound id in a macro

I should have know better: (define-syntax (set/define stx) (syntax-case stx () [(_ id key val) (identifier-binding #'id) #`(begin (hash-set! h 'key val) h)] [(_ id key val) #'(begin (define id (make-hash)) (set/define id key val))]))

Re: [racket-users] catch and bind an unbound id in a macro

I had the impression that you want to create the hashtable when it’s not there and use it when it is: #lang racket (define-syntax (set/define stx) (syntax-case stx () [(_ id key val) (syntax-local-value #'id (lambda () #f)) (with-syntax ([h (car (syntax-local-value #'id

Re: [racket-users] hackernews

Can you speak in general terms at RacketCon? > On Apr 16, 2019, at 3:02 PM, dexterla...@gmail.com wrote: > > I use Racket daily in production at Mercury Filmworks (Disney TVA, Amazon, > Netflix productions among others), and I wish I could talk more about how > Racket helps us where it

Re: [racket-users] Is there a way to find where some feature is implemented in racket?

> On Apr 16, 2019, at 8:31 AM, zeRusski wrote: > > I suspect I'm not the first to ask, but my search-fu has failed me here. > Apologies if the question has already been answered on that list. > > When I read Racket docs I sometimes wonder how a particular feature is > implemented. Looking

Re: [racket-users] recursive function with multiple arguments

A bit of modernity yields this: (define (project-pop.v1 y r k thetasd t [i 1]) (cond [(= i t) (list y)] [else (define theta (flvector-ref (flnormal-sample 0.0 thetasd 1) 0)) (define y1 (* y (- r (* r (/ y k))) (exp theta))) (cons y (project-pop y1 r k thetasd t (+

Re: [racket-users] HN: "The Siren Song of Little Languages"

> On Mar 26, 2019, at 10:51 AM, 'Joel Dueck' via Racket Users > wrote: > > This is a blog post / discussion that seems like it could use a little > clarity and evangelism from the Racket world: > > https://news.ycombinator.com/item?id=19481789 > > I’m struggling to understand exactly

Re: [racket-users] Error handling for the GUI

> On Mar 25, 2019, at 12:30 PM, James Platt wrote: > > > On Mar 25, 2019, at 12:05 PM, Matthias Felleisen wrote: > >> Your exception handlers may test a contract failure to any level. You can >> specify this in the predicate part of with-handlers or via

Re: [racket-users] Error handling for the GUI

> On Mar 25, 2019, at 11:59 AM, James Platt wrote: > > > On Mar 23, 2019, at 5:49 PM, Greg Hendershott wrote: > >> But -- contract violations aren't like that. They're about some code >> surprising some other code. I think the only hope here is, run the >> code enough (before the user ever

Re: [racket-users] How to launch image display from racket REPL?

I wouldn’t have known either :) — You are running outside of the intended context and I am sure you know that 2htdp/image is built on top of the GUI infrastructure — If you look at the image teachpack, you will see section 2.2 "Image Interoperability” — there you will see that an image is

Re: [racket-users] Writing scribble?

esc-b, esc-f > On Mar 13, 2019, at 2:24 PM, Matt Jadud wrote: > > Hi all, > > I assume people use DrRacket to write Scribblings. > > I'll be writing text, and want to move back one word. On the Mac, most of the > time I can hit Option-LeftArrow, and I go back one word. > > I DrRacket,

Re: [racket-users] out of memory with streams

> On Mar 12, 2019, at 10:48 AM, bedeke wrote: > > > Sorry for not being clear. > I knew that increasing the memory limit could make this run without problems > since the data in each cell of the stream is so small. > I was running this example with a memory limit of 128MB. > I made my own

Re: [racket-users] out of memory with streams

> On Mar 12, 2019, at 3:10 AM, bedeke wrote: > > Hello, > > when running any of the following the program runs out of memory: > > #lang racket/base > (require racket/stream) > > (stream-ref (let ([i 0])(stream-cons i (let loop ()(set! i (+ i > 1))(stream-cons i (loop) >

Re: [racket-users] define fails at runtime, where let fails at compile time

> On Mar 11, 2019, at 1:18 PM, Brian Adkins wrote: > > I want let semantics, but I've been using define more because it's preferred > in the Racket style guide. I don't want the behavior of define above, so > using letrec to get a runtime error instead of compile time error doesn't > make

Re: [racket-users] define fails at runtime, where let fails at compile time

> On Mar 11, 2019, at 11:21 AM, Brian Adkins wrote: > > I just discovered that define will fail at runtime, where let would fail at > compile time. Besides helping to keep the indentation level from marching to > the right "too much", what are the benefits of define over let? > > --- snip

Re: [racket-users] lexer-parser approach in Racket [was the list of languages made with racket [Hacker News]]

> On Mar 1, 2019, at 2:29 PM, Aidan Gauland wrote: > > On 2/03/19 3:27 AM, Matthias Felleisen wrote: >>> On Mar 1, 2019, at 2:15 AM, Aidan Gauland >>> wrote: >>> >>> On 24/02/19 12:08 PM, Matthias Felleisen wrote: >>> >>>>

Re: Types of languages Re: [racket-users] the list of languages made with racket [Hacker News]

> On Mar 1, 2019, at 12:05 PM, Stephen De Gabrielle > wrote: > > Hi Matthias, > (or anyone else who is available to answer :)) > > I'm trying to get my head around the range of possible languages in Racket. > > You got me thinking how many languages seem to have embedded little >

Re: [racket-users] how to use union types

. . . all of which suggests that perhaps we should support blazingly fast list chaperones eventually :) -- 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 email to

Re: [racket-users] R6RS history

> On Feb 27, 2019, at 1:42 PM, Arthur Nunes-Harwitt wrote: > > Dear Matthias, > > Would you be willing to share your thoughts about the history of > denotational versus operational semantics in the report? [[ This is probably totally off topic for the list. ]] Denotational semantics

Re: [racket-users] R6RS history

Let me inject some comments that make it a bit more obvious what’s happening here: > On Feb 26, 2019, at 3:33 PM, Sam Tobin-Hochstadt wrote: > RnRS meetings from 1984 thru 2003 adhere to the “unanimity rule” originating from the MIT group. In 2001, I created and ran “Scheme and

Re: [racket-users] Re: Help with generators from python land!

> I imagine some input, that is too big and should be handled one element > at a time instead. How would one do that in Racket, when not using > something comparable to a Python generator? It depends on the situation specifically the interface that’s force on your components (if any) and how

Re: [racket-users] Strip the lexical context from an identifier

1 2) > ;; 2 > > (define x 3) > ((my-macro x) 1 2) > ;; 3 > > > > -Sam > > * well, I think that's what's going on. > > On Fri, Feb 22, 2019 at 1:21 PM Matthias Felleisen > wrote: > > > > On Feb 22, 2019, at 1:08 PM, Stefano Lande wrote: > >

Re: [racket-users] Strip the lexical context from an identifier

> On Feb 22, 2019, at 1:08 PM, Stefano Lande wrote: > > Dear all, > > first of all, I might being misusing the terminology. Sorry about it. > > I would like to write a macro that gets an identifier and return its value in > the new lexical scope created by the macro. > For example: > > >

Re: [racket-users] Help with generators from python land!

> On Feb 21, 2019, at 10:32 PM, Konrad Hinsen > wrote: > > The main difference, as has been pointed out before, is that Python > generators are more common as an idiom for solving problems that in Racket > would typically be approached differently. [[ This is of course ironic in a way,

Re: [racket-users] Transfer code from "intermediate student with lamnda" to "Pretty big"

See previous email exchanges and the require necessary to import the tests (test-engine/racket-tests) plus the call to the test function. > On Feb 19, 2019, at 2:26 PM, orenpa11 wrote: > > Hi > Is it possible to transfer code from "intermediate student with lamnda" to > "Pretty big" >

Re: [racket-users] test user-interact function dont work

> On Feb 17, 2019, at 6:44 PM, Joao Pedro Abreu De Souza > wrote: > > (check-equal? > (with-output-to-string >(lambda () > (with-input-from-string "input" >(lambda () > (refine-main) Your mistake is in the above line. You want to write refine-main not

Re: [racket-users] Running raco setup from within DrRacket?

> On Feb 15, 2019, at 11:05 PM, jackhfi...@gmail.com wrote: > > Whenever I change code in my package I switch over to the terminal and > recompile it with `raco setup`. This is slightly tedious and I’d like to be > able to do this from within DrRacket. But I’m not sure how to translate the

Re: [racket-users] Re: Little language design/implementation guidance

> On Feb 13, 2019, at 10:24 AM, Stephen De Gabrielle > wrote: > > • programmer (without compilers course) > • did compilers at degree level (can still remember it and it covered > design decisions, as opposed to algorithms and data structures) > • Beautiful Racket and/or/

Re: [racket-users] struct-info

> On Feb 12, 2019, at 5:28 PM, David Storrs wrote: > > On Tue, Feb 12, 2019 at 5:03 PM wrote: This is nice for defining abstract types, but it can be pretty inconvenient for defining plain old aggregated data types that just have a bundle of fields. When defining those

Re: [racket-users] Re: nested for loops and suggested alternatives

> On Feb 10, 2019, at 7:26 PM, Alex Harsanyi wrote: > > One way to do this is for `pop-abundances` to have an extra parameter, the > list of previous abundances, and whenever the function is called recursively, > it adds the current abundance to this list and passes it on to the next call.

Re: [racket-users] Re: Some concern about ChezScheme...

> On Feb 9, 2019, at 5:35 PM, ra...@airmail.cc wrote: > > Could nanopass, at least in theory, fuse multiple (or even all) passes into > one at compile time. To create a very efficient compiler which is also > logically broken down and readable in the source code? Yes, precisely because the

Re: [racket-users] Re: Little language design/implementation guidance

> On Feb 7, 2019, at 7:32 PM, Neil Van Dyke wrote: > > but it might just be easier to just get a professorship instead (also > nontrivial). :) Absolutely. * How many academic PL experts do you know that design languages? * How many of their languages reach an audience of more than 7? *

Re: [racket-users] Some concern about ChezScheme...

> On Feb 6, 2019, at 3:19 PM, George Neuner wrote: > > On Wed, 6 Feb 2019 12:50:21 -0500, Matthias Felleisen > mailto:matth...@felleisen.org>> wrote: > >>> On Feb 6, 2019, at 12:30 PM, 'Paulo Matos' via Racket Users >>> wrote: >>> >>>

Re: [racket-users] How to start a program in pretty big

As several people have mentioned in the past, you go into DrRacket and use the Language menu to choose Pretty Big. > On Feb 7, 2019, at 11:57 AM, orenpa11 wrote: > > Hi, > If I would like to write a code in pretty big what is the first line that > need to be written ? > Can I use #lang

Re: [racket-users] Some concern about ChezScheme...

is uni as early as 98? > > On 6 February 2019 18:50:21 CET, Matthias Felleisen > wrote: > > >> On Feb 6, 2019, at 12:30 PM, 'Paulo Matos' via Racket Users >> wrote: >> >> I was quite surprised to read these nanopass ideas have been around for >> so

Re: [racket-users] Some concern about ChezScheme...

> On Feb 6, 2019, at 12:30 PM, 'Paulo Matos' via Racket Users > wrote: > > I was quite surprised to read these nanopass ideas have been around for > so long. 1. The educational idea came first: A Nanopass framework for compiler education. • Volume 15, Issue 5 • September 2005 , pp.

Re: [racket-users] Python's append vs Racket's append and helping novices understand the implications

the same algorithms, but changing the > implementation as much as it was necessary.) > > Gustavo > > On Sun, Feb 3, 2019 at 7:38 PM Matthias Felleisen > wrote: > > Agreed! > > > >> On Feb 3, 2019, at 4:43 PM, Robby Findler >> wrote: >&g

Re: [racket-users] Python's append vs Racket's append and helping novices understand the implications

Agreed! > On Feb 3, 2019, at 4:43 PM, Robby Findler wrote: > > It seems like a great addition to the performance section of the guide. > > Robby > > On Sun, Feb 3, 2019 at 3:35 PM Matthias Felleisen <mailto:matth...@felleisen.org>> wrote: > &

Re: [racket-users] Python's append vs Racket's append and helping novices understand the implications

f we tell > people to install a separate package if they want an efficient container... > I have no experience with `ralist`, but if it is indeed a good data structure > and it has a potentially wide usage, it should be included in the default > Racket installation. > > Alex. &g

[racket-users] Re: From Guido to Matthias (was: Python's append vs Racket's append and helping novices understand the implications)

> On Feb 3, 2019, at 10:12 AM, Laurent wrote: > > When was that and what was the outcome of this meeting? Nothing. It was a waste of my time. — Matthias -- You received this message because you are subscribed to the Google Groups "Racket Users" group. To unsubscribe from this group and

Re: [racket-users] Re: performance: Racket vs Julia

It is rare that I have to somewhat-contradict Matthew here, but so it goes. One of my colleagues, Jan Vitek, has studied Julia with a special focus on performance. As many have said, Julia is good at numerics because its compiler can specialize certain cases really well. More generally, it

Re: [racket-users] Python's append vs Racket's append and helping novices understand the implications

Racket needs *you*. Please. The proper approach is to have short pages for different language immigration groups: Python and R come to mind as obvious examples but I am sure there are others. What I mean is we need help and *you* can help. Let me explain it with the Python example: 1.

Re: [racket-users] How To Design Classes text not available?

http://felleisen.org/matthias/htdc.html [ The ccs.neu.edu file is actually a redirect HTML file but that doesn’t seem to work. ] > On Feb 2, 2019, at 3:26 PM, Justin Zamora wrote: > > I tried to download the draft of "How to

Re: [racket-users] Spritely awarded Samsung Stack Zero grant

Thank you for your efforts and stamina in pursuit of this goal. I hope that Samsung will continue to be generous to you :) Congrats! — Matthias > On Jan 31, 2019, at 5:46 PM, Christopher Lemmer Webber > wrote: > > I've mentioned that my goal has been to advance the >

Re: [racket-users] Re: updated Racket-on-Chez status

> On Jan 30, 2019, at 8:52 PM, Sam Tobin-Hochstadt wrote: > >> Although there are costs to TR in compile time and load time, >> especially in a program that also has untyped components, I generally >> would not recommend moving away from TR. > > Unlike Matthew, I can be sure not to offend the

Re: [racket-users] Problem controlling macro expansion

n > > On Sunday, January 27, 2019 at 4:08:54 PM UTC-5, Matthias Felleisen wrote: > > Why is run-query not a macro and if it were, why would you quote > lines-to-syntax-tree? > > >> On Jan 27, 2019, at 4:06 PM, Jonathan Simpson gmail.com >> <http://gmail.com/&g

Re: [racket-users] Problem controlling macro expansion

Why is run-query not a macro and if it were, why would you quote lines-to-syntax-tree? > On Jan 27, 2019, at 4:06 PM, Jonathan Simpson wrote: > > I'm having macro troubles with a DSL I'm writing. I have a macro that looks > something like this: > > (define-syntax (query stx) > (let

Re: [racket-users] snake game

ct" is been chnaged from "Beginning Student with List > Abbreviations" to pretty big ? > Does Pretty Big has drawing functions ? > > Thanks, > Or > > On Friday, January 25, 2019 at 5:33:50 PM UTC+2, Matthias Felleisen wrote: > > See below.

Re: [racket-users] Collections and data structures wishlist?

> On Jan 26, 2019, at 9:03 AM, Sorawee Porncharoenwase > wrote: > > Matthias, where can I find this "History of Clojure"? I searched for "It is > better to have 100 transducers ..." and found no result (besides this very > thread). I also searched for "History of Clojure" and only found this

Re: [racket-users] Collections and data structures wishlist?

> On Jan 26, 2019, at 8:31 AM, Hendrik Boom wrote: > > On Fri, Jan 25, 2019 at 07:50:56PM -0500, Matthias Felleisen wrote: >> >> Yes. See Clojure history. — Matthias > > Given the amount of text you have quoted, it's not clear what you are > saying yes to.

Re: [racket-users] Collections and data structures wishlist?

ring fit the first category more than the second. This kind of divide > makes it much easier to support a wide array of data structures without > copying the entire list processing API for each one. > > On Fri, Jan 25, 2019 at 12:51 PM Matthias Felleisen <mailto:matth...@felleisen

Re: [racket-users] Collections and data structures wishlist?

> On Jan 25, 2019, at 3:46 PM, Thomas F. Burdick wrote: > > > > On January 25, 2019 8:33:09 PM GMT+01:00, Jack Firth > wrote: >> >> Due to the kind of data that would go in tuples - namely, a fixed-sized >> heterogeneous collection of values - a function probably *shouldn't* >> use >> map

Re: [racket-users] snake game

> > Hi, > > Sorry but I did not get it. > > should I add the path to the rkt file or add the code ? > > > > Thanks, > > Or > > > > On Friday, January 25, 2019 at 1:39:12 PM UTC+2, Matthias Felleisen wrote: > >> > >>

Re: [racket-users] snake game

. > just copying the code is not helpful because I need to understand it. > > Thanks, > Or > > On Thursday, January 24, 2019 at 11:54:34 PM UTC+2, Matthias Felleisen wrote: > > Yes there is. Use (require test-engine/racket-tests) > at the top and (test) at the bottom. >

Re: [racket-users] snake game

ist Abbreviations" to pretty big ? > > Thanks, > Or > > > > > On Thursday, January 24, 2019 at 9:19:14 PM UTC+2, Matthias Felleisen wrote: > > > Where did you find the snake game? > Where did it say it’s written in Pretty Big? > > We have not used Pre

Re: [racket-users] Collections and data structures wishlist?

(define tuple/c list/c) The key to list/c and listof is that the code inside of functions contracted with either of them can use map and filter and everything else to process the arguments. > On Jan 24, 2019, at 8:33 AM, Gustavo Massaccesi wrote: > > I also like the idea of a contract

Re: [racket-users] snake game

Where did you find the snake game? Where did it say it’s written in Pretty Big? We have not used Pretty Big in over a decade in education, neither does anyone in the Racket edu community proper. This community supports people readily wth answers, but we need to know what you know. —

Re: [racket-users] Collections and data structures wishlist?

> On Jan 18, 2019, at 10:22 PM, jackhfi...@gmail.com wrote: > > > - A separation between using lists as homogeneous collections and using lists > as fixed-size tuples. So there'd be a separate `tuple?` data type that's > structurally equivalent to a list but meant to be used differently. For

Re: [racket-users] Continue (into the future?)

It would be wonderful if someone started such a tutorial for RacketScript so that we had a driving usecase for the language development — Matthias > On Jan 18, 2019, at 10:58 AM, Stephen De Gabrielle > wrote: > > Hi, > > While looking at an issue with the rendering of the Continue

Re: [racket-users] Functions that are sometimes tail recursive

> On Jan 15, 2019, at 10:13 AM, Will Jukes wrote: > > Hi everyone, > > I was helping a student the other day with a problem where they were to write > a recursive function that uses trial division to return a list of the prime > factors of an integer (no fancy optimizations, these are high

Re: [racket-users] Re: Racket Weet 2019

> On Jan 10, 2019, at 2:19 PM, 'Jeff Ward' via Racket Users > wrote: > > Is there a description available for the "How to Design Languages" course? Not yet, but it will be quite similar to the 2018 Racket School. Probably in late Feb. — Matthias > > I assume that the "Beautiful

Re: [racket-users] Weird behavior when a ‘set’ is the result of ‘eval’

Structs are generative. So in different namespaces they mean different things. > On Jan 10, 2019, at 1:26 PM, 'Leandro Facchinetti' via Racket Users > wrote: > > Interesting. But what makes sets special? My original program works with > hashes, for example: > > #lang racket > (define h

Re: [racket-users] Weird behavior when a ‘set’ is the result of ‘eval’

> On Jan 10, 2019, at 11:50 AM, 'Leandro Facchinetti' via Racket Users > wrote: > > Please help me understand the following: > > #lang racket > (define s (eval '(begin (require racket/set) (set 1 2)) > (make-base-namespace))) > s ;; ⇒ (set 1 2) > (set? s) ;; ⇒ #f (but I expected ‘#t’)

  1   2   3   4   5   6   7   >