Connecting the dots
Sep. 2nd, 2004 01:28 pmI remember someone at CMU mentioning ongoing research in type-safe genetic programming (my money is on
aleffert or
qedragon). I have spontaneously sprouted an interest in type-safe reflection, and will probably be needing whatever is available in type-safe GP too. Do you guys (or whomever I was speaking with) have a URL handy for current info on this stuff? Or is it still too fresh?
no subject
Date: 2004-09-02 12:12 pm (UTC)Yesterday in conversation the following sentence came into existence:
"I would like to VI a bowel."
We thought you would be amused.
no subject
Date: 2004-09-02 05:04 pm (UTC)type safe reflection
Date: 2004-09-04 03:18 pm (UTC)Pfenning and Nanevski's work on explicit substitutions is (IMHO) the most elegant architecture, but they haven't developed it very far within the context of reflect/reify (they have one JFP preprint covering it, however).
The Cayenne paper on type-safe interpreters is another interesting direction. My personal hunch is that anything less powerful than GTT or UTT (Generalized Type Theory and Universal Type Theory) won't cut it.
I'm trying to adapt Quine's system NF for use as a "type system" (although it is a single-sorted theory of unstratified sets rather than of Russel-Whitehead types). I'm also very tempted to use Positive Set Theory, which has a much more constructive flavor than QNF, but there isn't enough foundational work on that and I don't think I'm qualified to make up for that.
I'm very interested in this stuff, but I generally keep research discussions on archived forums (preferably usenet); blogs have this awful tendency to vanish into nowhere on a regular basis. I read comp.lang.functional about twice a week, or you can email me offline (megacz@cs.berkeley.edu).
- a