We know that a CESK machine can be defined as:
a state-machine in which each state has four components: a (C)ontrol component, an (E)nvironment, a (S)tore and a (K)ontinuation. One might imagine these respectively as the instruction pointer, the local variables, the heap and the stack.
Ed Kmett writes
Video from my recent twitch stream on CEK machines is up!
Matt Might writes:
Writing CEK-style interpreters (or semantics) in Haskell
The paper also describes a CS machine - but not a CEK machine. The point being the Continuation and the Store are essential, but the Environment and the Continuation are negotiable.
My question is: Is a CEK machine an implementation of a CESK machine? (ie isn't the Store Essential?)