User loginNavigation |
Restructuring Partitioned Normal Form Relations Without Information Loss
By itself, this paper is not related to PLT. However, it is interesting to observe how an idea of "types up to isomorphism" manifests itself in different communities - called data equivalence of (nested) relational schemes in this paper.
I wonder, how reformulation of the paper in CT terms would look like, and whether it will be data-equivalent to the original :-) Restructuring Partitioned Normal Form Relations Without Information Loss PS: I hope this is not too much off-topic. By Andris Birkmanis at 2005-04-25 15:17 | LtU Forum | previous forum topic | next forum topic | other blogs | 5221 reads
|
Browse archivesActive forum topics |
Recent comments
6 weeks 4 days ago
6 weeks 6 days ago
7 weeks 14 hours ago
14 weeks 12 hours ago
19 weeks 5 days ago
19 weeks 6 days ago
20 weeks 5 days ago
23 weeks 3 days ago
24 weeks 6 days ago
25 weeks 3 hours ago