A proof theoretical approach to communication

DOI10.1007/3-540-63165-8_189zbMath1401.68226MaRDI QIDQ4571964

Yuxi Fu

Publication date: 4 July 2018

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-63165-8_189

Mathematics Subject Classification ID

68Q10: Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.)

68Q55: Semantics in the theory of computing

68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)

03F05: Cut-elimination and normal-form theorems

03B40: Combinatory logic and lambda calculus

Related Items

Bisimulation congruence of \(\chi\)-calculus, Understanding the mismatch combinator in chi calculus, Tau laws for pi calculus, Variations on mobile processes, Concurrent nets: a study of prefixing in process calculi, The λ-calculus in the π-calculus