Want to know:

spec Stack[sort Elem] = Nat thenfree type Stack[Elem] ::= emptyStack|push(Elem, Stack[Elem])op pop : Stack[Elem] →? Stack[Elem]∀ s : Stack[Elem], e : Elem• def pop(s) ⇔ ¬(s = emptyStack) %{ dpp }%• pop(push(e, s)) = s %{ pp }%op peek : Stack[Elem] →? Elem∀ s : Stack[Elem], e : Elem• def peek(s) ⇔ ¬(s = emptyStack) %{ dpk }%• peek(push(e, s)) = e %{ pk }%op height : Stack[Elem] → Nat∀ s : Stack[Elem]• height(emptyStack) = 0 %{ h0 }%• height(push(e, s)) = s(height(s)) %{ hs }%endÉvaluer avec une stratégie leftmost-outermost :h(pu(pk(pu(e, eS)), pp(pu(e', eS))))Nat|h|s[e]|pu|---------------|e---------------s[e]|---------------|pk-------------pp|---------------|s[e]------------s[e]|---------------|pu-------------pu|----|----------|----|e---eS--------e'---eS

Get a detailed, AI-powered explanation for this question and thousands more on StudyFetch.