User loginNavigation 
A question of separation logic and monadsI am slowly working my way up to an understanding of separation logic and one thing I have not seen with separation logic is a transformation into functional code with immutable data structures. With normal imperative code you just wrap a big fat monad around everything and there is a straightforward transformation into functional code with immutable data structures. The disadvantage of a big fat monad is that you loose the ability to reason about parts of the program that have side effects but are independent of each other. I would expect therefore that smaller monads that could be split and combined by the rules developed for separating logic and the separating conjunction would exist. Does anyone know if anyone has already research that? Or perhaps I am making an elementary error in my reasoning? By Eric Biederman at 20141004 21:38  LtU Forum  previous forum topic  next forum topic  other blogs  2571 reads

Browse archivesActive forum topics 
Recent comments
1 hour 25 min ago
5 hours 4 min ago
19 hours 2 min ago
21 hours 15 min ago
1 day 3 hours ago
1 day 13 hours ago
1 day 14 hours ago
1 day 16 hours ago
1 day 17 hours ago
1 day 18 hours ago