> * As an aside, one of the few times I remember Kent Dybvig making a "joke" in
> class was when he introduced the pass "remove complex operands." It was
> called "remove-complex-opera*." At Indiana, where Opera is a Thing, I think
> it was particularly funny as an inside joke of sorts. He
On Wed, Feb 06, 2019 at 06:33:11PM -0500, Neil Van Dyke wrote:
> I think RnRS came across as "too academic", like "Holy crud! A
> function return is a call! OMG, we're all, like, cosmically connected,
> man... And a return is... a first class object?! WTH!" And the formal
> semantics --
Stephen De Gabrielle wrote on 2/6/19 11:25 AM:
Dave Herman recently tweeted
BTW, Dave Herman was a great contributor of Racket (PLT Scheme)
packages, and has been missed, though I understand the attraction of
Mozilla at the time.
More generally, can you recommend resources a developer
James Geddes wrote on 2/6/19 6:33 AM:
but in general I’ve not found elsewhere this tasteful combination of clarity
and completeness. (Well, except RnRS, so maybe my prejudices are showing
through.)
I mostly like RnRS. For one practitioner reason, you can hand many
programmers the canonical
On Wed, Feb 06, 2019 at 12:50:21PM -0500, 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 long.
>
>
> 1. The educational idea came first:
>
> A
On Wednesday, February 6, 2019 at 3:38:30 PM UTC+1, Greg Trzeciak wrote:
>
>
>
> On Wednesday, February 6, 2019 at 9:30:43 AM UTC+1, amz3 wrote
>
>> I tried to engage with racket community about what was missing in racket
>> to build "industry grade web application". I got only silence in reply
Also, almost that `read-all` function is provided as `port->list` from
`racket/port`.
Sam
On Wed, Feb 6, 2019 at 6:25 AM Alex Harsanyi wrote:
>
> (read-from-string "123") is equivalent to `(call-with-input-string "123"
> read)` while read-from-string-all can be replaced by:
>
> (define
On Wed, Feb 6, 2019 at 9:42 AM 'Paulo Matos' via Racket Users <
racket-users@googlegroups.com> wrote:
>
>
>
> On 06/02/2019 16:00, Shu-Hung You wrote:
> > print-values is a normal identifier introduced by the racket/base's
> > macro module-begin. It is a (private) function defined in
> >
My recollection is that Kent taught with this approach because it simplified
homeworks for students and graders and I encouraged him to write it up for the
“education pearl” section that I launched for JFP in ’03. It took several years
to collect the papers and get them written and publish
Thanks for the references. That really useful.
Interestingly according to Matt these ideas were already floating around at his
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
Andy Keep did a presentation on writing a nanopass compiler a couple of years
ago https://www.youtube.com/watch?v=Os7FE3J-U5Q
That and the code on his github were very helpful when I tried to understand
the nanopass framework.
// Niklas
--
You received this message because you are
> 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.
On 06/02/2019 13:42, Matt Jadud wrote:
> On Tue, Feb 5, 2019 at 8:01 AM 'Paulo Matos' via Racket Users
> mailto:racket-users@googlegroups.com>>
> wrote:
>
>
> Matthew mentions the move to Chez will help maintainability and I am
> sure he's right because he has been working with Racket
On 05/02/2019 22:44, Neil Van Dyke wrote:
> BTW, sometime around when the move to Chez settles, it would be good if
> many people were somewhat familiar with current Racket internals.
That would be absolutely great. I think if there is a small team of
contributors alongside Matthew improving
On 05/02/2019 19:05, Matthew Flatt wrote:
> Hi Paulo,
>
> Not to discourage other answers to your call for opinions, but here's
> mine.
>
> Granting your point about the structure of the code in Chez Scheme,
> everything is relative. I still think Chez Scheme is a better starting
> point than
Hi,
Dave Herman recently tweeted[1] that consulting a PL specialist was a good idea
for little languages to avoid common foundational mistakes, specifically
mentioning templating systems and configuration files.
So when designing(or evolving) a little language:
what beginners mistakes should
On 06/02/2019 16:00, Shu-Hung You wrote:
> print-values is a normal identifier introduced by the racket/base's
> macro module-begin. It is a (private) function defined in
> racket/private/modbeg.
>
That's sort of surprising. I actually expected fully expanded programs
to be evaluable by the
print-values is a normal identifier introduced by the racket/base's macro
module-begin. It is a (private) function defined in racket/private/modbeg.
On Feb 6, 2019 5:02 AM, "'Paulo Matos' via Racket Users" <
racket-users@googlegroups.com> wrote:
> Hi,
>
> The docs[1] give a grammar for fully
On Wednesday, February 6, 2019 at 9:30:43 AM UTC+1, amz3 wrote
> I tried to engage with racket community about what was missing in racket
> to build "industry grade web application". I got only silence in reply :(
>
> AFAIK one missing piece is something like Python Celery. That can be
>
On Tue, Feb 5, 2019 at 8:01 AM 'Paulo Matos' via Racket Users <
racket-users@googlegroups.com> wrote:
>
> Matthew mentions the move to Chez will help maintainability and I am
> sure he's right because he has been working with Racket for a long time
> but my experience comes from looking at
On Wednesday, February 6, 2019 at 7:58:47 PM UTC+8, Laurent Orseau wrote:
>
> Oh nice, I didn't know we could do that one!
> Point taken :)
>
> I suppose (hope?) you can still use sandboxing with memory limits for this?
>
You could make your own read table which disables all special treatment
Oh nice, I didn't know we could do that one!
Point taken :)
I suppose (hope?) you can still use sandboxing with memory limits for this?
On Wed, Feb 6, 2019 at 11:52 AM Alex Harsanyi
wrote:
>
>
> On Wednesday, February 6, 2019 at 7:36:40 PM UTC+8, Laurent Orseau wrote:
>>
>> On Wed, Feb 6, 2019
On Wednesday, February 6, 2019 at 7:36:40 PM UTC+8, Laurent Orseau wrote:
>
> On Wed, Feb 6, 2019 at 11:25 AM Alex Harsanyi > wrote:
>
> although I am not sure it is a good idea to call read on strings received
>> from the user...
>>
>
> They're not eval'ed,
>
>
Try: (call-with-input-string
On Wed, Feb 6, 2019 at 11:25 AM Alex Harsanyi
wrote:
> (read-from-string "123") is equivalent to `(call-with-input-string "123"
> read)` while read-from-string-all can be replaced by:
>
> (define (read-all in)
> (let loop ([result '()])
> (let ((v (read in)))
> (if
Dear All,
There was a recent discussion on this list about the Racket guides and manuals.
Without wishing to comment on the suggestions therein, I did want to say what I
really, really like about the Racket documentation.
There are two things. The first is that the Reference is — and I know
(read-from-string "123") is equivalent to `(call-with-input-string "123"
read)` while read-from-string-all can be replaced by:
(define (read-all in)
(let loop ([result '()])
(let ((v (read in)))
(if (eof-object? v)
(reverse result)
(loop
Hi,
The docs[1] give a grammar for fully expanded programs.
I found it amazingly concise so I decided to give it a try and expanded
the following:
```
#lang racket
42
```
This expands to (nicely formatted):
#
That looks good to me. However, in the documented grammar there's no
reference to
read-from-string and read-from-string-all are convenient functions, but
they belong to the mzlib/string library, which is deprecated. I can't find
an existing replacement in racket/string or racket/base. Is there one with
a different name?
--
You received this message because you are subscribed
On Tuesday, August 1, 2017 at 1:25:03 PM UTC+2, Greg Trzeciak wrote:
>
> On Monday, July 24, 2017 at 11:01:33 PM UTC+2, amz3 wrote:
>
> >
> > That said, I am not sure it can scale as much as I want/need given
> racket thread model [5]. I will experiment.
> >
> > [5]
>
29 matches
Mail list logo
