User loginNavigation |
Viability of a static type system (like ML) for a relational language?I'm building a relational language. I like the idea of a static type system but after toying for a while with the interpreter I have wonder how feasible is it. Here, I think a "type" is the whole head of the relation (even scalars as "1" are relations) and most thing fell fine, but the join operator cause trouble: It could merge heads (or not) depending in the kind of join. So, I'm saying that I feel the relational mode generate on the fly new types and can't be specified before. So, If i have a query like:
city where .id=1 I see the type of each relation change. Is impractical to type by hand each combination, but I like the idea of type most of it. But can the compiler be made to work with this similar to ML? How work the sql languages, them are dynamic? By mamcx at 2016-06-10 18:29 | LtU Forum | previous forum topic | next forum topic | other blogs | 12067 reads
|
Browse archives
Active forum topics |
Recent comments
5 hours 31 min ago
40 weeks 1 day ago
40 weeks 2 days ago
40 weeks 2 days ago
1 year 10 weeks ago
1 year 14 weeks ago
1 year 16 weeks ago
1 year 16 weeks ago
1 year 18 weeks ago
1 year 23 weeks ago