Expressiveness of generic process shape types

Jan Jakubův, J. B. Wells

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Shape types are a general concept of process types which work for many process calculi. We extend the previously published Poly*. system of shape types to support name restriction. We evaluate the expressiveness of the extended system by showing that shape types are more expressive than an implicitly typed p-calculus and an explicitly typed Mobile Ambients. We demonstrate that the extended system makes it easier to enjoy advantages of shape types which include polymorphism, principal typings, and a type inference implementation. © 2010 Springer-Verlag Berlin Heidelberg.

Original languageEnglish
Title of host publicationTrustworthly Global Computing - 5th International Symposium, TGC 2010, Revised Selected Papers
Pages103-119
Number of pages17
Volume6084 LNCS
DOIs
Publication statusPublished - 2010
Event5th International Symposium on Trustworthly Global Computing - Munich, Germany
Duration: 24 Feb 201026 Feb 2010

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume6084 LNCS
ISSN (Print)0302-9743

Conference

Conference5th International Symposium on Trustworthly Global Computing
Abbreviated titleTGC 2010
CountryGermany
CityMunich
Period24/02/1026/02/10

Fingerprint Dive into the research topics of 'Expressiveness of generic process shape types'. Together they form a unique fingerprint.

  • Cite this

    Jakubův, J., & Wells, J. B. (2010). Expressiveness of generic process shape types. In Trustworthly Global Computing - 5th International Symposium, TGC 2010, Revised Selected Papers (Vol. 6084 LNCS, pp. 103-119). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6084 LNCS). https://doi.org/10.1007/978-3-642-15640-3_8