Lambda the Ultimate

inactiveTopic A Logic for Shared Mutable Data Structures
started 11/29/2003; 9:33:30 AM - last post 11/29/2003; 9:40:10 AM
Andris Birkmanis - A Logic for Shared Mutable Data Structures  blueArrow
11/29/2003; 9:33:30 AM (reads: 126, responses: 1)
Sounds scary? The title frightened me, but the contents is even more fearful ;-)

John Reynolds demonstrates "an extension of Hoare logic that permits reasoning about low-level imperative programs that use shared mutable data structure.".

Looks like another formal approach to impurity. And I thought that monads are evil...

Though this paper seems to target compiler implementers, I find it useful for language designers as well.

Andris Birkmanis - Re: A Logic for Shared Mutable Data Structures  blueArrow
11/29/2003; 9:40:10 AM (reads: 132, responses: 0)
As an additional teaser (or repellant) - this logic covers:

1. Explicit storage allocation and deallocation.
2. Unrestricted address arithmetic.