Oren> Can you give a more concrete example of what could a cartesian
Oren> product of type predicates actually stand for in Python?
Consider my TotallyOrdered suggestion from before. I would like to
have a way of saying that for any two types T1 and T2 (where T1 might
equal T2) chosen from the set {int, long, float}, < imposes a total
ordering on values of those types.
Come to think of it, that's not really a Cartesian product. Rather,
it's a claim about the members of the set union(int,union(long, float)).
RetroSearch is an open source project built by @garambo | Open a GitHub Issue
Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo
HTML:
3.2
| Encoding:
UTF-8
| Version:
0.7.4