References

AM98

A. Asperti, H.Mairson Optimal $\beta$-reduction is not elementary recursive. Proc. of the twenty-fifth Annual ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages (POPL'98).

AG98

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

BFL97

M. Boreale, C. Fournet, C. Laneve: Bisimulations in the Join-Calculus. October 1997. Submitted.

FLMR97

C. Fournet, C. Laneve, L. Maranget, D. Rèmy: Implicit Typing à la ML in the Join-Calculus. In Proceeding CONCUR '97, LNCS 1243.

BGHP97

Andrew Barber, Philippa Gardner, Masahito Hasegawa, and Gordon Plotkin.
From Action Calculi to Linear Logic.
In Proceedings of CSL 97, Aarhus, 1997.

Gar98

Philippa Gardner.
Closed action calculi.
Theoretical Computer Science, 1998.
To appear.

GH97

Philippa Gardner and Masahito Hasegawa.
Types and Models for Higher-order Action Calculi.
In Proceedings of TACS 97, Sendai, Japan, 1997.

Jen98

Ole Høgh Jensen.
PhD thesis, University of Cambridge.
Forthcoming, 1998.

PT97

Benjamin C. Pierce and David N. Turner.
Pict: A programming language based on the pi-calculus.
Technical Report CSCI 476, Computer Science Department, Indiana University, 1997.
To appear in Proof, Language and Interaction: Essays in Honour of Robin Milner, Gordon Plotkin, Colin Stirling, and Mads Tofte, editors, MIT Press.

Sew97a

Peter Sewell.
Global/local subtyping for a distributed $\pi$-calculus.
Technical Report 435, Computer Laboratory, University of Cambridge, August 1997.
Available from http://www.cl.cam.ac.uk/users/pes20/.

Sew97b

Peter Sewell.
Nonaxiomatisability of equivalences over finite state processes.
Annals of Pure and Applied Logic, 1997.
To appear.

Sew97c

Peter Sewell.
On Implementations and Semantics of a Concurrent Programming Language.
In Proceedings of CONCUR '97. LNCS 1243, pages 391-405. Springer-Verlag, 1997.

SWP97

Peter Sewell, Pawe T. Wojciechowski, and Benjamin C. Pierce.
Location independence for mobile agents.
Submitted for publication, 1997.

AM97

S. Abramsky, G. McCusker, Call-by-Value games (extended abstract) To appear in Proc. of CSL'97.

HY97

K. Honda, N. Yoshida, Game-theoretic analysis of Call-by-Value Computation (extended abstract). To appear in Proc. of ICALP'97.

M97

P.-A. Melliès, A factorisation theorem in Rewriting Theory. Proc. of the Category Theory and Computer Science symposium (CTCS'97).

BDER97

P. Baillot, V. Danos, and T. E. andL. Regnier.
Believe it or not, AJM's games model is a model of classical linear logic.
In Proc. 12^th LICS, pages 68-75. IEEE, 1997.

BDER97b

P. Baillot, V. Danos, T. Ehrhard, and L. Regnier.
Timeless games.
In Proc. CSL '97, volume to appear. Springer Verlag, 1997.

CuBoeh

P.-L. Curien.
Abstract böhm trees.
Mathematical Structures in Computer Science, 1998.
to appear.

CuHer96

P.-L. Curien and H. Herbelin.
Computing with abstract böhm trees.
In Proc. of Third Fuji International Symposium on Functional and Logic Programming, World Scientific (Singapour), 1998.

DHR96

V. Danos, H. Herbelin, and L. Regnier.
Game semantics and abstract machines.
In Proc. 11^th LICS, pages 394-405. IEEE, 1996.

LT97a

Leth Thomsen, L., and Thomsen, B.: ``Mobile Agents - THE new paradigm in computing'', ICL Systems Journal, Volume 12, Issue 1, pp. 14-40, May 1997.

LT97b

Thomsen, B.: ``Programming Languages, Analysis Tools and Concurrency Theory'', ACM Computing Surveys 28A(4), December 1996. (http://www.acm.org/pubs/articles/journals/surveys/1996-28-4es/a57-thomsen/a57-thomsen.html)

AFG98

M. Abadi, C. Fournet, and G. Gonthier.
Secure implementation of channel abstractions.
To be submitted for a conference, November 1997.

BFL98

M. Boreale, C. Fournet, and C. Laneve.
Bisimulations in the join-calculus.
Submitted for a conference, September 1997.

leF97

F. le Fessant, I. Piumarta, and M. Shapiro,
An implementation for complete asynchronous distributed garbage collection.
Submitted for publication, November 1997, available electronically ( http:www-sor.inria.frdocs).

Fou97

C. Fournet.
Security within a calculus of mobile agents?
April 1997, http://www.cs.nps.navy.mil/research/languages/statements/fournet.ps.

FLMR97

C. Fournet, C. Laneve, L. Maranget, and D. Rémy.
Implicit typing à la ML for the join-calculus.
In A. Mazurkiewicz and J. Winkowski, editors, CONCUR '97: Concurrency Theory (8th International Conference, Warsaw, Poland, July 1997), volume 1243 of LNCS, pages 196-212. Springer, 1997.

FouMa97

C. Fournet and L. Maranget.
The join-calculus language.
Available electronically (http://pauillac.inria.fr/join), June 1997.

Gon98

G. Gonthier.
On asynchronous barbs, simulations, and fair testing.
Submitted to a conference, Octobre 1997.

Le97

J.-J. Lévy.
Some results in the join-calculus.
In M. Abadi and T. Ito, editors, TACS '97: Theoretical Aspects of Computer Software, volume 1281 of LNCS, pages 233-249. Springer, 1997.

Ne97a

U. Nestmann.
What is a `good' encoding of guarded choice?
In C. Palamidessi and J. Parrow, editors, EXPRESS '97: Expressiveness in Concurrency (Santa Margherita Ligure, Italy, September 8-12, 1997), volume 7 of ENTCS. Elesevier Science Publishers, 1997.

NePie97

U. Nestmann and B. C. Pierce.
Decoding choice encodings.
In U. Montanari and V. Sassone, editors, CONCUR '96: Concurrency Theory (7th International Conference, Pisa, Italy, August 1996), volume 1119 of LNCS, pages 179-194. Springer, 1996.
Revised full version as report ERCIM-10/97-R051, European Research Consortium for Informatics and Mathematics, 1997.

NS97

U. Nestmann and M. Steffen.
Typing confluence.
In S. Gnesi and D. Latella, editors, Second International ERCIM Workshop on Formal Methods in Industrial Critical Systems (Cesena, Italy, July 4-5, 1997), pages 77-101. Consiglio Nazionale Ricerche di Pisa, 1997.
Also available as report ERCIM-10/97-R052, European Research Consortium for Informatics and Mathematics, 1997.

Am97

R. Amadio.
An asynchronous model of locality, failure, and process mobility.
In Proc. Coordination 97, Springer Lect. Notes in Comp. Sci. 1282, 1997.

AmCou97

R. Amadio and S. Coupet-Grimal.
Analysis of a guard condition in type theory (preliminary report).
Technical Report TR 1997.245. Also RR-3300 INRIA, Université de Provence (LIM), 1997.

AmCu97

R. Amadio and P.-L. Curien.
Domains and Lambda-Calculi.
Cambridge University Press.
To appear.

AmPra97

R. Amadio and S. Prasad.
Modelling IP mobility.
Technical Report TR 1997.244. Also RR-3301 INRIA, Université de Provence (LIM), 1997.

Bou97a

G. Boudol.
The pi-calculus in direct style.
In Proceedings POPL'97, 1997.

Bou97b

G. Boudol.
Typing the use of resources in a concurrent calculus.
In Proceedings ASIAN'97, LNCS 1345, 1997.

Dal97

S. Dal-Zilio.
Implicit polymorphic type system for the blue calculus.
Technical Report RR-3244, INRIA, 1997.

PiSa97

B. Pierce and D. Sangiorgi.
Behavioral equivalence in the polymorphic pi-calculus.
In 24th POPL. ACM Press, 1997.

San97a

D. Sangiorgi.
The name discipline of receptiveness.
volume 1256 of Lecture Notes in Computer Science. Springer Verlag, 1997.
Full paper available electronically as ftp://zenon.inria.fr/meije/theorie-par/davides/Receptiveness.ps.Z.

San97J

D. Sangiorgi.
Typed $\pi$-calculus at work: a proof of Jones's parallelisation transformation on concurrent objects.
Presented at the Fourth Workshop on Foundations of Object-Oriented Languages (FOOL 4). To appear in Theory and Practice of Object-oriented Systems, 1997.

Cou90

B. Courcelle.
Recursive applicative program schemes.
In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, chapter 9, pages 459-492. Elsevier Science Publishers B. V., 1990.

Lisp98

B. Lisper.
Computing in unpredictable environments: Semantics, reduction strategies, and program transformations.
Theoretical Comput. Sci., 190(1):61-85, Jan. 1998.

PV97

J. Parrow and B. Victor.
The update calculus (full version).
Technical Report DoCS 97/93, Department of Computer Systems, Uppsala University, Sweden, Sept. 1997.
Extended abstract to appear in the proceedings of AMAST'97.

NFP97a

De Nicola, R., Ferrari, G., Pugliese, R.,
Locality Based Linda: Programming with Explicit Localities, In Proc. TAPSOFT'97, LNCS 1214, 1997.

NFP97b

De Nicola, R., Ferrari, G., Pugliese, R.,
Coordinating Mobile Agents via Blackboards and Access Rights, In Proc. COORDINATION'97, LNCS 1282, 1997.

FFGMPR

Ferrari, G., Ferro, G., Gnesi, S., Montanari, U., Pistore, M., Ristori, G., An automata based verification environment for mobile processes, In Proc. TACAS'97, LNCS 1217, 1997.

FM97a

Ferrari, G., Montanari, U. A Tile-Based Coordination View of Asynchronous $\pi$-calculus, In Proc. MFCS'97, LNCS 1295, 1997.

FM97b

Ferrari, G., Montanari, U. Tiles for Concurrent and Located Calculi. In Proc. EXPRESS'97, ENTCS 7, 1997.

GM97

Gadducci, F. and Montanari, U., The Tile Model. In: Gordon Plotkin, Colin Stirling, and Mads Tofte, Eds., Proof, Language and Interaction: Essays in Honour of Robin Milner, MIT Press, to appear.

MP97

Montanari, U. and Pistore, M., Minimal Transition Systems for History-Preserving Bisimulation. In Proc. STACS'97, LNCS 1200, 1997.

BM97

Bruni, R., Montanari, U., Zero-Safe Nets, or Transition Synchronization Made Simple In Proc. EXPRESS'97, ENTCS 7, 1997.

HaHen97e

C. Hartonas and M. Hennessy.
Full abstractness for a functional/concurrent language with higher-order value-passing.
Full version available as Computer Science Technical Report 1/97, University of Sussex, 1997. Available from http://www.cogs.susx.ac.uk/.

Je97

A. Jeffrey.
Flow graphs and semantics of programs.
available from http://www.cogs.susx.ac.uk/users/alanje/premon/, 1997.

Ra97a

J. Rathke.
Unique fixpoint induction for value-passing processes.
In Proc. LICS'97, 12^th Annual Symposium on Logic in Computer Science, Warsaw. IEEE Computer Society Press, 1997.
To appear.

Ra97b

J. Rathke and M. Hennessy.
Local model checking for value-passing processes.
In Proc. TACS'97, International Symposium on Theoretical Aspects of Computer Software, Sendai. Springer-Verlag, 1997.

RieHen97a

J. Riely and M. Hennessy.
Distributed processes and location failures.
Technical Report 2/97, 1997.
Extended abstract presented at ICALP97.

RieHen97b

J. Riely and M. Hennessy.
A typed language for distributed mobile processes.
In Proc. POPL'98, ACM Conference on Principle of Programming Languages, San Diego.

PW97

A. Philippou and D. Walker,
On confluence in the $\pi$-calculus,
in Proceedings of International Colloquium on Automata, Languages and Programming, Bologna, July 1997, Springer-Verlag Lecture Notes in Computer Science, vol. 1256, 314-324.

LW97a

X. Liu and D. Walker,
Concurrent objects as mobile processes,
in Proof, Language and Interaction: Essays in Honour of Robin Milner, G. Plotkin, C. Stirling, and M. Tofte (eds.), MIT Press, to appear.

S97

M. Sawle,
A $\pi$-calculus semantics for actor systems,
MSc dissertation, University of Warwick, September 1997.

LW97b

X. Liu and D. Walker,
Partial confluence of processes and systems of objects,
Theoretical Computer Science B, to appear.

PW97b

A. Philippou and D. Walker,
On transformations of concurrent object programs,
Theoretical Computer Science B, to appear.

PW97c

A. Philippou and D. Walker,
Social confluence in client-server systems,
in Proceedings of Computer Science Logic, Utrecht, September 1996, Springer-Verlag Lecture Notes in Computer Science, vol. 1258, 385-398.

PW97d

A. Philippou and D. Walker,
A rigorous analysis of concurrent operations on B-trees,
in Proceedings of Concurrency Theory, Warsaw, July 1997, Springer-Verlag Lecture Notes in Computer Science, vol. 1243, 361-375.

P97phd

A. Philippou,
Reasoning about systems with evolving structure,
PhD thesis, University of Warwick, December 1996.

I97

C. Ionitoiu,
An operational semantics for loosely coupled systems,
MSc dissertation, University of Warwick, September 1997.