Implicit typing à la ML for the join-calculus

DOI10.1007/3-540-63141-0_14zbMath1512.68057OpenAlexW1511688825MaRDI QIDQ6044118

Cosimo Laneve, Didier Rémy, Cédric Fournet, Luc Maranget

Publication date: 17 May 2023

Published in: CONCUR '97: Concurrency Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-63141-0_14

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (6)

A concurrent lambda calculus with futures ⋮ Inheritance in the join calculus. ⋮ A hierarchy of equivalences for asynchronous calculi ⋮ Bisimulations in the join-calculus ⋮ Static analysis for the \(\pi\)-calculus with applications to security ⋮ Resource access control in systems of mobile agents

Cites Work

• A syntactic approach to type soundness

This page was built for publication: Implicit typing à la ML for the join-calculus