I tried to build the git HEAD today and ran into problems. During the make
process, it fails to create the framework with the following error message:
gcc -o Racket.framework/Versions/5.1.1.3/Racket -m32 -pthread -framework
CoreFoundation -dynamiclib -all_load libracket.a libmzgc.a -ldl -lm
headers of one installation
get mixed with the lib of the other.
At Thu, 21 Apr 2011 21:42:54 -0400, Eric Dobson wrote:
I tried to build the git HEAD today and ran into problems. During the make
process, it fails to create the framework with the following error message:
gcc -o
have files leftover from a previous build that had different flags from
`configure'?
If not, can you show the compile line for string.c?
At Thu, 21 Apr 2011 22:01:31 -0400, Eric Dobson wrote:
I don't have any *FLAGS variables set in my environment when I run configure
or
make. But I do
I have added support for ephemerons to Typed Racket, and submitted a pull
request on Github (https://github.com/plt/racket/pull/5). This patch is
supposed to fix PR 11633.
Is there anything else I should do to get this patch integrated?
-Eric
_
The tests all pass (for me).
-Eric
On Tue, Apr 26, 2011 at 2:54 PM, Sam Tobin-Hochstadt sa...@ccs.neu.edu wrote:
On Tue, Apr 26, 2011 at 2:19 PM, Eric Dobson eric.n.dob...@gmail.com wrote:
I have added support for ephemerons to Typed Racket, and submitted a pull
request on Github (https
As a sample of OS X (10.7) applications I looked at Chrome, Safari, Terminal
and Adium. In all of them Command-W did 'close tab' and Shift-Command-W did
'close window'. In the first three they are actually called that, Adium uses
'close chat' and 'close'. Given that Safari and Terminal are
I regularly build racket from HEAD on OS X with no problems, but
tonight I decided to try the 64 bit version and couldn't get it to
compile. The error I got was:
Undefined symbols for architecture x86_64:
_iconv_close, referenced from:
_close_converter in libracket.a(string.o)
23:19:32 -0700, Eric Dobson wrote:
I am trying to implement a WebKit panel in Racket, and am running in to some
trouble with the windowing API. I cannot get resizing to work. In OS X it
looks like it is supposed to be enabled by default so I assume racket is
changing it so that it can do its
Actually I don't think this is an over sight. The null string is a String.
And Path-String is Path U String, but (path-string? (string #\null)) = #f.
Sent from a mobile device.
On Mar 21, 2012 5:14 PM, John Clements cleme...@brinckerhoff.org wrote:
On Mar 21, 2012, at 3:20 PM, Sam
I am adding the contract combinators free-id-table/c and
bound-id-table/c, and working on the tests for them. It would make
sense to put them in tests/racket/id-table-tests.rkt, but
tests/racket/contract-test.rkt has many testing combinators for
contracts that would be useful. Is it reasonable to
The docs on when a value is a chaperone of another are confusing and
don't seem to match the implementation.
They seem to say that (and (not (chaperone? a)) (not (chaperone? b))
(equal? a b)) implies (chaperone-of? a b) but this does not seem to
hold.
They also change behavior if I switch from a
Dictionaries provide an iteration interface with the primitive operations:
dict-iterate-first: Dict - (U #f Iterator)
dict-iterate-next: Dict Iterator - (U #f Iterator)
dict-iterate-key: Dict Iterator - Key
dict-iterate-value: Dict Iterator - Value
This interface matches the hash interface and
#lang typed/racket
(: vector-first (All (A B) ((U (Vectorof A) (Vectorof B)) - (U A B
(define (vector-first vs)
(vector-ref vs 0))
I doubt this will typecheck without more work in the typechecker. The
issue is that it should work for a union type of as many vectors as
you want.
If there
No it is not possible to type flatten.
Consider having flatten with this type:
(define-type (Listof* A) (Rec T (U A (Listof T
(: flatten (All (A) ((Listof* A) - (Listof A
And then applying it as such:
((inst flatten (Listof Number)) (list (list 1 2 3)))
This would typecheck and return
That should be safe.
The issue is that TR cannot do it currently, because it doesn't
understand that (foo A) and (exists B. (bar B)) = (bar A). It instead
reduces this to (exists B. (bar B)) and then to (bar Nothing).
I'm working on some stuff that might make that easier to teach it the
correct
The issue as I see it is that call/cc can replace all the code above a
prompt with a continuation captured from above a different prompt.
This can break the invariants that TR wants to enforce.
I proposed to Asumu on IRC the follow adjustment which I think gets
all the behavior that is wanted.
I have recently installed a version of vim with the mzscheme option
enabled. And it sortof works except that some times it segfaults or has
other memory corruption issues. So I enabled MZ_GC_CHECK when compiling
vim, and now I get the corruption every single time on startup.
Here is the output
+correct vim group.
On Mon, Dec 10, 2012 at 10:25 PM, Eric Dobson eric.n.dob...@gmail.comwrote:
I have recently installed a version of vim with the mzscheme option
enabled. And it sortof works except that some times it segfaults or has
other memory corruption issues. So I enabled MZ_GC_CHECK
I figured this out. It was that vim was not being compiled with the precise
garbage collection when racket was, and a couple of bugs on the vim
allocation of racket objects. I'll hopefully have a patch soon.
On Mon, Dec 10, 2012 at 10:32 PM, Eric Dobson eric.n.dob...@gmail.comwrote:
+correct
I have a program which is thread 'heavy' and runs much slower in embedded
racket (vim) than it does in pure racket.
The program: (note no #lang, as I'm doing this in the repl)
(require racket/async-channel)
(define (make-passer in)
(define chan (make-async-channel))
(thread (lambda ()
That fixed it. It is still a bit slower but it is now much closer and good
enough for me.
(0.945068359375 1.10400390625 0.961181640625)
On Fri, Dec 14, 2012 at 5:28 AM, Matthew Flatt mfl...@cs.utah.edu wrote:
At Thu, 13 Dec 2012 22:57:54 -0800, Eric Dobson wrote:
I have a program which
, 2012 at 9:20 AM, Eric Dobson eric.n.dob...@gmail.comwrote:
I figured this out. It was that vim was not being compiled with the
precise garbage collection when racket was, and a couple of bugs on the vim
allocation of racket objects. I'll hopefully have a patch soon.
Are you talking about
It is getting exactly the same file as R, except there is a special file in
the TR code that gives types to some bindings (all of the ones from
racket). Your new module's bindings are not in this file.
https://github.com/plt/racket/blob/master/collects/typed-racket/base-env/base-env.rkt
On Mon,
lambda supports optional arguments, and does this by expanding out into a
core form that has flag arguments for if each argument is supplied. This is
tricky to type in TR and so I was investigating why it did it this way. I
did a micro benchmark on another method of expansion and it was 60%
for a.
On Sun, Feb 24, 2013 at 11:14 AM, Matthew Flatt mfl...@cs.utah.edu wrote:
At Sun, 24 Feb 2013 09:51:12 -0800, Eric Dobson wrote:
lambda supports optional arguments, and does this by expanding out into a
core form that has flag arguments for if each argument is supplied
There have been a couple recent bug reports because certain features
need a type, such as cast and define-predicate.
I was wondering whether TR/no-check should check that the types are
well formed, but not check that the expressions are well typed? I'm
thinking this would be less surprising to
Can we make it so that IP addresses are immutable? This would require
changing make-ip-address to have a call to make-immutable-bytes in
each case.
On Thu, Apr 4, 2013 at 10:07 AM, as...@racket-lang.org wrote:
asumu has updated `master' from 8246d073c0 to 92102a2f07.
Sorry make-immutable-bytes should be bytes-immutable-bytes.
On Thu, Apr 4, 2013 at 10:29 AM, Eric Dobson eric.n.dob...@gmail.com wrote:
Can we make it so that IP addresses are immutable? This would require
changing make-ip-address to have a call to make-immutable-bytes in
each case.
On Thu
I'm having trouble finding any file with that name in the repo, do you
know the full path?
On Sat, Apr 6, 2013 at 2:07 PM, Robby Findler
ro...@eecs.northwestern.edu wrote:
I'm getting this error when I rebuild (sometimes). It doesn't seem to happen
in drdr and so maybe it happens only when some
You shouldn't be able to send the TR into an inifinite loop.
Typechecking is supposed to terminate. Please try to reduce it to the
minimum testcase and file a bug.
On Thu, Apr 11, 2013 at 3:32 PM, Danny Yoo d...@hashcollision.org wrote:
Perhaps something like this?
;
#lang
LGTM, can you submit a testcase or at least a bug so that we can add a
test case for this code path?
On Mon, Apr 29, 2013 at 4:42 PM, Danny Yoo d...@hashcollision.org wrote:
I believe the right fix for this is:
I submitted a commit on Thursday which changed the contract generation
code, to introduce the buggy behavior. So thats why there wasn't an
error until now. It should be during module compilation where the
error is raised, so that should narrow it down. I'll try to take a
look tonight if you cannot
The mutability argument does not hold in Racket. non eq? things can be
mutated and affect each other using chaperones and impersonators.
On Sat, May 4, 2013 at 5:27 PM, John Gateley rac...@jfoo.org wrote:
Personal opinion: performance is a dangerous motivator. Yes, it is
a necessity, but it is
Keywords are normally right because
they are syntactically distinct from expressions --- and so using a
keyword avoids various potential ambiguities and sources of confusion.
Isn't this only true for default bindings of #%datum? It seems like
macros which assume this lose compatibility with
On Mon, May 13, 2013 at 2:14 PM, as...@racket-lang.org wrote:
asumu has updated `master' from a857256c77 to f3e6276f9b.
http://git.racket-lang.org/plt/a857256c77..f3e6276f9b
=[ One Commit ]=
Directory summary:
29.0%
This doesn't pass with contract checking enabled. make-StructTop
requires a Struct? not any old Type?. Is there a reason that the type
is not just bottom?
On Sun, May 19, 2013 at 5:33 PM, as...@racket-lang.org wrote:
asumu has updated `master' from d9102ac7e7 to 3eb4a75613.
I'm not sure I follow on why binary packages make it easier to reduce
dependencies between packages, or why binary packages offer faster
installs.
I'm guessing that binary packages prevent cyclic dependencies between
packages, but it seems like there are many other options that still
get this
On Tue, May 21, 2013 at 4:29 AM, Jay McCarthy jay.mccar...@gmail.com wrote:
On Mon, May 20, 2013 at 10:05 PM, Eric Dobson eric.n.dob...@gmail.com wrote:
I'm not sure I follow on why binary packages make it easier to reduce
dependencies between packages, or why binary packages offer faster
want to use
tools written in Racket, and the fact that the tools are written in
Racket is immaterial to them. They should be able to have just the
binary versions.
On Wed, May 22, 2013 at 12:30 PM, Eli Barzilay e...@barzilay.org wrote:
Yesterday, Eric Dobson wrote:
On Tue, May 21, 2013 at 4:29
Some modules have macros which expand into identifiers that are not
exported, as they want to protect those bindings. TR currently has the
following code which allows it to generate an identifier which is
free-identifier=? to what would appear in the output of the macros.
define
/2013 01:57 AM, Eric Dobson wrote:
Some modules have macros which expand into identifiers that are not
exported, as they want to protect those bindings. TR currently has the
following code which allows it to generate an identifier which is
free-identifier=? to what would appear in the output
be
quicker.
On Thu, May 23, 2013 at 8:43 PM, Eric Dobson eric.n.dob...@gmail.com
wrote:
Isn't that exactly what free-indentifier=? is checking for on
identfiers with a module level binding? Or is there something else it
does?
On Thu, May 23, 2013 at 3:13 PM, Carl Eastlund c...@ccs.neu.edu wrote
What does unique mean in this context? Does probabilistically unique
work? If so could you form an identifier with the symbolic form
unique-id-+UUID?
On Fri, May 31, 2013 at 8:20 AM, Carl Eastlund c...@ccs.neu.edu wrote:
I'm having trouble creating identifiers that are unique with respect to
On Fri, May 31, 2013 at 9:27 AM, Eric Dobson eric.n.dob...@gmail.com
wrote:
What does unique mean in this context? Does probabilistically unique
work? If so could you form an identifier with the symbolic form
unique-id-+UUID?
On Fri, May 31, 2013 at 8:20 AM, Carl Eastlund c...@ccs.neu.edu wrote
I don't think this is the right fix to the issue. A core issue (there
may be more) is that calls to subtype during the dynamic extent of a
call to subtype take the same current-seen list as is the current
state of the outer subtype call. This works well when this is supposed
to be part of the same
I'm not sure about the exact problem. But I have some work for the TR
unit tests that make it use a saner way of running the tests, and it
allows for the TR syntax properties to be gensyms. It will likely be a
week or two until they are in HEAD (tons of commits that need to be
cleaned up and
I believe that TR will not look for the struct type descriptor if it
is not in the static struct-info, so removing that might be another
option. Especially since if it isn't provided from the module
regularly.
On Tue, Aug 6, 2013 at 4:21 PM, Matthias Felleisen matth...@ccs.neu.edu wrote:
That
On Thu, Aug 8, 2013 at 9:50 AM, as...@racket-lang.org wrote:
asumu has updated `master' from a8405eb77d to 24e55c1faa.
http://git.racket-lang.org/plt/a8405eb77d..24e55c1faa
=[ 2 Commits ]==
Directory summary:
76.4%
I have ideas to remove about the contracts from TR code, but currently
that is only prototyped.
Example:
#lang typed/racket
(provide f)
(: f (Number - Number))
(define (f x) x)
Currently f is exported with the contract (number? . - . number?),
but this can be safely reduced to (number . - .
9, 2013 at 7:14 PM, Eric Dobson eric.n.dob...@gmail.com
wrote:
I have ideas to remove about the contracts from TR code, but currently
that is only prototyped.
Example:
#lang typed/racket
(provide f)
(: f (Number - Number))
(define (f x) x)
Currently f is exported with the contract
No it is not easy.
It should all be there in the expanded output. TR stores the type of
an expression in a hashtable on the side, see
https://github.com/plt/racket/blob/master/pkgs/typed-racket-pkgs/typed-racket-lib/typed-racket/types/type-table.rkt#L34.
So if you did
#lang racket
(require
Removing the return value checking is in the works. It actually is
removing all of the checks that would blame typed code, so higher
order functions/datastructure get improvements too. It is actually
functional the last time I checked, but lacking documentation which is
what is holding up merging
to see your changes
and Robby's together. :D)
Neil ⊥
On 12/12/2013 12:40 AM, Eric Dobson wrote:
Removing the return value checking is in the works. It actually is
removing all of the checks that would blame typed code, so higher
order functions/datastructure get improvements too
... I'd love to see your changes
and Robby's together. :D)
Neil ⊥
On 12/12/2013 12:40 AM, Eric Dobson wrote:
Removing the return value checking is in the works. It actually is
removing all of the checks that would blame typed code, so higher
order functions/datastructure get improvements too
time: 138 gc time: 7
cpu time: 145 real time: 144 gc time: 7
cpu time: 140 real time: 140 gc time: 6
cpu time: 151 real time: 150 gc time: 6
cpu time: 139 real time: 138 gc time: 6
cpu time: 139 real time: 139 gc time: 8
On Thu, Dec 12, 2013 at 12:33 PM, Eric Dobson eric.n.dob
posting a little program, like the ones below that generates a case- so we
can play around with it to see?
Robby
On Tue, Jan 14, 2014 at 11:27 AM, Eric Dobson eric.n.dob...@gmail.com
wrote:
The changes to TR contract generation are now in at HEAD.
If you can find any cases where
A common issue I have is that the default error handler does not
display error message's exn:srcloc if it has it
racket -e (require racket/match) -e (match 2)
=
match: no matching clause for 2
context...:
/Users/endobson/proj/rnacket/plt/racket/collects/racket/match/runtime.rkt:21:0:
mode to see if you're happy with the results (and I can help
change them if you're not happy with them).
Robby
On Thu, Mar 13, 2014 at 8:34 PM, Matthew Flatt mfl...@cs.utah.edu wrote:
At Wed, 12 Mar 2014 18:05:03 -0700, Eric Dobson wrote:
A common issue I have is that the default error
integers.
On Wed, Mar 26, 2014 at 9:46 AM, Eric Dobson eric.n.dob...@gmail.com wrote:
This push has started breaking the random TR tests. I think the issue
is that TR assumed that redex wouldn't generate so large numbers that
it exceeded the flonum range. Could that have changed in this commit
Do we have a performance test case which shows improvment with this change?
On Mon, Mar 31, 2014 at 3:21 PM, as...@racket-lang.org wrote:
asumu has updated `master' from 6722b7a71e to 92b0e86ed1.
http://git.racket-lang.org/plt/6722b7a71e..92b0e86ed1
=[ One Commit
My understanding is that since it is pushed to master, you don't, as
it can mess up other peoples repositories. Given that there are no
other commits besides yours on top of it, it may not be impossible,
but probably not worth the effort. Some one may correct me though.
On Tue, Apr 1, 2014 at
I have seen multiple times changes in TR not getting properly
propogated to TR programs in my debugging, and I finally have found a
repeatable example.
I am under the impression that if I compile a file and then change a
(transitive) dependency of it, then it should have to be recompiled,
but I
. That's why a `raco
make` in d29df205f7 tries to recompile pr12644.rkt.
At Thu, 3 Apr 2014 09:41:19 -0700, Eric Dobson wrote:
I have seen multiple times changes in TR not getting properly
propogated to TR programs in my debugging, and I finally have found a
repeatable example.
I am under
I have seen a crash that looks like this twice recently.
Seg fault (internal error during gc) at 0x19fd08000
I reran the same program and would not get the crash again. Is there
anything that I can do to turn something like this into an
actionable/useful bug report?
_
DrDr seems to be behind by about 8 pushes (in terms of what it is
showing in the UI) currently and is stuck running on push 28468 for 36
hours.
_
Racket Developers list:
http://lists.racket-lang.org/dev
it
doesn't is worse.
Sam
On Sat, Apr 5, 2014 at 8:13 AM, Robby Findler
ro...@eecs.northwestern.edu wrote:
raco make x.rkt racket x.rkt
Robby
On Fri, Apr 4, 2014 at 11:16 PM, Eric Dobson eric.n.dob...@gmail.com
wrote:
Great that explains it and with that information I was able
Asumu has a rough draft of a commit that would allow this to work, I
don't know the current status though.
https://github.com/plt/racket/pull/564
I was thinking about the problem and I think our current union types
and recursive types covers a lot of ground.
For example as one user wanted to
Doesn't this make the dead clauses return void the function instead of
void the value? Not that they ever should run.
On Fri, Apr 25, 2014 at 10:45 AM, stamo...@racket-lang.org wrote:
stamourv has updated `master' from b40619ffd5 to ce3033a0c7.
6f56948cff75dd4497b742ae01cd5df18c654e6f
- The contract boundary between typed/untyped modules is much less expensive.
dd8b646b0b3a0fd7905467f275f0f786eac958dd
- Occurrence typing now works better with when/unless.
Example:
(let ((x (read)))
(unless (number? x) (error 'bad-input))
(add1 x))
wrote:
On 05/26/2014 09:21 AM, endob...@racket-lang.org wrote:
9efa4af Eric Dobson endob...@racket-lang.org 2014-05-16 08:13
:
| Make initial version of structural type recursion, and use it.
:
A
pkgs/typed-racket-pkgs/typed-racket-lib/typed-racket/types/structural.rkt
M .../typed
at 9:15 PM, Eric Dobson eric.n.dob...@gmail.com wrote:
+dev in case others have likely insights.
Recap:
TR's with contracts unit test is failing. I have diagonsed the issue
to the bindings in the test case are not the same as expected, and
syntax parse doesn't match them. I have made
I don't think that TR should provide the majority of the optimizations
in its current form because it has to run before inlining, and this
limits what it can do.
Here is an example program:
#lang typed/racket
(: my-sequence-map
(All (A B)
(case-
((A - B) (Vectorof A) - (Vectorof
, Eric Dobson eric.n.dob...@gmail.com wrote:
Cases like this make me think that we need something stronger than context
free
rewrite rules over the ast/bytecode.
On May 29, 2014, at 1:19 AM, Matthew Flatt mfl...@cs.utah.edu wrote:
Ok, I see. I'll revise my comment to this would be better done
One of the slowest parts when using TR is the contract boundary
between untyped and typed code. Even with recent changes it still
causes a large overhead.
Example:
#lang racket/load
(module lib typed/racket
(provide f g)
(: f (Symbol - (Boxof Symbol)))
(define (f x) (box x))
(: g ((Boxof
On Mon, Jun 9, 2014 at 2:44 PM, Matthias Felleisen matth...@ccs.neu.edu wrote:
On Jun 9, 2014, at 9:38 AM, Sam Tobin-Hochstadt sa...@cs.indiana.edu wrote:
On Mon, Jun 9, 2014 at 3:19 AM, Eric Dobson eric.n.dob...@gmail.com wrote:
It would be nice if the contract on the input to g could
as checking the entire list.
If we could do that reduction we would get a large speedup.
On Mon, Jun 9, 2014 at 10:01 AM, Neil Toronto neil.toro...@gmail.com wrote:
On 06/09/2014 10:25 AM, Neil Toronto wrote:
On 06/09/2014 01:19 AM, Eric Dobson wrote:
Does this seem like a reasonable thing
On Tue, Jun 10, 2014 at 6:15 AM, Matthias Felleisen
matth...@ccs.neu.edu wrote:
On Jun 9, 2014, at 6:02 PM, Eric Dobson eric.n.dob...@gmail.com wrote:
Eric, are you talking about changing the proxy values that wrap HO/mutable
contracted values?
Yes. I want the proxy values to include
On Tue, Jun 24, 2014 at 3:17 PM, stch...@racket-lang.org wrote:
stchang has updated `master' from 49ff6d3c84 to 500745f41b.
http://git.racket-lang.org/plt/49ff6d3c84..500745f41b
=[ One Commit ]=
Directory summary:
7.5%
I'm trying to improve the compilation speed of some modules, and to do that
I need to understand how raco make is spending its time.
I decided to call parallel-compile-files myself with a handler that gets
the time of start and done messages, and then turn those into a timeline
plot.
I have a
This change seemed to change the format of .dep files, likely as intended
to add the indirect dependencies. Is there any documentation of what the
format is supposed to be? Currently I've just been trying to read cm.rkt
and understand how it treats them.
On Thu, Jan 8, 2015 at 9:31 AM,
80 matches
Mail list logo
