<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
<HTML><HEAD>
<META content="text/html; charset=iso-8859-1" http-equiv=Content-Type>
<META name=GENERATOR content="MSHTML 8.00.6001.18928">
<STYLE></STYLE>
</HEAD>
<BODY bgColor=#ffffff>
<DIV>well, I hate to spoil the fun (and it IS fun - I once wrote a task
scheduler built on engines, and I thoroughly enjoyed it), but a) the last thing
the world needs is yet another operating system, and b) Scheme (and in
particular Racket) are pretty poor choices for underlying architectures. In low
level software design, you MUST a) have real time behavior at least in the
kernel (which doesn't go well with anything that has JIT and garbage collection
in it) and b) have some kind of control over hardware - placement of code
and data in memory, access to memory mapped peripheral I/O, interrupt handlers
and so on. By definition, none of the above blend in well with the (otherwise
very desireable) abstraction features of Scheme. In fact, the predominant
language Embedded systems are written in is still C, sometimes C++ - but no
language that does not support pointers or address casts will ever have a chance
to be a building block for embedded systems. </DIV>
<DIV> </DIV>
<DIV>I've given this very issue a lot of thought recently (I am a full time
embedded software designer and planned on doing an embedded system completly in
Scheme myself), and eventually I decided that without compromising a number of
the fundamentail tenets of Scheme, there simply isn't a point (you'd have to
provide a number of extensions that plainly contradict the Scheme philosophy).
Of course I'll be happy to be proven wrong. I am aware of a few attempts made at
it, but as far as I can tell, those were useful only in a very limited
environment, and to my best knowledge, none has ever made it into the commercial
world.</DIV>
<DIV><BR>And of course, for academic purposes, there is always a place for a
project like that, but I don't see any money in the real world to be made with
that kind of thing, given that the first questions it must answer are "will it
run my iPhone apps" and "does it support the Graphmaster AX-B34x series of
graphics cards in accelerated mode?" </DIV>
<DIV><FONT size=2 face=Arial></FONT> </DIV>
<BLOCKQUOTE
style="BORDER-LEFT: #000000 2px solid; PADDING-LEFT: 5px; PADDING-RIGHT: 0px; MARGIN-LEFT: 5px; MARGIN-RIGHT: 0px">
<DIV style="FONT: 10pt arial">----- Original Message ----- </DIV>
<DIV
style="FONT: 10pt arial; BACKGROUND: #e4e4e4; font-color: black"><B>From:</B>
<A title=davidblubaugh2000@yahoo.com
href="mailto:davidblubaugh2000@yahoo.com">David Blubaugh</A> </DIV>
<DIV style="FONT: 10pt arial"><B>To:</B> <A title=matthias@ccs.neu.edu
href="mailto:matthias@ccs.neu.edu">Matthias Felleisen</A> </DIV>
<DIV style="FONT: 10pt arial"><B>Cc:</B> <A title=users@racket-lang.org
href="mailto:users@racket-lang.org">users@racket-lang.org</A> </DIV>
<DIV style="FONT: 10pt arial"><B>Sent:</B> Wednesday, December 05, 2012 5:29
PM</DIV>
<DIV style="FONT: 10pt arial"><B>Subject:</B> Re: [racket] OPERATING SYSTEM ON
A FPGA</DIV>
<DIV><BR></DIV>
<TABLE border=0 cellSpacing=0 cellPadding=0>
<TBODY>
<TR>
<TD vAlign=top>
<DIV>Well</DIV>
<DIV> </DIV>
<DIV> </DIV>
<DIV>Is there a way I can obtain help in acquiring funding in developing
Racket into a real OS?? I would love to see how far we can take
this concept !!! </DIV>
<DIV> </DIV>
<DIV>Apple and MacOS watch out here comes something with more powerful
features !!!</DIV>
<DIV> </DIV>
<DIV>David Blubaugh<BR><BR>--- On <B>Wed, 12/5/12, Matthias Felleisen
<I><<A
href="mailto:matthias@ccs.neu.edu">matthias@ccs.neu.edu</A>></I></B>
wrote:<BR></DIV>
<BLOCKQUOTE
style="BORDER-LEFT: rgb(16,16,255) 2px solid; PADDING-LEFT: 5px; MARGIN-LEFT: 5px"><BR>From:
Matthias Felleisen <<A
href="mailto:matthias@ccs.neu.edu">matthias@ccs.neu.edu</A>><BR>Subject:
Re: [racket] OPERATING SYSTEM ON A FPGA<BR>To: "David Blubaugh"
<davidblubaugh2000@yahoo.com><BR>Cc:
users@racket-lang.org<BR>Date: Wednesday, December 5, 2012, 11:24
AM<BR><BR>
<DIV class=plainMail><BR>In the mid 90s, we had this idea to go for a
Scheme OS, SOS. As an experiment, we asked a student to write a disk
driver in Scheme (Bigloo) and to see what we could do with it. One of
the things he was able to do is hot-swap policies for spinning the
disk. This sounds so quaint in the age of laptops w/o movable parts.
<BR><BR>In the late 90s, Matthew spent an afternoon so that we could
boot Racket (formerly known as PLT Scheme) on raw hardware. Since most
of us had dual-boot machines already (Linux and the other one), we
went to ternary-boot machines: Linux, PLT Scheme, and the other one.
None of us ever had the appetite to add enough device drivers to turn
Racket into a real OS but nothing stands in its way. <BR><BR>Right
now, a Darpa project enables us to experiment with Racket on the
Router (think RoR, though that acronym has been taken). Again, it's
systemish work. This email is going thru the DNS service that we have
built so far. <BR><BR>In short, doable but we haven't done it.
<BR><BR><BR><BR><BR><BR><BR><BR><BR><BR>On Dec 5, 2012, at 11:16 AM,
David Blubaugh wrote:<BR><BR>> To All,<BR>> <BR>>
<BR>> I was wondering if anyone has ever created a real time
operating system with Racket. As well as, create applications
within a FPGA device by utilizing racket?? Can racket be a
solution to ALL PROBLEMS that is the question.<BR>>
<BR>> <BR>> David Blubaugh<BR>> <BR>> <BR>>
<BR>> --- On Wed, 12/5/12, <A
href="http://us.mc1133.mail.yahoo.com/mc/compose?to=users-request@racket-lang.org"
ymailto="mailto:users-request@racket-lang.org">users-request@racket-lang.org</A>
<<A
href="http://us.mc1133.mail.yahoo.com/mc/compose?to=users-request@racket-lang.org"
ymailto="mailto:users-request@racket-lang.org">users-request@racket-lang.org</A>>
wrote:<BR>> <BR>> From: <A
href="http://us.mc1133.mail.yahoo.com/mc/compose?to=users-request@racket-lang.org"
ymailto="mailto:users-request@racket-lang.org">users-request@racket-lang.org</A>
<<A
href="http://us.mc1133.mail.yahoo.com/mc/compose?to=users-request@racket-lang.org"
ymailto="mailto:users-request@racket-lang.org">users-request@racket-lang.org</A>><BR>>
Subject: users Digest, Vol 88, Issue 18<BR>> To: <A
href="http://us.mc1133.mail.yahoo.com/mc/compose?to=users@racket-lang.org"
ymailto="mailto:users@racket-lang.org">users@racket-lang.org</A><BR>>
Date: Wednesday, December 5, 2012, 10:30 AM<BR>> <BR>> Send
users mailing list submissions to<BR>> <A
href="http://us.mc1133.mail.yahoo.com/mc/compose?to=users@racket-lang.org"
ymailto="mailto:users@racket-lang.org">users@racket-lang.org</A><BR>>
<BR>> To subscribe or unsubscribe via the World Wide Web,
visit<BR>> <A
href="http://lists.racket-lang.org/users/listinfo"
target=_blank>http://lists.racket-lang.org/users/listinfo</A><BR>>
or, via email, send a message with subject or body 'help'
to<BR>> <A
href="http://us.mc1133.mail.yahoo.com/mc/compose?to=users-request@racket-lang.org"
ymailto="mailto:users-request@racket-lang.org">users-request@racket-lang.org</A><BR>>
<BR>> You can reach the person managing the list at<BR>>
<A
href="http://us.mc1133.mail.yahoo.com/mc/compose?to=users-owner@racket-lang.org"
ymailto="mailto:users-owner@racket-lang.org">users-owner@racket-lang.org</A><BR>>
<BR>> When replying, please edit your Subject line so it is more
specific<BR>> than "Re: Contents of users digest..."<BR>>
<BR>> <BR>> [Racket Users list:<BR>> <A
href="http://lists.racket-lang.org/users"
target=_blank>http://lists.racket-lang.org/users</A>]<BR>> <BR>>
<BR>> Today's Topics:<BR>> <BR>> 1. Re: Whats
the difference between a predicate and a flat<BR>>
contract? (Harry Spier)<BR>> 2. Re:
Whats the difference between a predicate and a flat<BR>>
contract? (Robby Findler)<BR>>
3. Re: DRRacket right-click menu fragility in Linux. (Neil
Toronto)<BR>> 4. Re: minimum spanning tree (Matthias
Felleisen)<BR>> <BR>> <BR>>
----------------------------------------------------------------------<BR>>
<BR>> Message: 1<BR>> Date: Tue, 4 Dec 2012 21:59:42
-0500<BR>> From: Harry Spier <<A
href="http://us.mc1133.mail.yahoo.com/mc/compose?to=vasishtha.spier@gmail.com"
ymailto="mailto:vasishtha.spier@gmail.com">vasishtha.spier@gmail.com</A>><BR>>
To: Robby Findler <<A
href="http://us.mc1133.mail.yahoo.com/mc/compose?to=robby@eecs.northwestern.edu"
ymailto="mailto:robby@eecs.northwestern.edu">robby@eecs.northwestern.edu</A>><BR>>
Cc: Carl Eastlund <<A
href="http://us.mc1133.mail.yahoo.com/mc/compose?to=cce@ccs.neu.edu"
ymailto="mailto:cce@ccs.neu.edu">cce@ccs.neu.edu</A>>, users <<A
href="http://us.mc1133.mail.yahoo.com/mc/compose?to=users@racket-lang.org"
ymailto="mailto:users@racket-lang.org">users@racket-lang.org</A>><BR>>
Subject: Re: [racket] Whats the difference between a predicate and
a<BR>> flat contract?<BR>>
Message-ID:<BR>>
<CAJ3b0o9_yd-j4U6tbEOQaB+JKWto_A1XwSrh3_xyRTk=Uviy=<A
href="http://us.mc1133.mail.yahoo.com/mc/compose?to=Q@mail.gmail.com"
ymailto="mailto:Q@mail.gmail.com">Q@mail.gmail.com</A>><BR>>
Content-Type: text/plain; charset=UTF-8<BR>> <BR>> Are
flat-contract and flat-contract-predicate equivalent?<BR>> <BR>>
> ((flat-contract 'x) 'x)<BR>> #t<BR>> >
((flat-contract-predicate 'x) 'x)<BR>> #t<BR>> >
((flat-contract 'x) 'y)<BR>> #f<BR>> >
((flat-contract-predicate 'x) 'y)<BR>> #f<BR>> ><BR>>
<BR>> Harry<BR>> <BR>> On Tue, Dec 4, 2012 at 9:41 PM, Robby
Findler<BR>> <<A
href="http://us.mc1133.mail.yahoo.com/mc/compose?to=robby@eecs.northwestern.edu"
ymailto="mailto:robby@eecs.northwestern.edu">robby@eecs.northwestern.edu</A>>
wrote:<BR>> > It does that for symbols, but not
everything.<BR>> ><BR>> > This is the place you should be
looking, I think.<BR>> ><BR>> > <A
href="http://docs.racket-lang.org/reference/contracts.html"
target=_blank>http://docs.racket-lang.org/reference/contracts.html</A><BR>>
><BR>> > Robby<BR>> ><BR>> > On Tue, Dec 4, 2012
at 8:38 PM, Harry Spier <<A
href="http://us.mc1133.mail.yahoo.com/mc/compose?to=vasishtha.spier@gmail.com"
ymailto="mailto:vasishtha.spier@gmail.com">vasishtha.spier@gmail.com</A>>
wrote:<BR>> >> OK I see the docs to flat-contract? but not
flat-contract<BR>> >> <A
href="http://docs.racket-lang.org/reference/contract-utilities.html#"
target=_blank>http://docs.racket-lang.org/reference/contract-utilities.html#</A>(def._((lib._racket/contract/private/misc..rkt)._flat-contract~3f))<BR>>
>> mention that flat-contracts are more than predicates.
Those docs<BR>> >> don't mention it, but it appears from
experimentation that<BR>> >> (flat-contract something)
produces a procedure such that<BR>> >> ((flat-contract
something) x) is #t if something eq? x .<BR>> >><BR>>
>> Harry Spier<BR>> >><BR>> >> On Tue, Dec 4,
2012 at 8:57 PM, Robby Findler<BR>> >> <<A
href="http://us.mc1133.mail.yahoo.com/mc/compose?to=robby@eecs.northwestern.edu"
ymailto="mailto:robby@eecs.northwestern.edu">robby@eecs.northwestern.edu</A>>
wrote:<BR>> >>> On Tue, Dec 4, 2012 at 7:28 PM, Carl
Eastlund <<A
href="http://us.mc1133.mail.yahoo.com/mc/compose?to=cce@ccs.neu.edu"
ymailto="mailto:cce@ccs.neu.edu">cce@ccs.neu.edu</A>>
wrote:<BR>> >>>> On Tue, Dec 4, 2012 at 7:49 PM, Robby
Findler <<A
href="http://us.mc1133.mail.yahoo.com/mc/compose?to=robby@eecs.northwestern.edu"
ymailto="mailto:robby@eecs.northwestern.edu">robby@eecs.northwestern.edu</A>><BR>>
>>>> wrote:<BR>> >>>>><BR>>
>>>>> Flat contracts includes more things than
contracts. For example:<BR>> >>>>><BR>>
>>>>> [robby@yanpu]
~/git/plt/collects/scribblings/reference$ racket<BR>>
>>>>> Welcome to Racket v5.3.1.9.<BR>>
>>>>> > (flat-contract? 'x)<BR>>
>>>>> #t<BR>> >>>>> > (procedure?
'x)<BR>> >>>>> #f<BR>>
>>>>><BR>> >>>>> The flat-contract
function is a holdover from the days when flat contracts<BR>>
>>>>> weren't able to be used directly as predicate
functions.<BR>> >>>>><BR>>
>>>>><BR>> >>>>> I'll push a
clarification to the docs for flat-contract.<BR>>
>>>><BR>> >>>><BR>> >>>>
Isn't that the wrong way around? The flat-contract function lets
you use a<BR>> >>>> predicate as a contract, not a
contract as a predicate. Presumably it's<BR>>
>>>> from before predicates could be used as contracts,
although I hadn't<BR>> >>>> realized there was such a
time.<BR>> >>><BR>> >>> There was a time when
you had to call 'flat-contract' to turn a<BR>> >>>
predicate into a contract, yep. There was a housecleaning
(anyone<BR>> >>> remember the days when there were
multiple suffixes (not just "/c") on<BR>> >>> the
combinators?) and I probably should have gotten rid of it at
that<BR>> >>> time, but I didn't.<BR>>
>>><BR>> >>> (Oh and I mean "contracts" where I
wrote "preducate functions" above. Oops.)<BR>> >>><BR>>
>>> Robby<BR>> <BR>> <BR>>
------------------------------<BR>> <BR>> Message: 2<BR>>
Date: Tue, 4 Dec 2012 21:05:45 -0600<BR>> From: Robby Findler
<<A
href="http://us.mc1133.mail.yahoo.com/mc/compose?to=robby@eecs.northwestern.edu"
ymailto="mailto:robby@eecs.northwestern.edu">robby@eecs.northwestern.edu</A>><BR>>
To: Harry Spier <<A
href="http://us.mc1133.mail.yahoo.com/mc/compose?to=vasishtha.spier@gmail.com"
ymailto="mailto:vasishtha.spier@gmail.com">vasishtha.spier@gmail.com</A>><BR>>
Cc: Carl Eastlund <<A
href="http://us.mc1133.mail.yahoo.com/mc/compose?to=cce@ccs.neu.edu"
ymailto="mailto:cce@ccs.neu.edu">cce@ccs.neu.edu</A>>, users <<A
href="http://us.mc1133.mail.yahoo.com/mc/compose?to=users@racket-lang.org"
ymailto="mailto:users@racket-lang.org">users@racket-lang.org</A>><BR>>
Subject: Re: [racket] Whats the difference between a predicate and
a<BR>> flat contract?<BR>>
Message-ID:<BR>> <<A
href="http://us.mc1133.mail.yahoo.com/mc/compose?to=CAL3TdOMVL4xerBMr9xWqNz3tPjxbSXDfjaiJro2N9j6fxrSrOQ@mail.gmail.com"
ymailto="mailto:CAL3TdOMVL4xerBMr9xWqNz3tPjxbSXDfjaiJro2N9j6fxrSrOQ@mail.gmail.com">CAL3TdOMVL4xerBMr9xWqNz3tPjxbSXDfjaiJro2N9j6fxrSrOQ@mail.gmail.com</A>><BR>>
Content-Type: text/plain; charset=UTF-8<BR>> <BR>> Yes ..., I
think so (well, eq? probably messes things up, as usual).<BR>>
<BR>> But that's a funny question! What's really going on there is
that<BR>> flat-contract is coercing the value into a contract, and
flat<BR>> contracts also acts as predicate functions (matching what
the<BR>> contracts match). flat-contract-predicate takes its
argument, turns it<BR>> into the contract and then returns the
predicate. This last step is<BR>> useless, as flat-contracts are
now predicates without any coercion<BR>> (again, not something that
was always the case).<BR>> <BR>> I'll add a similar note to the
docs for this function too.<BR>> <BR>> Robby<BR>> <BR>> On
Tue, Dec 4, 2012 at 8:59 PM, Harry Spier <<A
href="http://us.mc1133.mail.yahoo.com/mc/compose?to=vasishtha.spier@gmail.com"
ymailto="mailto:vasishtha.spier@gmail.com">vasishtha.spier@gmail.com</A>>
wrote:<BR>> > Are flat-contract and flat-contract-predicate
equivalent?<BR>> ><BR>> >> ((flat-contract 'x)
'x)<BR>> > #t<BR>> >> ((flat-contract-predicate 'x)
'x)<BR>> > #t<BR>> >> ((flat-contract 'x) 'y)<BR>>
> #f<BR>> >> ((flat-contract-predicate 'x) 'y)<BR>>
> #f<BR>> >><BR>> ><BR>> > Harry<BR>>
><BR>> > On Tue, Dec 4, 2012 at 9:41 PM, Robby
Findler<BR>> > <<A
href="http://us.mc1133.mail.yahoo.com/mc/compose?to=robby@eecs.northwestern.edu"
ymailto="mailto:robby@eecs.northwestern.edu">robby@eecs.northwestern.edu</A>>
wrote:<BR>> >> It does that for symbols, but not
everything.<BR>> >><BR>> >> This is the place you
should be looking, I think.<BR>> >><BR>> >> <A
href="http://docs.racket-lang.org/reference/contracts.html"
target=_blank>http://docs.racket-lang.org/reference/contracts.html</A><BR>>
>><BR>> >> Robby<BR>> >><BR>> >> On
Tue, Dec 4, 2012 at 8:38 PM, Harry Spier <<A
href="http://us.mc1133.mail.yahoo.com/mc/compose?to=vasishtha.spier@gmail.com"
ymailto="mailto:vasishtha.spier@gmail.com">vasishtha.spier@gmail.com</A>>
wrote:<BR>> >>> OK I see the docs to flat-contract? but
not flat-contract<BR>> >>> <A
href="http://docs.racket-lang.org/reference/contract-utilities.html#"
target=_blank>http://docs.racket-lang.org/reference/contract-utilities.html#</A>(def._((lib._racket/contract/private/misc..rkt)._flat-contract~3f))<BR>>
>>> mention that flat-contracts are more than
predicates. Those docs<BR>> >>> don't mention it,
but it appears from experimentation that<BR>> >>>
(flat-contract something) produces a procedure such that<BR>>
>>> ((flat-contract something) x) is #t if something eq? x
.<BR>> >>><BR>> >>> Harry Spier<BR>>
>>><BR>> >>> On Tue, Dec 4, 2012 at 8:57 PM,
Robby Findler<BR>> >>> <<A
href="http://us.mc1133.mail.yahoo.com/mc/compose?to=robby@eecs.northwestern.edu"
ymailto="mailto:robby@eecs.northwestern.edu">robby@eecs.northwestern.edu</A>>
wrote:<BR>> >>>> On Tue, Dec 4, 2012 at 7:28 PM, Carl
Eastlund <<A
href="http://us.mc1133.mail.yahoo.com/mc/compose?to=cce@ccs.neu.edu"
ymailto="mailto:cce@ccs.neu.edu">cce@ccs.neu.edu</A>>
wrote:<BR>> >>>>> On Tue, Dec 4, 2012 at 7:49 PM,
Robby Findler <<A
href="http://us.mc1133.mail.yahoo.com/mc/compose?to=robby@eecs.northwestern.edu"
ymailto="mailto:robby@eecs.northwestern.edu">robby@eecs.northwestern.edu</A>><BR>>
>>>>> wrote:<BR>> >>>>>><BR>>
>>>>>> Flat contracts includes more things than
contracts. For example:<BR>> >>>>>><BR>>
>>>>>> [robby@yanpu]
~/git/plt/collects/scribblings/reference$ racket<BR>>
>>>>>> Welcome to Racket v5.3.1.9.<BR>>
>>>>>> > (flat-contract? 'x)<BR>>
>>>>>> #t<BR>> >>>>>> >
(procedure? 'x)<BR>> >>>>>> #f<BR>>
>>>>>><BR>> >>>>>> The
flat-contract function is a holdover from the days when flat
contracts<BR>> >>>>>> weren't able to be used
directly as predicate functions.<BR>>
>>>>>><BR>> >>>>>><BR>>
>>>>>> I'll push a clarification to the docs for
flat-contract.<BR>> >>>>><BR>>
>>>>><BR>> >>>>> Isn't that the wrong
way around? The flat-contract function lets you use a<BR>>
>>>>> predicate as a contract, not a contract as a
predicate. Presumably it's<BR>> >>>>> from
before predicates could be used as contracts, although I
hadn't<BR>> >>>>> realized there was such a
time.<BR>> >>>><BR>> >>>> There was a
time when you had to call 'flat-contract' to turn a<BR>>
>>>> predicate into a contract, yep. There was a
housecleaning (anyone<BR>> >>>> remember the days when
there were multiple suffixes (not just "/c") on<BR>>
>>>> the combinators?) and I probably should have gotten
rid of it at that<BR>> >>>> time, but I didn't.<BR>>
>>>><BR>> >>>> (Oh and I mean "contracts"
where I wrote "preducate functions" above. Oops.)<BR>>
>>>><BR>> >>>> Robby<BR>> <BR>>
<BR>> ------------------------------<BR>> <BR>> Message:
3<BR>> Date: Tue, 04 Dec 2012 21:30:23 -0700<BR>> From: Neil
Toronto <<A
href="http://us.mc1133.mail.yahoo.com/mc/compose?to=neil.toronto@gmail.com"
ymailto="mailto:neil.toronto@gmail.com">neil.toronto@gmail.com</A>><BR>>
To: <A
href="http://us.mc1133.mail.yahoo.com/mc/compose?to=users@racket-lang.org"
ymailto="mailto:users@racket-lang.org">users@racket-lang.org</A><BR>>
Subject: Re: [racket] DRRacket right-click menu fragility in
Linux.<BR>> Message-ID: <<A
href="http://us.mc1133.mail.yahoo.com/mc/compose?to=50BECDDF.4030508@gmail.com"
ymailto="mailto:50BECDDF.4030508@gmail.com">50BECDDF.4030508@gmail.com</A>><BR>>
Content-Type: text/plain; charset=UTF-8; format=flowed<BR>>
<BR>> Could what you're experiencing have anything to do with
tooltips? It <BR>> seems my right-click menu doesn't stay up
whenever there's a tooltip <BR>> out. Which is, like, every time I
want it.<BR>> <BR>> Neil ?<BR>> <BR>> On 12/04/2012 07:55
PM, Ray Racine wrote:<BR>> > Yea, I didn't want to make a big
deal out of it, but the up/down button<BR>> > change did not fix
the issue. In fact I'd say no impact positive
or<BR>> > negative.<BR>> ><BR>> > It seems to happen
when there is additional drawing 'complexity' in<BR>> >
co-occurrence with the pop up drawing area. I.e. the pop up menu
is<BR>> > drawing where arrows are drawn or error highlighting
is occurring etc.<BR>> > Also maybe when the pop up menu area is
near the 'edge' of the Dr window<BR>> > and or pane area.
But again the problem is not consistently<BR>> > reproducible
yet happens more often then not. Its not a once in a
blue<BR>> > moon that thing. Sometimes an attempt to right
click pop up menu will<BR>> > fail numerous times in a row
then succeed for no apparent reason.<BR>> ><BR>> > On Dec
4, 2012 9:07 PM, "Robby Findler" <<A
href="http://us.mc1133.mail.yahoo.com/mc/compose?to=robby@eecs.northwestern.edu"
ymailto="mailto:robby@eecs.northwestern.edu">robby@eecs.northwestern.edu</A><BR>>
> <mailto:<A
href="http://us.mc1133.mail.yahoo.com/mc/compose?to=robby@eecs.northwestern.edu"
ymailto="mailto:robby@eecs.northwestern.edu">robby@eecs.northwestern.edu</A>>>
wrote:<BR>> ><BR>> > On Tue, Dec
4, 2012 at 6:11 PM, Stephen Chang <<A
href="http://us.mc1133.mail.yahoo.com/mc/compose?to=stchang@ccs.neu.edu"
ymailto="mailto:stchang@ccs.neu.edu">stchang@ccs.neu.edu</A><BR>>
> <mailto:<A
href="http://us.mc1133.mail.yahoo.com/mc/compose?to=stchang@ccs.neu.edu"
ymailto="mailto:stchang@ccs.neu.edu">stchang@ccs.neu.edu</A>>>
wrote:<BR>> > > On Fri, Nov 2, 2012 at
9:33 PM, Robby Findler<BR>> > > <<A
href="http://us.mc1133.mail.yahoo.com/mc/compose?to=robby@eecs.northwestern.edu"
ymailto="mailto:robby@eecs.northwestern.edu">robby@eecs.northwestern.edu</A><BR>>
> <mailto:<A
href="http://us.mc1133.mail.yahoo.com/mc/compose?to=robby@eecs.northwestern.edu"
ymailto="mailto:robby@eecs.northwestern.edu">robby@eecs.northwestern.edu</A>>>
wrote:<BR>> > >> I've pushed a fix to
this. Thanks to Matthew for looking into it and<BR>> >
>> sorting it out and sorry for the delay.<BR>>
> ><BR>> > >
I'm using git head and I'm still seeing this problem (Ubuntu<BR>>
> 11.10). I<BR>> >
> can't reliably reproduce it but in case it helps, it most
recently<BR>> > > happened when I
selected tack arrows and now I can't bring up the<BR>> >
menu<BR>> > > to untack
the arrows anymore.<BR>> > ><BR>>
><BR>> > The particular fix Matthew
pointed me to is popping up the menu on a<BR>> >
mouse down event, not a mouse up event.<BR>>
><BR>> > <A
href="http://git.racket-lang.org/plt/blobdiff/27aa99944657c5827eee3772f715df7dd971d1e0..0377bda9474f8848a97509ace898174c83361006:/collects/framework/private/keymap.rkt"
target=_blank>http://git.racket-lang.org/plt/blobdiff/27aa99944657c5827eee3772f715df7dd971d1e0..0377bda9474f8848a97509ace898174c83361006:/collects/framework/private/keymap.rkt</A><BR>>
><BR>> > So I guess there's something
else going on, too (because that's the<BR>> >
code that pops up the menu with the check syntax
items).<BR>> ><BR>> >
Robby<BR>> ><BR>> ><BR>> ><BR>>
> ____________________<BR>> > Racket Users
list:<BR>> > <A
href="http://lists.racket-lang.org/users"
target=_blank>http://lists.racket-lang.org/users</A><BR>>
><BR>> <BR>> <BR>> <BR>>
------------------------------<BR>> <BR>> Message: 4<BR>>
Date: Wed, 5 Dec 2012 10:30:22 -0500<BR>> From: Matthias Felleisen
<<A
href="http://us.mc1133.mail.yahoo.com/mc/compose?to=matthias@ccs.neu.edu"
ymailto="mailto:matthias@ccs.neu.edu">matthias@ccs.neu.edu</A>><BR>>
To: Pierpaolo Bernardi <<A
href="http://us.mc1133.mail.yahoo.com/mc/compose?to=olopierpa@gmail.com"
ymailto="mailto:olopierpa@gmail.com">olopierpa@gmail.com</A>><BR>>
Cc: Racket mailing list <<A
href="http://us.mc1133.mail.yahoo.com/mc/compose?to=users@racket-lang.org"
ymailto="mailto:users@racket-lang.org">users@racket-lang.org</A>><BR>>
Subject: Re: [racket] minimum spanning tree<BR>> Message-ID: <<A
href="http://us.mc1133.mail.yahoo.com/mc/compose?to=CE678990-63D0-4400-AF2A-C6B2880E4FFB@ccs.neu.edu"
ymailto="mailto:CE678990-63D0-4400-AF2A-C6B2880E4FFB@ccs.neu.edu">CE678990-63D0-4400-AF2A-C6B2880E4FFB@ccs.neu.edu</A>><BR>>
Content-Type: text/plain; charset="iso-8859-1"<BR>> <BR>>
<BR>> You are making a very good point here, especially the last
one, <BR>> which in a sense exposes the folly of Perlis's maxim (it
is better<BR>> to have one data type with a 100 operations than 10
data types <BR>> with 10 operations each). One, the maxim biases
programmers <BR>> and before they know it, they have introduced bad
dependences <BR>> and performance problems and whoknowswhat.
<BR>> <BR>>
---------------------------------------------------------------<BR>>
<BR>> Having said that, I think Ian's point is equally good. So
here<BR>> is what I am wondering. <BR>> <BR>> Isn't the case
of graphs worth a case study where we define <BR>> a WIDE interface
for graphs and their operations, which we <BR>> can do so with
contracts. Then we implement it in several <BR>> different ways and
conduct performance studies (small and<BR>> large). And we
advertise, which library is good for which <BR>> kind of scenario.
<BR>> <BR>> I am sure that some data structure person has done
this<BR>> for C++ or some such language. The Saarbr?cken MPI 1
comes<BR>> to mind. BUT, I am also sure that we don't have it and
that<BR>> we would benefit from having one. <BR>> <BR>> NOW:
as we conduct this study, we might be able to articulate<BR>>
performance "contracts" (that's probably the wrong word) and<BR>>
possibly learn how to add those to library implementations as<BR>>
a secondary interface. Doing so would once again distinguish<BR>>
Racket from other programming languages. <BR>> <BR>> It is
probably a dissertation, possibly more. <BR>> <BR>> <BR>>
<BR>> <BR>> <BR>> <BR>> <BR>> <BR>> <BR>>
<BR>> <BR>> <BR>> <BR>> <BR>> <BR>> <BR>>
<BR>> <BR>> <BR>> On Dec 4, 2012, at 5:36 AM, Pierpaolo
Bernardi wrote:<BR>> <BR>> > On Mon, Dec 3, 2012 at 5:07 PM,
J. Ian Johnson <<A
href="http://us.mc1133.mail.yahoo.com/mc/compose?to=ianj@ccs.neu.edu"
ymailto="mailto:ianj@ccs.neu.edu">ianj@ccs.neu.edu</A>>
wrote:<BR>> >> Graph algorithms are often meant to be very
fast, and different algorithms necessitate different representations.
Two popular representations are adjacency lists and shared
structures.<BR>> > <BR>> > The representations usually
used in general purpose graphs libraries<BR>> > are adiacency
lists and incidence matrices.<BR>> > <BR>> > Two good
examples that I know of are: Knuth's Stanford GraphBase<BR>>
> (available from his home page and in published book form), and
the<BR>> > Combinatorica library for Mathematica (code available
freely on the<BR>> > net, manual available as a published book
"Computational Discrete<BR>> > Mathematics" by Skiena &
Pemmaraju).<BR>> > <BR>> >> It also isn't right to call
them lists unless you're talking about multigraphs. Indeed successor
nodes should be treated as a set, but Racket's sets have quite a bit
of overhead, especially for small sets. Should it be fast to compute
predecessor nodes? There are too many considerations for there to be
just one blessed representation, IMHO.<BR>> > <BR>> >
Linked lists made of cons pairs are not the best data structure
for<BR>> > every possible use of a sequence data
structure. However, we find<BR>> > this data structure
very useful, don't we? we force them into uses<BR>> > for
which they are not optimal, because of the convenience of
having<BR>> > available a vast library using them. And when we
can't fit them to our<BR>> > purpose we use a more specialized
data structure.<BR>> > <BR>> > I think a similar
compromise for a graph data structure would be very useful.<BR>>
> <BR>> > Cheers<BR>> > P.<BR>> > <BR>> >
____________________<BR>> > Racket Users list:<BR>>
> <A href="http://lists.racket-lang.org/users"
target=_blank>http://lists.racket-lang.org/users</A><BR>> <BR>>
-------------- next part --------------<BR>> A non-text attachment
was scrubbed...<BR>> Name: smime.p7s<BR>> Type:
application/pkcs7-signature<BR>> Size: 4373 bytes<BR>> Desc: not
available<BR>> URL: <<A
href="http://lists.racket-lang.org/users/archive/attachments/20121205/52954024/attachment.p7s"
target=_blank>http://lists.racket-lang.org/users/archive/attachments/20121205/52954024/attachment.p7s</A>><BR>>
<BR>> End of users Digest, Vol 88, Issue 18<BR>>
*************************************<BR>>
____________________<BR>> Racket Users list:<BR>> <A
href="http://lists.racket-lang.org/users"
target=_blank>http://lists.racket-lang.org/users</A><BR><BR></DIV></BLOCKQUOTE></TD></TR></TBODY></TABLE>
<P>
<HR>
<P></P>____________________<BR> Racket Users list:<BR>
http://lists.racket-lang.org/users<BR></BLOCKQUOTE></BODY></HTML>