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

Theoretical Computer Science

Volumn 356, Issue 3, 2006, Pages 422-439

  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

COMPUTATION THEORY; COMPUTER SIMULATION; EMBEDDED SYSTEMS; SYNCHRONIZATION;

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

SIGNAL ENCODING;

EID: 33646149644     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2006.02.006     Document Type: Article

References (15)

1. M. Bundgaard, T. Hildebrandt, J.C. Godskesen, A CPS encoding of name-passing in higher-order mobile embedded resources, in: J. Baeten, F. Corradini (Eds.), Proc. 11th Internat. Workshop on Expressiveness in Concurrency (EXPRESS'04), Electronic Notes in Theoretical Computer Science, Vol. 128, Elsevier, Amsterdam, 2004, pp. 131-150.
2. Carbone M., and Maffeis S. On the expressive power of polyadic synchronisation in π-calculus. Nordic J. Comput. 10 2 (2003) 70-98
3. L. Cardelli, A.D. Gordon, Mobile ambients, Theoret. Comput. Sci. 240 (1) (2000) 177-213. 〈http://dx.doi.org/10.1016/S0304-3975(99)00231-5 〉
4. G. Castagna, F.Z. Nardelli, The Seal calculus revisited: contextual equivalence and bisimilarity, in: M. Agrawal, A. Seth (Eds.), Proc. 22nd Conf. Foundations of Software Technology and Theoretical Computer Science (FSTTCS'02), Lecture Notes in Computer Science, Vol. 2556, Springer, Berlin, 2002, pp. 85-96.
5. Ferrari G., Montanari U., and Quaglia P. A π-calculus with explicit substitutions. Theoret. Comput. Sci. 168 1 (1996) 53-103
6. J. C. Godskesen, T. Hildebrandt, V. Sassone, A calculus of mobile resources, in: L. Brim, P. Jancar, M. Kretínský, A. Kucera (Eds.), Proc. 13th Internat. Conf. on Concurrency Theory (CONCUR'02), Lecture Notes in Computer Science, Vol. 2421, Springer, Berlin, 2002, pp. 272-287.
7. T. Hildebrandt, J.C. Godskesen, M. Bundgaard, Bisimulation congruences for Homer-a calculus of higher order mobile embedded resources, Technical Report TR-2004-52, IT University of Copenhagen, 2004.
8. D. Hirschkoff, Handling substitutions explicitely in the π-calculus, in: Proc. Second Internat. Workshop on Explicit Substitutions: Theory and Applications to Programs and Proofs (WESTAPP'99), 1999, pp. 28-43. 〈http://cermics.enpc.fr/dh/sigma/full.ps.gz 〉
9. O.H. Jensen, R. Milner, Bigraphs and mobile processes (revised), Technical Report UCAM-CL-TR-580, University of Cambridge, Computer Laboratory, 2004.
10. Milner R. Communicating and Mobile Systems: The π-calculus (1999), Cambridge University Press, Cambridge
11. Milner R., Parrow J., and Walker D. A calculus of mobile processes, parts I and II. J. Inform. Comput. 100 (1992) 1-40 41-77
12. D. Sangiorgi, Expressing mobility in process algebras: first-order and higher-order paradigms, Ph.D. Thesis, Department of Computer Science, University of Edinburgh, 1992.
13. D. Sangiorgi, D. Walker, The π-calculus, Cambridge University Press, Cambridge, 2001.
14. Thomsen B. Plain CHOCS: a second generation calculus for higher order processes. Acta Inform. 30 1 (1993) 1-59
15. Zimmer P. On the expressiveness of pure mobile ambients. J. Math. Structures Comput. Sci. 13 5 (2004) 721-770