On Feb 20, 2014 10:33 PM, Neil Toronto neil.toro...@gmail.com wrote:
On 02/20/2014 02:52 PM, as...@racket-lang.org wrote:
asumu has updated `master' from 1f27fb7848 to 1c6c0855f7.
http://git.racket-lang.org/plt/1f27fb7848..1c6c0855f7
=[ 103 Commits
On Feb 21, 2014, at 7:42 AM, Sam Tobin-Hochstadt sa...@cs.indiana.edu wrote:
Since Asumu didn't mention it, the first paper about this is here:
http://www.ccs.neu.edu/racket/pubs/oopsla12-tsdthf.pdf
Yeah, but don't read this. We will share a draft paper that looks more
practical if you
On 02/20/2014 02:52 PM, as...@racket-lang.org wrote:
asumu has updated `master' from 1f27fb7848 to 1c6c0855f7.
http://git.racket-lang.org/plt/1f27fb7848..1c6c0855f7
=[ 103 Commits ]
Directory summary:
3.8%
On 2014-02-20 20:31:56 -0700, Neil Toronto wrote:
How close is this to being able to support, say, the plot library
converted to TR? The OO stuff in it is a few custom classes without
anything complicated, a couple of snip% descendants, and drawing
onto device contexts.
Should be very close.
On 2014-02-20 23:03:22 -0500, Asumu Takikawa wrote:
Should be very close. Not quite there currently because there are two
more chunks that I've written and haven't pushed yet:
* Implicit (mutual) recursive type aliases, so that a `define-type`
can define mutually recursive type alises
This looks fantastic!
Robby
On Thu, Feb 20, 2014 at 10:06 PM, Asumu Takikawa as...@ccs.neu.edu wrote:
On 2014-02-20 23:03:22 -0500, Asumu Takikawa wrote:
Should be very close. Not quite there currently because there are two
more chunks that I've written and haven't pushed yet:
*
On 02/20/2014 09:03 PM, Asumu Takikawa wrote:
On 2014-02-20 20:31:56 -0700, Neil Toronto wrote:
How close is this to being able to support, say, the plot library
converted to TR? The OO stuff in it is a few custom classes without
anything complicated, a couple of snip% descendants, and drawing
On 2014-02-20 21:25:59 -0700, Neil Toronto wrote:
You mean something like this would work?
(define-type (Leaf1 X) (Pair (Leaf2 X) (Leaf2 X)))
(define-type (Leaf2 X) (U X (Pair (Leaf1 X) (Leaf1 X
Yes, that should work. Here's an example interaction from my development
branch:
8 matches
Mail list logo
