User loginNavigation |
Gradual InstantiationIs anyone familiar with a language that allows for "gradual instantiation". What I mean by this, is that the initial algorithm can be stated using very vague types (but not no type) that are gradually narrowed until they reach machine language level. For example, Number -> Rational -> Float -> IEEE_754. or CustomerData -> ShippingCustomer -> AmazonCustomer -> {name, address, [items]} -> { String, {String,String,String, Number}, [String] } ... and so on. A language that supports this would need a monotonically reducing type system with some way of checking types at each level and detecting conflicts. For example: Number = Number + Number is fine, but Rational = Number + Number, requires that the RHS needs to be Rational as well (but no resolution specification, yet). By David Minor at 2014-07-02 08:55 | LtU Forum | previous forum topic | next forum topic | other blogs | 3327 reads
|
Browse archives
Active forum topics |
Recent comments
22 weeks 6 days ago
23 weeks 3 hours ago
23 weeks 3 hours ago
45 weeks 1 day ago
49 weeks 3 days ago
51 weeks 11 hours ago
51 weeks 11 hours ago
1 year 1 week ago
1 year 6 weeks ago
1 year 6 weeks ago