A proof theoretical approach to communication
From MaRDI portal
Publication:4571964
DOI10.1007/3-540-63165-8_189zbMath1401.68226OpenAlexW1526102560MaRDI QIDQ4571964
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
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (7)
Tau laws for pi calculus ⋮ Bisimulation congruence of \(\chi\)-calculus ⋮ Theory of interaction ⋮ Variations on mobile processes ⋮ Concurrent nets: a study of prefixing in process calculi ⋮ The λ-calculus in the π-calculus ⋮ Understanding the mismatch combinator in chi calculus
Cites Work
- Linear logic
- The lambda calculus. Its syntax and semantics. Rev. ed.
- A calculus of mobile processes. I
- Call-by-name, call-by-value and the \(\lambda\)-calculus
- Plain CHOCS. A second generation calculus for higher order processes
- Proofs as processes
- On the \(\pi\)-calculus and linear logic
- Objects in the \(\pi\)-calculus
- Functions as processes
This page was built for publication: A proof theoretical approach to communication