1
            
            vote
        
            
                
                Accepted
            
        
        Formal semantics of a mutable/imperative stack
                    After discussing it with specialists, a standard approach would be to denote the state of the mutable stack with an immutable stack in the Hoare triples.
E.g. :
$[]\  s\gets create() \ [s = \mathtt{[]...
                
            
       
        
            
                1
            
            vote
        
        
            
        How append, prepend, and generally insertAt work in RRB-tree
                    How cool is it to be in a field and an age where Jean Niklas L'orange can answer your questions?  That's a great response!
Another approach to consider is to localize the "focus".  The focus is ...
                
            
       
        Only top scored, non community-wiki answers of a minimum length are eligible
Related Tags
persistent-data-structure × 20data-structures × 13
functional-programming × 5
trees × 3
algorithms × 2
graphs × 1
runtime-analysis × 1
reference-request × 1
arrays × 1
distributed-systems × 1
matrices × 1
concurrency × 1
heaps × 1
semantics × 1
binary-search-trees × 1
balanced-search-trees × 1
stacks × 1
cellular-automata × 1
hoare-logic × 1
imperative-programming × 1
programming-paradigms × 1