✦ LIBER ✦

Termination in higher-order concurrent calculi

✍ Scribed by Romain Demangeon; Daniel Hirschkoff; Davide Sangiorgi

Book ID: 113720731
Publisher: Elsevier Science
Year: 2010
Tongue: English
Weight: 885 KB
Volume: 79
Category: Article
ISSN: 1567-8326
DOI: 10.1016/j.jlap.2010.07.007

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Typing termination in a higher-order con

Typing termination in a higher-order concurrent imperative language

✍ Gérard Boudol 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 541 KB

First-order reasoning for higher-order c

First-order reasoning for higher-order concurrency

✍ Vasileios Koutavas; Matthew Hennessy 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 965 KB

Higher-order communications for concurre

Higher-order communications for concurrent programming

✍ Alberto Pettorossi; Andrzej Skowron 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 359 KB

In a recursive-equations language is introduced. Its operational semantics is specified by means of computing agents which communicate and exchange messages. Those communications are, so to speak, zero-order, in the sense that the exchanged messages are values of a data structure, possibly defined

Normalisation for higher-order calculi w

Normalisation for higher-order calculi with explicit substitutions

✍ Eduardo Bonelli 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 578 KB

Contextual Labelled Semantics for Higher

Contextual Labelled Semantics for Higher-order Process Calculi

✍ Yongjian Li 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 309 KB

On the expressiveness and decidability o

On the expressiveness and decidability of higher-order process calculi

✍ Ivan Lanese; Jorge A. Pérez; Davide Sangiorgi; Alan Schmitt 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 532 KB