[racket-users] Places performance & channel capacity

[Andreas Olsson]

A late answer but I made a parallel map implementation you might try. 
https://pkgs.racket-lang.org/package/pmap

-- 
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.
For more options, visit https://groups.google.com/d/optout.

Re: [racket-users] Data contract for non-empty hash?

[Jon Zeppieri]

Predicates can be used as contracts, so:

(define (non-empty-hash? x)
  (and (hash? x)
   (not (hash-empty? x

Then you can use `non-empty-hash?` as your contract.



On Mon, Jun 12, 2017 at 3:56 PM, David Storrs  wrote:
> There is a non-empty-listof contract but no non-empty-hashof contract.  Is
> there a way to build one?
>
> --
> 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.
> For more options, visit https://groups.google.com/d/optout.

-- 
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.
For more options, visit https://groups.google.com/d/optout.

[racket-users] Data contract for non-empty hash?

[David Storrs]

There is a non-empty-listof contract but no non-empty-hashof contract.  Is
there a way to build one?

-- 
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.
For more options, visit https://groups.google.com/d/optout.

[racket-users] Removing undocumented exports of rackunit/text-ui

[Jack Firth]

The rackunit/text-ui module[1] provides `run-tests` along with a handful of 
other random undocumented functions with unclear purposes such as 
`display-ticker`. I have a PR to rackunit open[2] that removes the undocumented 
exports (it does *not* remove `run-tests`). So far I've found no callers of 
these functions with Github search, but if you happen to use them please speak 
up so I don't merge a PR that breaks your code. If you have historical insight 
into this module and these exports, please comment on the PR so I know more 
about what I'm removing.

[1] 
http://docs.racket-lang.org/rackunit/api.html?q=rackunit%2Ftext-ui#%28mod-path._rackunit%2Ftext-ui%29
[2] https://github.com/racket/rackunit/pull/34

-- 
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.
For more options, visit https://groups.google.com/d/optout.

[racket-users] (seventh RacketCon), Oct 7-8 @ Seattle: tickets, speakers, sponsors

[Matthew Butterick]

TICKETS

Tickets are now available for (seventh RacketCon), which happens at the 
University of Washington in Seattle on Oct 7-8, a beautiful autumn weekend.

Conference page: http://con.racket-lang.org/ 
Direct ticket link: 
https://www.eventbrite.com/e/racketcon-2017-tickets-34928590354 


Early-bird tickets are $75 ($45 for students), a discount of 25% from the 
late-bird price of $100 / $60. (Though we won't stop the virtuous and generous 
from paying full price now.)


SCHEDULE

This year, RacketCon is TWO days long. Because if we're all going to Seattle 
for the weekend, why cut the party short? First day: the usual mix of erudition 
and comedy, delivered by a series of fine speakers. Our keynoters will be Dan 
Friedman & Will Byrd. Second day: Racketeer Office Hours, where we get to enact 
IRL the epic software dramas that today are restricted to mailing lists and 
GitHub issues.

It's all on the conference web page: http://con.racket-lang.org/ 



SPEAKERS

Though our speaker roster is already the best ever, we still have room for a 
few more. Let's see some new faces this year. EVERYONE who works with Racket 
has something interesting to say about it. If you've been to one or two or 
three RacketCons — let this be the year that you step up to the stage.

Email the boss of the speaker schedule, Vincent St-Amour: 
stamo...@eecs.northwestern.edu 


SPONSORS

You should be a sponsor! Because what would RacketCon be without sponsors? I'll 
tell you: we'd be meeting at an Airbnb in Brookline, sharing a bag of Trader 
Joe's tortilla chips and some DD munchkins. Ticket prices don't cover the full 
costs of this fantastic event. As I mentioned at 6RC, I basically treat Racket 
as my personal money-printing machine. So it's with great pleasure that I 
raised my sponsorship level to $3000 this year. But it's not JUST about the 
catering. Rather, it's an easy way to give something back to this tremendous 
project, for which I pay nothing the other days of the year. Nor do you. So 
whether you have $500 or $5000, RacketCon will gladly take your money, and list 
you as a sponsor.

Email the boss of sponsor opportunities, also Vincent St-Amour: 
stamo...@eecs.northwestern.edu 


-- 
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.
For more options, visit https://groups.google.com/d/optout.

RE: [racket-users] Turing machines

[Jos Koot]

Hi Damien

Right, interesting only for the theory.
But also a lot of fun to play with.

Did you see my example of a TM for binary addition of two arbitrary large 
numbers?
It has 13 states (of which only 9 are essential)
and 51 rules (of which only 27 are essential)
The test includes 50 tests with binary encodings of numbers (random 3000).
All tests together take about 5 seconds on my simple PC,
(conversion between exact-nonnegative-integers and their binary encodings 
included)

https://github.com/joskoot/turing.

It took me two days to find out why the UTM
presented by Hopcroft and Ullman does not work
(in their 1969 edition of "Formal Languages and their Relation to Automata")
May be these errata have been corrected in more recent editions,
but I have no free access to them to check this.
May be someone can tell me?
 
Thanks for your reply, Jos

-Original Message-
From: racket-users@googlegroups.com [mailto:racket-users@googlegroups.com] On 
Behalf Of Damien MATTEI
Sent: lunes, 12 de junio de 2017 14:36
To: racket-users@googlegroups.com
Subject: Re: [racket-users] Turing machines

snip

Interesting but from a theoretical point of view, when i was student i 
programmed a Turing machine emulator in PASCAL (still
somewhere on the net) ,
and as example i started to code in Turing states a 8bit addition number, i 
stopped near the 4th bits, there was so many states...
it is interesting for students but for the theory only.

Damien

-- 
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.
For more options, visit https://groups.google.com/d/optout.

Re: [racket-users] Turing machines

[Damien MATTEI]

Le Saturday 10 June 2017 22:50:19 Jos Koot, vous avez écrit :
> To whom is interested.
> 
> Jay McCarthy has a nice page about how to program Turing machines:
> http://jeapostrophe.github.io/2013-10-29-tmadd-post.html.
> 
> Because I did not immediately see his implementation of producing a Turing 
> machine as a Racket procedure,
> I made one myself : https://github.com/joskoot/turing such as to play with 
> his ideas.
> 
> My version contains much material inspired by Jay McCarthy, but goes further,
> as far as including a universal Turing machine in the document
> https://github.com/joskoot/turing/blob/master/make-TM.scrbl.
> 
> The documentation is long because it contains many elaborated examples.
> Although the Turing machines produced by my procedure make-TM are very fast,
> producing the documentation from make-TM.scrbl may take up to 30 seconds on 
> my simple computer.
> You may need 1 Mbyte or more to run my modules. I use 4 Mbytes.
> 
> Hope you enjoy it.
> Criticisme welcome, of course,
> Jos
> 
> 
> 

Interesting but from a theoretical point of view, when i was student i 
programmed a Turing machine emulator in PASCAL (still somewhere on the net) ,
and as example i started to code in Turing states a 8bit addition number, i 
stopped near the 4th bits, there was so many states...
it is interesting for students but for the theory only.

Damien

-- 
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.
For more options, visit https://groups.google.com/d/optout.

[racket-users] 1st Call for Papers IFL 2017

[jurriaanh...@gmail.com]

Hello,

Please, find below the first call for papers for IFL 2017.
Please forward these to anyone you think may be interested.
Apologies for any duplicates you may receive.

best regards,
Jurriaan Hage
Publicity Chair of IFL

---

IFL 2017 - CALL FOR PAPERS
==

29th SYMPOSIUM ON IMPLEMENTATION AND APPLICATION OF FUNCTIONAL LANGUAGES


University of Bristol, UK

In cooperation with ACM SIGPLAN

Wednesday 30 August - Friday 1 September, 2017

http://iflconference.org/

Scope
-

The goal of the IFL symposia is to bring together researchers actively
engaged
in the implementation and application of functional and function-based
programming languages. IFL 2017 will be a venue for researchers to present
and
discuss new ideas and concepts, work in progress, and publication-ripe
results
related to the implementation and application of functional languages and
function-based programming.

Peer-review
---

Following the IFL tradition, IFL 2017 will use a post-symposium review
process
to produce the formal proceedings. All participants of IFL 2017 are invited
to
submit either a draft paper or an extended abstract describing work to be
presented at the symposium. At no time may work submitted to IFL be
simultaneously submitted to other venues; submissions must adhere to ACM
SIGPLAN's republication policy:

http://www.sigplan.org/Resources/Policies/Republication

The submissions will be screened by the program committee chair to make sure
they are within the scope of IFL, and will appear in the draft proceedings
distributed at the symposium. Submissions appearing in the draft proceedings
are not peer-reviewed publications. Hence, publications that appear only in
the
draft proceedings are not subject to the ACM SIGPLAN republication policy.
After the symposium, authors will be given the opportunity to incorporate
the
feedback from discussions at the symposium and will be invited to submit a
revised full article for the formal review process. From the revised
submissions, the program committee will select papers for the formal
proceedings considering their correctness, novelty, originality, relevance,
significance, and clarity. The formal proceedings will appear in the
International Conference Proceedings Series of the ACM Digital Library.

Important dates
---

Mon 31 July 2017 : Submission deadline draft papers
Wed  2 August   2017 : Notification of acceptance for presentation
Fri  4 August   2017 : Early registration deadline
Fri 11 August   2017 : Late registration deadline
Mon 21 August   2017 : Submission deadline for pre-symposium proceedings
Wed 30 August   2017 - Fri 1 September 2017 : IFL Symposium
Mon  4 December 2017 : Submission deadline for post-symposium proceedings
Wed 31 January  2018 : Notification of acceptance for post-symposium
proceedings
Mon 12 March2018 : Camera-ready version for post-symposium proceedings

Submission details
--

Prospective authors are encouraged to submit papers or extended abstracts
to be
published in the draft proceedings and to present them at the symposium. All
contributions must be written in English. Papers must use the new ACM two
columns conference format, which can be found at:

http://www.acm.org/publications/proceedings-template

For the pre-symposium proceedings we adopt a 'weak' page limit of 12 pages.
For
the post-symposium proceedings the page limit of 12 pages is firm.

Authors submit through EasyChair:

https://easychair.org/conferences/?conf=ifl2017

Topics
--

IFL welcomes submissions describing practical and theoretical work as well
as
submissions describing applications and tools in the context of functional
programming. If you are not sure whether your work is appropriate for IFL
2017,
please contact the PC chair at nicolas...@bristol.ac.uk. Topics of interest
include,
but are not limited to:

- language concepts
- type systems, type checking, type inferencing
- compilation techniques
- staged compilation
- run-time function specialization
- run-time code generation
- partial evaluation
- (abstract) interpretation
- metaprogramming
- generic programming
- automatic program generation
- array processing
- concurrent/parallel programming
- concurrent/parallel program execution
- embedded systems
- web applications
- (embedded) domain specific languages
- security
- novel memory management techniques
- run-time profiling performance measurements
- debugging and tracing
- virtual/abstract machine architectures
- validation, verification of functional programs
- tools and programming techniques
- (industrial) applications

Peter Landin Prize
--

The Peter Landin Prize is awarded to the best paper presented at the
symposium
every year. The honored article is selected by the program committee based
on
the submissions received for the formal review process. The prize carries a
cash award equivalent to 150