A systematic approach to static access control
ACM Transactions on Programming Languages and Systems (TOPLAS)
Type inference, principal typings, and let-polymorphism for first-class mixin modules
Proceedings of the tenth ACM SIGPLAN international conference on Functional programming
Typing Component-Based Communication Systems
FMOODS '09/FORTE '09 Proceedings of the Joint 11th IFIP WG 6.1 International Conference FMOODS '09 and 29th IFIP WG 6.1 International Conference FORTE '09 on Formal Techniques for Distributed Systems
| Hi-index | 0.00 |
We study the combination of possibly conditional non-structuralsubtyping constraints with rows. We give a newpresentation of rows, where row terms disappear; instead,we annotate constraints with filters. We argue that, in thepresence of subtyping, this approach is simpler and moregeneral. In the case where filters are finite or cofinite setsof row labels, we give a constraint solving algorithm whosecomplexity is O(n3m log m), where is the size of the constraintand m is the number of row labels that appear init. We point out that this allows efficient type inference forrecord concatenation. Furthermore, by varying the natureof filters, we obtain several natural generalizations of rows.