Trees from Functions as Processes

DOI10.1007/978-3-662-44584-6_7zbMath1417.68138arXiv1804.05797OpenAlexW2128505383MaRDI QIDQ3190110

Davide Sangiorgi, Xian Xu

Publication date: 15 September 2014

Published in: CONCUR 2014 – Concurrency Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1804.05797

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (4)

Eager functions as processes ⋮ On the relative expressiveness of higher-order session processes ⋮ On the Relative Expressiveness of Higher-Order Session Processes ⋮ Unnamed Item

This page was built for publication: Trees from Functions as Processes