Trees from Functions as Processes

DOI10.23638/LMCS-14(3:11)2018OpenAlexW2952801334MaRDI QIDQ4585071

Xian Xu, Davide Sangiorgi

Publication date: 6 September 2018

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

Mathematics Subject Classification ID

Logic in computer science (03B70) Computer science (68-XX)

Related Items (1)

Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The lambda calculus. Its syntax and semantics. Rev. ed.
• Linearity and bisimulation
• Some congruence properties for \(\pi\)-calculus bisimilarities
• \(\mathbb{T}^\omega\) as a universal domain
• An efficiency preorder for processes
• Genericity and the \(\pi\)-calculus
• Duality and i/o-Types in the π-Calculus
• Full Abstraction in a Subtyped pi-Calculus with Linear Types
• Introduction to Bisimulation and Coinduction
• Functions as processes
• Data Types as Lattices
• From Böhm's Theorem to Observational Equivalences
• An investigation into functions as processes

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