# Constraints as Processes

#### Abstract:

We present a compositional encoding of the gamma-calculus into the
pi-calculus. The former, used in the Oz semantics, is a recent small
language with equational constraints over logical variables; the
latter is a basic calculus of interacting processes. We establish a
close correspondence between the reductions in the gamma-calculus and
its encoding, using weak barbed bisimulation congruence.
**In Proc. CONCUR'96** (Postscript, compressed)

#### BibTeX entry:

@InProceedings{victor.parrow:constraints-processes,
author = "Bj{\"o}rn Victor and Joachim Parrow",
title = "Constraints as Processes",
editor = "Ugo Montanari and Vladimiro Sassone",
volume = 1119,
series = "Lecture Notes in Computer Science",
pages = "389-405",
booktitle = "CONCUR'96: Concurrency Theory",
year = 1996,
publisher = "Springer-Verlag"
}

Björn Victor