Polarized Name Passing

Martin Odersky.
Proc. FST & TCS, Bangalore, India, December 18-20, 1995.

Abstract: 
We study a refinement of name passing in a process calculus, where names
have input and output polarities.  Building on a simple asynchronous
reduction semantics, we develop a notion of polarized bisimulation and
show that it is a congruence.  We then give an encoding of Moggi's
computational lambda calculus in polarized $\pi$ which preserves all of
Moggi's observational equivalences except the $\eta$-value rule.