This is pretty neat. Without looking too much into the documentation or
implementation, could you briefly elaborate on why these changes are in a
separate package rather than improvements to TR itself?
At a quick glance, you mention doing some sort of static analysis on arguments
in the normal
Have you or someone you know [1] ever thought:
"Gee, I wish Typed Racket could figure out that ___ has type ___.
It's pretty obvious to me."
Then the new "trivial" [2] library is here to help. If you're using basic
arithmetic (+, -, *, /), format strings, or regexp-match, just add a colon
to the
> On Dec 14, 2015, at 1:17 PM, Sam Tobin-Hochstadt wrote:
>
> I think you're looking for
> http://people.cs.uchicago.edu/~jacobm/pubs/topsl.pdf for which an
> extended version appears in the Redex book.
Yep, that’s the one.
Thanks!
John
--
You received this message because you are subscr
I think you're looking for
http://people.cs.uchicago.edu/~jacobm/pubs/topsl.pdf for which an
extended version appears in the Redex book.
Sam
On Mon, Dec 14, 2015 at 4:15 PM, 'John Clements' via Racket Users
wrote:
> I have a pretty clear recollection that someone around here… Ryan? wrote a
> pa
I have a pretty clear recollection that someone around here… Ryan? wrote a
paper based on a tool that produced surveys/quizzes. Perhaps it involved a DSL?
Actually, I’m not so interested in the DSL, but I’m hoping I can borrow some
infrastructure—a survey/quiz contains a sequence of questions, a
5 matches
Mail list logo
