Embedding as a Tool for Language Comparison

   page       BibTeX_logo.png   
Frank S. de Boer, Catiuscia Palamidessi
Information and Computation 108(1), pages 128-157

This paper addresses the problem of defining a formal tool to compare the expressive power of different concurrent constraint languages. We refine the notion of embedding by adding some "reasonable" conditions, suitable for concurrent frameworks. The new notion, called modular embedding, is used to define a preorder among these languages, representing different degrees of expressiveness. We show that this preorder is not trivial (i.e., it does not collapse into one equivalence class) by proving that Flat CP cannot be embedded into Flat GHC, and that Flat GHC cannot be embedded into a language without communication primitives in the guards, while the converses hold.

Partita IVA: 01131710376 — Copyright © 2008–2023 APICe@DISI – PRIVACY