User loginNavigation 
literature on commutative lifted boolean operatorsEven in a lazy language like Haskell, lifted boolean operators like 'and' are not commutative. What I mean is that they're commutative only as long as bottom is not involved. In that case, for example, 'and' and 'flip and' are not interchangeable. This causes problems in certain applications like trying to simulate certain cyclic logic circuits. To a great extent you can avoid these problems by carefully thinking about which input to 'and' you want to use, but I'm interested in designing a system where this is not necessary. I've just finished coding up a system that has a commutative and. It consist of two parts: a new 'and' called 'land' that uses Maybe Bool as its data type and a discipline for programming with 'land' that requires you to iterate until you find a fixed point before returning a result. I'm looking for some references to papers, books, web sites, etc. that might help me understand more about this topic and not reinvent the wheel any further than I already have. I'm also interested in the generalized version of this topic, i.e. beyond boolean operators: "when conventional laziness just isn't lazy enough." I've done some Googling but haven't seem to hit upon the "magic words." By bdenckla at 20051007 17:44  LtU Forum  previous forum topic  next forum topic  other blogs  5422 reads

Browse archivesActive forum topics 
Recent comments
3 hours 15 min ago
5 hours 12 min ago
15 hours 18 min ago
2 days 10 hours ago
3 days 18 hours ago
3 days 18 hours ago
5 days 15 hours ago
6 days 3 hours ago
1 week 2 days ago
1 week 2 days ago