A CPS encoding of name-passing in higher-order mobile embedded resources

Electronic Notes in Theoretical Computer Science

Volumn 128, Issue 2, 2005, Pages 131-150

  Bundgaard, Mikkel ^a   Hildebrandt, Thomas ^a   Godskesen, Jens Chr ^a  

^a IT UNIVERSITY OF COPENHAGEN   (Denmark)

Author keywords

calculus; Continuation passing; Explicit Substitutions; Name passing encoding; Nested locations; Process passing

Indexed keywords

COMPUTER SIMULATION; EMBEDDED SYSTEMS; MATHEMATICAL MODELS; MATHEMATICAL TECHNIQUES; MOBILE COMPUTING; TELECOMMUNICATION LINKS;

Φ-CALCULUS; CONTINUATION PASSING; EXPLICIT SUBSTITUTIONS; NAME-PASSING ENCODING; NESTED LOCATIONS; PROCESS-PASSING;

ENCODING (SYMBOLS);

EID: 15844398950     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.entcs.2004.11.033     Document Type: Conference Paper

References (12)

1. L. Cardelli, and A.D. Gordon M. Nivat Proceedings of the First International Conference of Foundations of Software Science and Computation Structures (FOSSACS'98) Lecture Notes in Computer Science 1378 1998 140 155
2. G. Castagna, and F.Z. Nardelli The Seal calculus revisited: Contextual equivalence and bisimilarity M. Agrawal A. Seth Proceedings of the 22nd Conference on the Foundations of Software Technology and Theoretical Computer Science (FSTTCS'02) Lecture Notes in Computer Science 2556 2002 85 96
3. G. Ferrari, U. Montanari, and P. Quaglia A π-calculus with explicit substitutions Theoretical Computer Science 168 1996 53 103
4. J.C. Godskesen, T. Hildebrandt, and V. Sassone A calculus of mobile resources L. Brim P. Jancar M. Kretínský A. Kucera Proceedings of the 13th International Conference on Concurrency Theory (CONCUR'02) Lecture Notes in Computer Science 2421 2002 272 287
5. Hildebrandt, T., J.C. Godskesen and M. Bundgaard, Bisimulation congruences for Homer - a calculus of higher order mobile embedded resources, Technical report, IT University of Copenhagen, Department of Theoretical Computer Science (2004), to appear
6. Jensen, O. H. and R. Milner, Bigraphs and mobile processes (revised), Technical Report UCAM-CL-TR-580, University of Cambridge, Computer Laboratory (2004)
7. R. Milner Communicating and Mobile Systems: the π-calculus 1999 Cambridge University Press
8. R. Milner, J. Parrow, and D. Walker A calculus of mobile processes, parts I and II Journal of Information and Computation 100 1992 1 40 and 41-77
9. Sangiorgi, D., "Expressing Mobility in Process Algebras: First-Order and Higher-Order Paradigms," Ph.D. thesis, Department of Computer Science, University of Edinburgh (1992)
10. D. Sangiorgi, and D. Walker The π-calculus 2001 Cambridge University Press
11. B. Thomsen Plain CHOCS: A second generation calculus for higher order processes Acta Informatica 30 1993 1 59
12. P. Zimmer On the expressiveness of pure mobile ambients L. Aceto B. Victor Proceedings of the 7th International Workshop on Expressiveness in Concurrency (EXPRESS'00) Electronic Notes in Theoretical Computer Science 39 2003 81 104