Earlier quoted context omitted.
On a slightly orthogonal note, I think that not only can you think of programming languages this way, but that you should —programming languages and formal logics are ultimately instances of the same general idea. I've found this to be a consistent and powerful view for reasoning about programs, programming languages, proofs and logics in a uniform sort of way. The Curry-Howard correspondence is an important idea tha…
programming languages and formal logics are ultimately instances of the same general idea. That's deeply questionable. The CH-correspondence breaks down as soon as you your computation includes non-termination, concurrency, timing, distribution etc. Classical logic doesn't really have wholly convincing CH-correspondences either. It seems to me that constructive proofs are a special class of programs, and fall under t…
No it doesn't. Each of those features leads to a different logic. You can even reason about the composition of logics via category theory to see how various features interact with each other.
> Classical logic doesn't really have wholly convincing CH-correspondences either.
Sure it does, first class continuations: http://www.cl.cam.ac.uk/~tgg22/publications/popl90.pdf
I suppose you have the right to remain unconvinced.