I have been thinking about the discussion of queryable programs from
Rich's keynote at Clojure Conj. This meaning of this idea is probably more
well-defined for other people than it is in my present understanding, but
my sense from the talk is that the analysis phase of compilation will
leverage
On Sun, Nov 20, 2011 at 11:53 AM, Robert Levy r.p.l...@gmail.com wrote:
See: http://gallium.inria.fr/~naxu/research/dana-phd.pdf
What do you think about this idea? I have just started reading the above
pdf... I don't see much of interest when googling for 'static contract
Racket' but that
