Thanks, actually. My brain one-tracks itself too often to handle everything.
In the meanwhile, I'm taking a look at the paper below, "Integrating Nominal and Structural Subtyping". If its type-system works the way I intuit it does, I might be able to tear out both existential types and sum types from Deca and replace them with something more familiarly object-oriented-looking. The bit-level implementation would work a lot like Deca's current existentials and extensible sum types, but the syntax would transform to become more Scala-like (I really like Scala) and I could substitute class extension for existential packaging.
http://dl.acm.org/citation.cfm?id=1428525
EDIT: Confirmed. I can tear out existential types, sum types, and recursive types for a single, intuitive, object-oriented-style type construct.
Figuring out what type classes have to do with implicit parameters will take more than one afternoon of reading. It seems I can't read the other paper because I'm not an ACM member. But I guess Deca is going to be delayed again? :)
Thanks for the link. I need to remember to look harder when I hit paywalls.
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.124....
http://hasp.cs.pdx.edu/
And keep it up on Deca. We need it. ;)
If you know a type theorist who could check over my paper without any obligations to the ECOOP programming committee so I could finally have someone confirm that this algorithm isn't Doomed To Failure, that would be incredibly helpful.
Also, if you could come up with any neat ideas on the following matter, that would be great.
http://marmoach.blogspot.co.il/2011/10/multi-method-type-cla...