This might be one of those areas where we could 'generalize' gradual typing.
On Apr 19, 2014, at 7:37 PM, Sam Tobin-Hochstadt wrote:
On Sat, Apr 19, 2014 at 7:24 PM, Neil Toronto neil.toro...@gmail.com wrote:
Are there type systems that can? It seems like you could specify this type
and
On 2014-04-20 14:38:50 -0400, Matthias Felleisen wrote:
This might be one of those areas where we could 'generalize' gradual
typing.
I think we could do it without fundamentally changing anything about
gradual typing.
The issue is that uniform rest args assume that the type is always a
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
Sorry guys, I had something different in mind.
When I ask people to port my typical 'Hell' code, I tend to
suggest that all XML-related code should stay in Untyped. In
most cases this kind of S-expression manipulation is hairy
from an ordinary TR pov but has a simple interface to the
Typed
Are there type systems that can? It seems like you could specify this
type and similar ones using regular expressions.
In my research, I'll probably use regular expressions to represent sets
of strings. I've been curious about how well regular-expression-like
things generalize to cartesian
On Sat, Apr 19, 2014 at 7:24 PM, Neil Toronto neil.toro...@gmail.com wrote:
Are there type systems that can? It seems like you could specify this type
and similar ones using regular expressions.
There is lots of work on types for XML specification that can handle
this sort of thing, I believe,
6 matches
Mail list logo
