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 | 5766 reads
|
Browse archives
Active forum topics |
Recent comments
1 week 1 day ago
41 weeks 3 days ago
41 weeks 3 days ago
41 weeks 3 days ago
1 year 11 weeks ago
1 year 15 weeks ago
1 year 17 weeks ago
1 year 17 weeks ago
1 year 20 weeks ago
1 year 24 weeks ago