On Aug 30, 2011, at 2:50 PM, Neil Toronto wrote:
> CTRL-\ might become your best friend, then. It inserts an honest-to-goodness
> lambda.
... but that triggers unicode. I like old fashioned ASCII files. :)
rac
>
> I *never* write "lambda" anymore in Racket code.
>
> Neil T
>
> On 08/30/201
Ray Racine wrote at 08/30/2011 08:30 PM:
Chrome has solidified their native app capability. Downside, only
support is native apps in C or C++. Racket scheme is embeddable in a
C program, hence,
If they will let this embedded native app exec another process, or talk
through a Unix domain soc
CTRL-\ might become your best friend, then. It inserts an
honest-to-goodness lambda.
I *never* write "lambda" anymore in Racket code.
Neil T
On 08/30/2011 09:45 AM, Richard Cleis wrote:
I want to be able to:
#lang racket/L ; sacrifice L in honor of profoundly useful lambda
rac
On Aug 29,
I attempted to compile racket for chrome's sandbox (NaCL) but ran into a half
dozen issues (functions like execv are not implemented). I haven't pursued it
further but its probably possible.
On 08/30/2011 06:30 PM, Ray Racine wrote:
> Chrome has solidified their native app capability. Downside,
Chrome has solidified their native app capability. Downside, only support
is native apps in C or C++. Racket scheme is embeddable in a C program,
hence, the theoretical possibility of Racket embedded within Chrome. As
native apps are just another app loadable from the Chrome Web Store, Racket
in
extra-files-paths should contain directories, not the files, so
"C:/Users/howboutno5/Documents/Summer/test/htdocs/"
should work
Jay
On Tue, Aug 30, 2011 at 5:21 PM, Stees, Micheal T.
wrote:
> I looked at the example posted in the documentation that goes something like
> this:
>
> #lang racket
I looked at the example posted in the documentation that goes something like
this:
#lang racket
(require web-server/servlet
web-server/servlet-env
web-server/templates)
(define (start req)
(response/xexpr
`(html (head (title "Hello world!"))
(body "He
At Tue, 30 Aug 2011 19:03:24 -0400, Neil Van Dyke wrote:
> Thanks, Carl and Robby. I need to set up the lexical context to be that
> of the macro, while preserving the source position info. I will look
> into the pointers you gave me for how to do that.
One more pointer: `replace-context' from
Thanks, Carl and Robby. I need to set up the lexical context to be that
of the macro, while preserving the source position info. I will look
into the pointers you gave me for how to do that.
--
http://www.neilvandyke.org/
_
For list-related adm
Thanks for the followup, Kevin. Signalling an error sounds like the
right thing for the symbol case. I worry a little bit about how to
phrase it so people who run places in an unsaved drracket don't get
confused, tho. Maybe you have a good idea?
On Tue, Aug 30, 2011 at 3:27 PM, Kevin Tew wrote:
>
I completely forgot the concept that some modules exist only bound to a
namespace.
Your example helped me understand the problem better.
My analysis of the problem and and suggested solution were way off.
So I apologize.
On 08/30/2011 01:46 PM, Robby Findler wrote:
DrRacket is naming them. They
DrRacket is naming them. They are named 'anonymous-module and are put
into the current-namespace. (Changing the module-name-resolver in that
manner seems like a bad idea to me -- and modules can exist just
attached to the namespace like that. For example, '#%place is one such
module that you are fa
You should look at the #:extra-files-paths argument to serve/servlet
to specify where to find static files.
Jay
On Tue, Aug 30, 2011 at 12:49 PM, Stees, Micheal T.
wrote:
> Hello all,
>
> I am looking into using the racket web server and related tools to develop a
> webpage for a school project
Hello all,
I am looking into using the racket web server and related tools to develop a
webpage for a school project, and I have run into the following dilemma with
the trivial example I am trying.
I have racket include an html template for the test site, and that html
template references an e
Place are spawned by dynamically requiring a module.
It appears that an unsaved module in drracket gets the name
"anonymous-module" and the module-name-resolver doesn't know how to find
"anonymous-module".
I think drracket needs to uniquely name these anonymous-modules and then
install a
mod
It could be, if that's what you intended. I guess I just assumed it
was raw data. You could give it any lexical context you like. See
for instance the racket/include bindings for include and
include-at/relative-to, which behave very much like Neil's program.
The former uses the context of the in
When I add a step "2b" to save the file, then I get the correct
behavior (using a git build from today). Do you see that?
Robby
On Tue, Aug 30, 2011 at 9:54 AM, David Mitchell
wrote:
> Steps:
> 1. Open DrRacket
> 2. In the definitions window, paste in
>
> #lang racket
> (define (super-simple)
>
Kevin: when I follow the steps exactly as written, I get this error
message on stdout (under windows):
standard-module-name-resolver: collection not found: "anonymous-module" in any o
f: (# #)
I believe this to be a bug in the implementation of 'place' and to
have something to do with the name of
Can the thing coming out of the read-syntax be an expression? If so,
what lexical context should it have?
Robby
On Tue, Aug 30, 2011 at 1:00 PM, Carl Eastlund wrote:
> Oops. It's not NAME that's the problem. It's #,my-read-stx that
> needs to change to (quote #,my-read-stx) instead.
>
> Carl E
Oops. It's not NAME that's the problem. It's #,my-read-stx that
needs to change to (quote #,my-read-stx) instead.
Carl Eastlund
On Tue, Aug 30, 2011 at 1:41 PM, Carl Eastlund wrote:
> Just put an explicit "quote" form around it. Replace NAME with (quote
> NAME) in the template.
>
> Right now
Just put an explicit "quote" form around it. Replace NAME with (quote
NAME) in the template.
Right now there is no form to tell the expander how to expand NAME.
So the expander looks at the lexical context to see "how do I expand
this form". But NAME did not come from a lexical context, so it ha
When I run the code below in drracket, the code seems to run indefinitely.
When I hit the stop button the (place-channel-get p) sexp is highlighted
in pink.
Kevin
On 08/30/2011 08:54 AM, David Mitchell wrote:
#lang racket
(define (super-simple)
(define p
(place ch
- Original Message -
> From: Matthew Flatt
> To: Mark Carter
> Cc: "users@racket-lang.org"
> Sent: Tuesday, 30 August 2011, 15:07
> Subject: Re: [racket] Module docs
>
>T hanks for the details. I see that `raco setup' in a fresh install on
> Windows does bad things, so I'm starting
May be the following observation helps:
when running without saving the definitions I get an error.
when running after saving all goes well.
Windows 7, DrRacket, version 5.1.3.6--2011-08-28(c97b314/a) [3m]
Jos
_
From: users-boun...@racket-lang.org [mailto:users-boun...@racket-lang.org
I want to be able to:
#lang racket/L ; sacrifice L in honor of profoundly useful lambda
rac
On Aug 29, 2011, at 3:36 PM, Greg Hendershott wrote:
>> it wouldn't be necessary to create all these duplicate forms to avoid
>> writing (lambda () ...) This would cut down on code, and also make the
>
Thank you very much, that looks good.
Laurent
On Tue, Aug 30, 2011 at 17:08, Sam Tobin-Hochstadt wrote:
> I think there are some purely functional data structures that you can
> use here. Two examples:
>
> - Random Access Lists implemented in Hari Prashanth's Typed Purely
> Functional Data Str
I think there are some purely functional data structures that you can
use here. Two examples:
- Random Access Lists implemented in Hari Prashanth's Typed Purely
Functional Data Structures [1]
Some of the other data structures here, such as VLists, may also be helpful.
- David Van Horn's RAL
Steps:
1. Open DrRacket
2. In the definitions window, paste in
#lang racket
(define (super-simple)
(define p
(place ch
(place-channel-put ch 5)))
(place-channel-get p))
3. Click the "Run" button in the toolbar
4. In the REPL, type "(super-simple)"
The call to provide is nece
I'm not seeing bad behavior so probably I'm doing something slightly
differently than you, which is making the difference. If you have the energy
to send a precise set of steps I'm happy to try them on my machine and maybe
that'll help us sort it out.
Robby
On Tuesday, August 30, 2011, David Mitc
I can see a Haskellian, a Cleaner-upper, or a Cameleer impose the
no-macros-for-thunks rule. They have always claimed that there is no need to
avoid the repetition of (lambda () because it is so short. When you can't do
it, just say it ain't necessary. Better, say it's bad. -- Matthias
__
Thanks for the details. I see that `raco setup' in a fresh install on
Windows does bad things, so I'm starting with that problem. When that's
fixed, I'll continue checking what happens with your files.
(The `raco setup' problem happens when using an installer, as opposed
to building from source, w
I tried saving the module and putting a require in the DrRacket window, and
that works correctly. I think this will be an acceptable workaround for the
time being, but I'd really like to know more about what's going on.
-- Dave (on the iPhone)
On Aug 30, 2011, at 4:44 AM, Robby Findler wrote:
> Would you lso want entries to be garbage-collected? If there are no
> longer any references to a hash entry's key except as a key in the hash
> table, would you want the garbage colelctor to be able to remove it?
>
You mean a weak hash? Possibly indeed, though I can remove them manually
too. Wo
On Tue, Aug 30, 2011 at 02:29:34PM +0200, Laurent wrote:
> On Tue, Aug 30, 2011 at 12:52, Jos Koot wrote:
>
> > **
> > You are stating: hash with bounded memory
> > Does that mean you will have a limit on the number of entries?
> >
>
> Not necessarily. It might grow, although I might limit it to
On Tue, Aug 30, 2011 at 12:52, Jos Koot wrote:
> **
> You are stating: hash with bounded memory
> Does that mean you will have a limit on the number of entries?
>
Not necessarily. It might grow, although I might limit it to logarithmic
growth.
Or the bound may be very large but unknown, and litt
On Tue, Aug 30, 2011 at 12:23, Stephen Bloch wrote:
>
> On Aug 30, 2011, at 3:18 AM, Laurent wrote:
>
> Thank you very much for this nice intermediate solution, though I need
> constant-time append, split, insert, remove, + pointers to items, etc.
> Mutation does seem unavoidable, right.
>
>
> Th
I'm sorry; I was wrong.
I don't see the behavior you're seeing, tho. If I add parens around
'all-defined-out', and save the file in tmp.rkt, then this is the
behavior I see at the command-line racket:
Welcome to Racket v5.1.3.6.
> (require "tmp.rkt")
> (super-simple)
5
and I see similar behavior
You are stating: hash with bounded memory
Does that mean you will have a limit on the number of entries?
In that case a vector plus a current index might do, I think.
Gives you O(1) access to every element.
If the required number of elements may vary very much, a vector probably is
not a good idea,
I'm getting this error in some code with a macro transformer that
produces syntax that includes some bits of child syntax that are sourced
via "read-syntax".
The below example demonstrates.
Assuming that I really do want to use "read-syntax", how do I do this
properly? (I assume that proper
On Aug 30, 2011, at 3:18 AM, Laurent wrote:
Thank you very much for this nice intermediate solution, though I
need constant-time append, split, insert, remove, + pointers to
items, etc. Mutation does seem unavoidable, right.
The "zipper" structure Neil posted has constant-time append if yo
Thank you very much for this nice intermediate solution, though I need
constant-time append, split, insert, remove, + pointers to items, etc.
Mutation does seem unavoidable, right.
I started my own lib, but if something already exists, I'm still interested.
The purpose is to make a hash with bound
41 matches
Mail list logo
