University of Sussex
Browse

Process types as a descriptive tool for interaction

Download (400.23 kB)
conference contribution
posted on 2023-06-09, 09:26 authored by Kohei Honda, Nobuko Yoshida, Martin BergerMartin Berger
We demonstrate a tight relationship between linearly typed p-calculi and typed ?-calculi by giving a type-preserving translation from the call-by-value ?µ-calculus into a typed p-calculus. The ?µ-calculus has a particularly simple representation as typed mobile processes. The target calculus is a simple variant of the linear p-calculus. We establish full abstraction up to maximally consistent observational congruences in source and target calculi using techniques from games semantics and process calculi.

History

Publication status

  • Published

File Version

  • Accepted version

Journal

Rewriting and Typed Lambda Calculi. RTA 2014

Publisher

Springer

Page range

1-20

Event name

Rewriting and Typed Lambda Calculi. RTA 2014

Event location

Vienna, Austria

Event type

conference

Event date

14-17 July 2014

ISBN

9783319089171

Series

Lecture Notes in Computer Science

Department affiliated with

  • Informatics Publications

Research groups affiliated with

  • Foundations of Software Systems Publications

Full text available

  • Yes

Peer reviewed?

  • Yes

Legacy Posted Date

2017-12-18

First Open Access (FOA) Date

2017-12-18

First Compliant Deposit (FCD) Date

2017-12-18

Usage metrics

    University of Sussex (Publications)

    Categories

    No categories selected

    Exports

    RefWorks
    BibTeX
    Ref. manager
    Endnote
    DataCite
    NLM
    DC