| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 9656871 | Information and Computation | 2005 | 32 Pages |
Abstract
A type system for terms of the monadic Ï-calculus is introduced and used to obtain a full-abstraction result for the translation of the polyadic Ï-calculus into the monadic calculus: well-sorted terms of the polyadic calculus are barbed congruent iff their translations are typed barbed congruent.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Paola Quaglia, David Walker,