(0) CHARACTERISTICS
-type specified: stack
-features: deterministic, non-parameterized
-foreign types:
(1) SYNTAX
ACCESS-PROGRAMS
Arg#1 | Arg#2 | Result Type | CREATESTACK | stack:O | | | PUSH | stack:VO | int:V | | POP | stack:VO | | | TOP | stack:V | | int | |
---|
(2) CANONICAL TRACES
canonical(T) T = _ n:<int>; a[1]..a[n]:<int> [T = CREATESTACK(*).[PUSH(*, a[i])]i=1..n ](3) SEMANTICS
ACCESS-PROGRAMSLegality(CREATESTACK(n)) = %legal%
CREATESTACK(n ) = CREATESTACK(*)
Legality(PUSH((n, T), a)) =
Condition | Value |
---|---|
T = _ | %invalidstack% |
T _ | %legal% |
PUSH((n, T) , a) = T.PUSH(*, a)
Legality(POP((n, T))) =
Condition | Value |
---|---|
T = _ | %invalidstack% |
length(T) = 1 | %empty% |
length(T) > 1 | %legal% |
POP((n, T) ) = T1 where T1:<stack>; a:<int> [T = T1.PUSH(*, a) ]
Legality(TOP(T)) =
Condition | Value |
---|---|
T = _ | %invalidstack% |
length(T) = 1 | %empty% |
length(T) > 1 | %legal% |
TOP(T) = a where T1:<stack>; a:<int> [T = T1.PUSH(*, a) ]