* Jason Dagit <[EMAIL PROTECTED]> [081123 17:00]: > Hello, > Today I read an interesting paper that may provide us with an elegant > solution to the unwieldy nature of [DarcsFlag]. The paper is here: > http://www.cs.rutgers.edu/~ccshan/prepose/prepose.pdf > > The solution I have in mind based on that, is to split DarcsFlag off into > different types that are thematically related chunks. Then, as the authors > use different moduli in their modular arithmetic examples we could different > thematic chunks where appropriate. > > At least in principle it seems possible. I have yet to convince myself that > it is "the way". > > If nothing else, it's a rather interesting paper where the authors show how > to turn any value which can be serialized into a type and back again. Thus > simulating dependent types.
Oh no, a paper by oleg :) I will take a while to grok it, thanks for the hint! Christian -- You may use my gpg key for replies: pub 1024D/47F79788 2005/02/02 Christian Kellermann (C-Keen)
pgptt0w7cOUcm.pgp
Description: PGP signature
_______________________________________________ darcs-users mailing list [email protected] http://lists.osuosl.org/mailman/listinfo/darcs-users
