DeepAI AI Chat
Log In Sign Up

Encodability and Separation for a Reflective Higher-Order Calculus

by   Stian Lybech, et al.

The ρ-calculus (Reflective Higher-Order Calculus) of Meredith and Radestock is a π-calculus-like language with some unusual features, notably, structured names, runtime generation of free names, and the lack of an operator for scoping visibility of names. These features pose some interesting difficulties for proofs of encodability and separation results. We describe two errors in a previously published attempt to encode the π-calculus in the ρ-calculus by Meredith and Radestock. Then we give a new encoding and prove its correctness, using a set of encodability criteria close to those proposed by Gorla, and discuss the adaptations necessary to work with a calculus with runtime generation of structured names. Lastly we prove a separation result, showing that the ρ-calculus cannot be encoded in the π-calculus.


page 1

page 2

page 3

page 4


On Up-to Context Techniques in the π-calculus

We present a variant of the theory of compatible functions on relations,...

A circular proof system for the hybrid mu-calculus

We present a circular and cut-free proof system for the hybrid mu-calcul...

A program logic for fresh name generation

We present a program logic for Pitts and Stark's ν-calculus, an extensio...

A stochastic calculus approach to the oracle separation of BQP and PH

After presentations of Raz and Tal's oracle separation of BQP and PH res...

Formalized Lambek Calculus in Higher Order Logic (HOL4)

In this project, a rather complete proof-theoretical formalization of La...

On the Validity of Encodings of the Synchronous in the Asynchronous π-calculus

Process calculi may be compared in their expressive power by means of en...

A Typed Slicing Compilation of the Polymorphic RPC Calculus

The polymorphic RPC calculus allows programmers to write succinct multit...