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 2014-10-04 21:38 | LtU Forum | previous forum topic | next forum topic | other blogs | 4137 reads
|
Browse archives
Active forum topics |
Recent comments
20 weeks 1 day ago
20 weeks 1 day ago
20 weeks 1 day ago
42 weeks 2 days ago
46 weeks 4 days ago
48 weeks 1 day ago
48 weeks 1 day ago
50 weeks 6 days ago
1 year 3 weeks ago
1 year 3 weeks ago