I was watching some lectures by Prof. Pfenning on Proof Theory. Between 5:30 and 15:00, he gave a list for some different kinds of judgments along with their calculus and computation phenomena that they can represent or model. I am looking for a more comprehensive list. I would like to compare and know the advantages and disadvantages of choosing some kind of logic/calculus to represent some kind of a computational phenomenon. Which field is focusing more on such comparisons and where to start?
For example, linear lambda calculus vs pi calculus for concurrent programming. Note that I am not interested in this particular example but just to get my question across. What other mathematical logics/calculi do we have and for what type of computations?