By abstract machines I mean things like the SECD machine, Krivine's machine or more generally machines with states/memory/registers/stack/accumulator...According to Wikipedia page of the Curry-Howard isomorphism, we have a correspondence with the Sequent Calculus where the left/right introductions rule matches with the constructors of codes and evaluation stacks. And the priority of rules application is related to call-by-value and call-by name reduction.So I'm looking for more information than what we can find in Wikipedia.
What is the role of abstract machines in the Curry-Howard isomorphism?
reference request;logic;computation models;curry howard