Encoding Duce in the -Calculus Export

@incollection{citeulike:2365508, abstract = {We present a type faithful encoding of Duce into the -calculus. These calculi are two variants of, respectively, the λ-calculus and the π-calculus, characterised by rich typing and subtyping systems with union, negation, and intersection types. The encoding is interesting because it sheds new light on the Milner-Turner encoding, on the relations between sequential and remote execution of functions/services, and on the validity of the equational laws for union and intersection types in π-calculus.}, author = {Castagna, Giuseppe and Dezani-Ciancaglini, Mariangiola and Varacca, Daniele}, citeulike-article-id = {2365508}, citeulike-linkout-0 = {http://dx.doi.org/10.1007/11817949_21}, doi = {10.1007/11817949_21}, journal = {CONCUR 2006 – Concurrency Theory}, keywords = {duce, picalculus, subtyping}, pages = {310--326}, posted-at = {2008-02-12 10:32:01}, priority = {2}, title = {Encoding Duce in the -Calculus}, url = {http://dx.doi.org/10.1007/11817949_21}, year = {2006} }

TY - CHAP ID - citeulike:2365508 L3 - citeulike-article-id:2365508 N2 - We present a type faithful encoding of Duce into the -calculus. These calculi are two variants of, respectively, the λ-calculus and the π-calculus, characterised by rich typing and subtyping systems with union, negation, and intersection types. The encoding is interesting because it sheds new light on the Milner-Turner encoding, on the relations between sequential and remote execution of functions/services, and on the validity of the equational laws for union and intersection types in π-calculus. JF - CONCUR 2006 – Concurrency Theory EP - 326 TI - Encoding Duce in the -Calculus SP - 310 KW - duce KW - picalculus KW - subtyping AU - Castagna, Giuseppe AU - Dezani-Ciancaglini, Mariangiola AU - Varacca, Daniele PY - 2006/// UR - http://dx.doi.org/10.1007/11817949_21 ER -