References

[AG98]

A. Asperti, S.Guerrini The Optimal Implementation of Functional Programming Languages. in ``Cambridge Tracts in Theoretical Computer Science'' Series, Cambridge University Press, December 1998.

[FL99]

C. Fournet, C. Laneve: Bisimulations in the Join-Calculus. Submitted to a Journal. June 1999.

[FLMR99]

C. Fournet, C. Laneve, L. Maranget, D. Rèmy: Assembling Objects with Internal Concurrency. Draft, October 1999.

[LV99]

C. Laneve, B. Victor: Solos in Concert. ICALP'99, LNCS 1644.

[CaPhD99]

G. L. Cattani. Presheaf Models for Concurrency. PhD Thesis, University of Aarhus, 1999.

[FCW99]

M. Fiore, G. L. Cattani and G. Winskel. Weak Bisimulation and Open Maps. In Proceedings of the 14th Symposium on Logic in Computer Science, LICS '99, pages 67--76, IEEE Press, 1999.

[PCW99]

A. J. Power, G. L. Cattani and G. Winskel. A Representation Result for Free Cocompletions. To appear in Journal of Pure and Applied Algebra, 1999.

[Ga99a]

Philippa Gardner. Closed Action Calculi. Journal of Theoretical Computer Science, 1999. To appear.

[GW99]

Philippa Gardner and Lucian Wischik. Symmetric Action Calculi. Extended abstract, Express 99.

[Ga99b]

Philippa Gardner. Interaction Nets, Sharing graphs and Action Calculi. Submission in association with the Mathfit Workshop on Process Algebra, January 99.

[SV99a]

Peter Sewell and Jan Vitek. Secure composition of insecure components. Technical Report 463, Computer Laboratory, University of Cambridge, April 1999.

[SV99b]

Peter Sewell and Jan Vitek. Secure composition of insecure components. In Proceedings of the 12th IEEE Computer Security Foundations Workshop. Mordano, Italy, pages 136--150. IEEE Computer Society, June 1999.

[SV99c]

Peter Sewell and Jan Vitek. Secure Composition of Untrusted Code: Wrappers and Causality Types. Submitted for publication.

[Sew99a]

Peter Sewell. From rewrite rules to bisimulation congruences. Theoretical Computer Science, 1999. Invited submission, to appear in a special issue for CONCUR 98.

[SWP99b]

Peter Sewell, Pawe T. Wojciechowski, and Benjamin C. Pierce. Location-independent communication for mobile agents: a two-level architecture. In Internet Programming Languages, LNCS 1686. Springer-Verlag, 1999.

[WS99]

Pawe T. Wojciechowski and Peter Sewell. Nomadic Pict: Language and infrastructure design for mobile agents. In Proceedings of ASA/MA 99: Agent Systems and Applications/Mobile Agents, IEEE, October 1999.

[Sew99pi]

Peter Sewell. A brief introduction to applied p, January 1999. Lecture notes for the Mathfit Instructional Meeting on Recent Advances in Semantics and Types for Concurrency: Theory and Practice, July 1998.

[Da99]

V. Danos.(1999) Sequent Calculus and Continuation Passing Style Compilation. To appear in the Proceedings of the 11th Congress of Logic, Methodology and Philosophy of Science, held in Cracow, Kluwer.

[AbMe99]

S. Abramsky, P.-A. Melliès.(1999) Concurrent games and full completeness. Proceedings of LiCS'99, Trento.

[Me99a]

P.-A. Melliès.(1999) Hypercoherence spaces as concurrent games, in preparation.

[Me99b]

P.-A. Melliès.(1999) Axiomatic rewriting theory II: The lambda-sigma calculus enjoys finite normalization cones. Submitted.

[BDER98]

P. Baillot, V. Danos, T. Ehrhard, L. Regnier.(1998) Timeless Games. In proceedings of CSL'97, held in Aarhus. Springer LNCS 1414, Mogens Nielsen and Wolfgang Thomas eds., pp. 56--77.

[MKl99]

Jean-François Monin and Francis Klay, ``Correctness Proof of the Standardized Algorithm for ABR Conformance'', FM'99 -- Formal Methods, LNCS 1708, Springer Verlag", ed. Jeannette Wing and Jim Woodcock and Jim Davies, pp 662-681, 1999

[LTL99]

J.-J. Lévy, B. Thomsen, L. Leth: ``Second Year Report for Esprit Working Group 21836 CONFER-2 CONcurrency and Funstions: Evaluation and Reduction'', EATCS Bulletin Number 67 February 1998 pp. 35-51.

[DPLB99]

P. Degano, C. Priami, L. Leth, B. Thomsen: ``Causality for Debugging Mobile Agents'', accepted for publication in ACTA INFORMATICA, 1999.

[AFG99a]

Martín Abadi, Cédric Fournet, and Georges Gonthier. Secure implementation of channel abstractions. à paraître, 1999.

[AFG99b]

Martín Abadi, Cédric Fournet, and Georges Gonthier. A top-down look at a secure message. In Proc. of the 19th Foundations of Software Technology and Theoretical Computer Science, Chennai, December 1999.

[AFG00]

Martín Abadi, Cédric Fournet, and Georges Gonthier. Authentication primitives and their compilation. In 27th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages. ACM Press, January 2000.

[FLS99]

Cédric Fournet, Jean-Jacques Lévy, and Alan Schmitt. A distributed implementation of ambients. 1999. à paraître.

[FS99]

Cédric Fournet and Alan Schmitt. An implementation of Ambients in JoCAML. In 5th Mobile Object System Workshop: Programming Languages for Wide Area Networks, June 1999.

[lF99]

Fabrice le Fessant. Jocaml. available at , 1999.

[LM99]

Jean-Jacques Lévy and Luc Maranget. Explicit substitutions and programming languages. In Proc. of the 19th Foundations of Software Technology and Theoretical Computer Science, Chennai, December 1999.

[ABL99]

R. Amadio, G. Boudol, and C. Lhoussaine. The receptive distributed p-calculus. In Proc. Found. Software Tech. and Theoret. Comp. Sci., LNCS. Springer-Verlag, 1999. To appear.

[AP99]

R. Amadio and S. Prasad. The game of the name in cryptographic tables. In Proc. ASIAN'99, LNCS. Springer-Verlag, 1999. To appear. Also appeared as INRIA Research Report 3733.

[BCL99]

G. Boudol, P.-L. Curien, and C. Lavatelli. A semantics for lambda calculi with resources. Journal of Mathematical Structures in Computer Science, 9(4), 1999. Special Issue on "Lambda-Calculus and Logic" in Honour of Roger Hindley.

[BDZ99]

Gérard Boudol and Silvano Dal-Zilio. An interpretation of extensible objects. In Proc. of FCT '99 -- 12th International Symposium on Fundamentals of Computation Theory, aug 1999.

[DZ99a]

Silvano Dal-Zilio. A bisimulation for the blue calculus. Technical Report 3664, INRIA, apr 1999.

[DZ99b]

Silvano Dal-Zilio. Le calcul bleu: types et objets. PhD thesis, Université de Nice -- Sophia-Antipolis, 1999.

[LS00]

F. Levi and D. Sangiorgi. Controlling interference in ambient. In Proc. POPL'00. ACM Press, 2000. to appear.

[Mer99]

M. Merro. On Equators in Asynchronous Name-passing calculi without Matching. In I. Castellani and B. Victor, editors, Proc. Express'99, volume 27 of Electronic Notes in Theoretical Computer Science. Elsevier, 1999.

[NHKM99]

U. Nestmann, H. Hüttel, J. Kleist, and M. Merro. Aliasing models for object migration. In P. Amestoy, P. Berger, M. Daydé, I. Duff, V. Frayssé, L. Giraud, and D. Ruiz, editors, EuroPar'99 Parallel-Processing, volume 1685 of LNCS, pages 1353--1368. Springer-Verlag, 1999.

[RS99]

C. Röckl and D. Sangiorgi. A pi-calculus semantics of Concurrent Idealised ALGOL. In Proc. Fossacs'99, volume 1578 of LNCS, pages 306--322. Springer-Verlag, 1999.

[San99a]

D. Sangiorgi. Asynchronous process calculi: the first-order and higher-order paradigms (tutorial). To appear in TCS, 1999.

[San99b]

D. Sangiorgi. From l to p, or: Rediscovering continuations. Journal of Mathematical Structures in Computer Science, 9(4), 1999. Special Issue on "Lambda-Calculus and Logic" in Honour of Roger Hindley.

[LV99]

Cosimo Laneve and Björn Victor. Solos in concert. In J. Wiederman, P. van Emde Boas and M. Nielsen, eds, Proceedings of ICALP '99, volume 1644 of LNCS, pages 513--523. Springer, July 1999.

[LW99]

X. Liu and D. Walker, Concurrent objects as mobile processes, in Proof, Language, and Interaction, editor G. Plotkin, MIT Press (to appear).

[QW99a]

P. Quaglia and D. Walker, On synchronous and asynchronous mobile processes, submitted for publication.

[QW99b]

P. Quaglia and D. Walker, On encoding pp in mp, in Proceedings of Foundations of Software Technology and Theoretical Computer Science, December 1998, Springer-Verlag Lecture Notes in Computer Science, vol. 1530, 42--53.

[BM99a]

Bruni, R. and Montanari, U., Zero-Safe Nets: Composing Nets via Transition Synchronization, Int. Colloquium on Petri Net Technologies for Modelling Communication Based Systems, 1999, Fraunhofer Gesellschaft ISST.

[BMM99]

Bruni, R. and Meseguer, J. and Montanari, U., Executable Tile Specifications for Process Calculi, FASE'99, Fundamental Approaches to Software Engineering, LNCS 1577, 1999.

[BMMS99]

Bruni, R. and Meseguer, J. and Montanari, U. and Sassone, V., Functorial Semantics for Petri Nets under the Individual Token Philosophy, Category Theory and Computer Science, Elsevier ENTCS 29, 1999.

[BM99b]

Bruni, R. and Montanari, U., Cartesian Closed Double Categories, their Lambda-Notation, and the Pi-Calculus, LICS'99, 14th Annual IEEE Symposium on Logic in Computer Science, IEEE Computer Society, 1999.

[CFP99]

F. Corradini, G. Ferrari and M. Pistore. On the Semantics of Durational Actions. Theoretical Computer Science, to appear 1999.

[NFP99]

R. De Nicola, G. Ferrari, and R. Pugliese. Types as Specification of Access Policies In Secure Internet Programming: Security Issues for Distributed and Mobile Objects, LNCS State-Of-The-Art-Survey (J. Vitek and C. Jensen Eds.), LNCS 1603, 1999.

[NFPV99]

R. De Nicola, G. Ferrari, R. Pugliese and B. Venneri. Types for Access Control. In Theoretical Computer Science, to appear.

[FMSS99]

Ferrari, G., Montangero, C., Semini, L. and Semprini, S. A Refinement Calculus for Mobility: Expressing Security Policies, In Proc. OOPSLA Distributed Object Security Workshop, 1999.

[GM99]

F. Gadducci, U Montanari. Comparing Logics for Rewriting: Rewriting Logic, Action Calculi and Tile Logic. Submitted to a special issue of Theoretical Computer Science, 1999.

[MP99]

Montanari , U. and Pistore, M. Finate State Verification for the Asynchronous p-calculus. In Proc. TACAS'99, LNCS 1579, 1999.

[Tu99]

Tuosto, E. An Ada95 Implementation of a Network Coordination Language with Code Mobility, Ada-Europe International Conference on Reliable Software Technologies Santander, Spain, June 1999

[CH98]

Ilaria Castellani and Matthew Hennessy. Testing theories for asynchronous languages. In V Arvind and R Ramanujam, editors, 18th Conference on Foundations of Software Technology and Theoretical Computer Science (Chennai, India, December 17--19, 1998), lncs. sv, December 1998.

[Hen99]

Y. Yoshida M. Hennessy. Subtyping and locality in distributed higher order mobile processes (extended abstract). In CONCUR '99. Springer-Verlag, 1999. Full version available as Computer Science Technical Report 1/99, University of Sussex, 1997. Available from http://www.cogs.susx.ac.uk/.

[JR99]

A. Jeffrey and J. Rathke. Towards a theory of bisimulation for local names. In Proc. LICS'99, 14^th Annual Symposium on Logic in Computer Science, Trento, pages 56--66. IEEE Computer Society Press, 1999.