I would like to install and use profj in Racket. It would be great if profj
could work like it used to do in PLT 4.1. I downloaded the port by M.
Flatt, and installed it thus:
raco pkg install profj
The tests worked well, but I could not make profj work in drracket. In
fewer words, I could not de
Congrats Stephen!
Marco
On Wed, May 14, 2014 at 9:58 PM, Matthias Felleisen wrote:
>
> It is the season of PhD defenses, and in this spirit, it is my pleasure to
> announce that Stephen Chang successfully defended his PhD at Northeastern.
> Over the past few years, Stephen has maintained some o
On May 14, 2014, at 9:58 PM, Matthias Felleisen wrote:
>
> It is the season of PhD defenses, and in this spirit, it is my pleasure to
> announce that Stephen Chang successfully defended his PhD at Northeastern.
> Over the past few years, Stephen has maintained some of the stepper (with
> John
It is the season of PhD defenses, and in this spirit, it is my pleasure to
announce that Stephen Chang successfully defended his PhD at Northeastern. Over
the past few years, Stephen has maintained some of the stepper (with John) and
the lazy language (with Eli) and has otherwise worked really
I wonder whether a more restricted form of Python would not be acceptable
in situations where speed is critical. I mean, instead of cl-python, that
tries to mimic the semantic of Python closely, the Lisp community could
write a compiler for the subset of Python that the majority of people
really us
Hey all,
I'm getting an odd error from syntax/parse (I think, it might be
racket/match), and I've having trouble tracking down the cause, since the
error isn't giving me a source location. The error is:
/racket/match/define-forms.rkt: ?: expected a clause with a
pattern and a result
at: ()
Sounds good. I'll pin this email for when I can get back to it.
Thanks,
-Ian
- Original Message -
From: Sam Tobin-Hochstadt
To: J. Ian Johnson
Cc: users
Sent: Wed, 14 May 2014 13:18:58 -0400 (EDT)
Subject: Re: [racket] Struct fields in struct-info + match enhancements
Here's my suggesti
Here's my suggestion:
- We add an `extract-extended-struct-info` procedure which always
produces a struct that implements `prop:struct-info` (it's easy to use
a simply struct to wrap the list when needed)
- We change `struct` & `define-struct` to use a structure implementing
`prop:struct-info`, bu
Maybe there was already a way to do this, but I didn't come across it. I like
to be able to preview my Scribble HTML as I'm working on the source. So I built
this capability into my Pollen package:
raco pkg install pollen
cd /path/to/scribble/sources
raco pollen start
Then, when you visit http:
I'm talking about the transformer binding. Specifically the result of
extract-struct-info that both struct-copy and match use in their expansion,
which produces a six-element list that satisfies struct-info?.
This six-element list has
optional identifier bound to type descriptor
optional identifi
On Wed, May 14, 2014 at 12:35 PM, J. Ian Johnson wrote:
> tl;dr if you use struct-info in your programs, I might break them. Please
> continue reading.
>
> I had a PR a while ago suggesting a change to struct-copy due to its
> unhygienic nature with fields. It did not go through since there wasn
tl;dr if you use struct-info in your programs, I might break them. Please
continue reading.
I had a PR a while ago suggesting a change to struct-copy due to its unhygienic
nature with fields. It did not go through since there wasn't enough information
in the struct-info to separate the struct-n
Jens Axel Søgaard writes:
> See my post in this thread 3 days ago. It is attached.
It isn't, but I found it in the thread, thanks! I am mostly interested
in using it as an example for the Racket FFI, given that I know LAPACK
rather well.
> > Transposition can be avoided in many practically rel
On May 14, 2014, at 10:40 AM, Jens Axel Søgaard wrote:
> 2014-05-13 23:24 GMT+02:00 Matthias Felleisen :
>> On May 13, 2014, at 4:19 PM, Neil Toronto wrote:
>>> We need a predicate like
>>>
>>> (: flonum-matrix? (All (A) (-> (Matrix A) Boolean : (Matrix Flonum
>>
>>
>> I think in our wor
2014-05-13 23:24 GMT+02:00 Matthias Felleisen :
> On May 13, 2014, at 4:19 PM, Neil Toronto wrote:
>> We need a predicate like
>>
>> (: flonum-matrix? (All (A) (-> (Matrix A) Boolean : (Matrix Flonum
>
>
> I think in our world of types we could even have
>
> (: flonum-matrix? (All (A) (-> (M
2014-05-14 15:31 GMT+02:00 Konrad Hinsen :
> Neil Toronto writes:
>
> > One thing we should really do is get your LAPACK FFI into the math
> > library and have `flmatrix-solve` use that, but fail over to Racket code
> > systems that don't have LAPACK. If I remember right, it would have to
> > t
Neil Toronto writes:
> My dissertation is on programming languages for Bayesian analysis, which
> can handle arbitrary, possibly recursively defined models and arbitrary
> probabilistic conditions.
I have only skimmed it until now, but it looks like a very important
step in a direction I lik
Greetings.
On 2014 May 13, at 13:36, Matthias Felleisen wrote:
> This is not a misconception. It's an understanding based
> on spending 15 years next to a top-10 department in scientific
> computing, in a computer science department that was spun off
> from that department, and a huge research
Eduardo Costa writes:
> Is there anything in the semantic of Python that makes it much more
> difficult to
> implement a Python compiler than a Racket compiler?
Python is much more dynamic than Racket. As an illustration, look at a simple
operation: addition. In Racket,
(+ a b)
requires
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
I'd like to create a sandbox evaluator that uses a language created in
a submodule. So something like this:
#lang racket
(require racket/sandbox
scribble/eval)
(module+ some-lang
(provide (all-defined-out))
(define #%top-interaction '..
Neil Toronto writes:
> One thing we should really do is get your LAPACK FFI into the math
> library and have `flmatrix-solve` use that, but fail over to Racket code
> systems that don't have LAPACK. If I remember right, it would have to
> transpose the data because LAPACK is column-major.
Jay Kominek writes:
> Perhaps you could add a page to the Racket wiki on github, like the
> intro projects page
> (https://github.com/plt/racket/wiki/Intro-Projects) but which
> covers... "Scientific Racket projects"? Divide it up like "machine
> learning", "statistical analysis", "file forma
If the clients use big-bang, any event will be handled whether or not the
initial state has been received. I have encountered this design problem
numerous times and I sense that we should be able to deal with it more
elegantly than by using [Maybe ProperState]. In the meantime, this is what you
Great, glad it works.
Note however that version 3.10 is not the latest. The latest can only be
obtained via the new package manager (see details in my previous email).
Laurent
On Tue, May 13, 2014 at 10:53 PM, Jérôme Brilland wrote:
> Hi,
>
> I use Racket 5.2.1 (under Debian Stable).
>
> Yes
24 matches
Mail list logo
