Previous Contents

References

[AM98]
A. Asperti, H.Mairson Optimal b-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. in ``Cambridge Tracts in Theoretical Computer Science'' Series, Cambridge University Press, October 1998.

[BFL97]
M. Boreale, C. Fournet, C. Laneve: Bisimulations in the Join-Calculus. In Proc. Programming Concepts and Methods, Procomet '98, New York, U.S.A., 1998.

[FLMR98]
C. Fournet, C. Laneve, L. Maranget, D. Rèmy: Inheritance in the Join-Calculus. Draft, October 1998.

[BGHP98]
A. Barber, P.A. Gardner, M. Hasegawa and G. Plotkin, From Action Calculi to Linear Logic. European Association of Computer Science Logic, Springer-Verlag, 1998; conference article appears in BRICS Notes Series NS-97-1, 1997.

[CFW98]
G. L. Cattani, M. Fiore and G. Winskel. A Theory of Recursive Domains with Applications to Concurrency. Proceedings of the Thirteenth Annual IEEE Symposium on Logic in Computer Science, LICS '98, 214--225.

[CPW98]
G. L. Cattani, A. J. Power and G. Winskel. A Categorical Axiomatics for Bisimulation In Proceedings of CONCUR '98: Concurrency Theory (Nice). LNCS 1466, pages 581--596, September 1998.

[GH98]
P.A. Gardner and M. Hasegawa. Higher-order and Reflexive Action Calculi: their type-theory and models, submitted to Information and Computation, 1998.

[Lei98]
James Leifer. Bisimulation Congruences for Action Calculi. Thesis submitted to Trinity College, Cambridge, 1998.

[Mil99]
Robin Milner. Communicating and Mobile Systems: the Pi Calculus. Forthcoming (CUP Jan 1999)

[PCW98]
A. J. Power, G. L. Cattani and G. Winskel. A Representation Result for Free Cocompletions. BRICS Technical report RS-98-21, Department of Computer Science, University of Aarhus, September 1998. Submitted for publication.

[SWP98a]
Peter Sewell, Pawe T. Wojciechowski, and Benjamin C. Pierce. Location independence for mobile agents. In Proceedings of the Workshop on Internet Programming Languages (Chicago), May 1998.

[SWP98b]
Peter Sewell, Pawe T. Wojciechowski, and Benjamin C. Pierce. Location-independent communication for mobile agents: a two-level architecture. Submitted for publication.

[Sew98a]
Peter Sewell. Global/local subtyping and capability inference for a distributed p-calculus. In Proceedings of ICALP '98: International Colloquium on Automata, Languages and Programming (Aarhus). LNCS 1443, pages 695--706. Springer-Verlag, July 1998.

[Sew98b]
Peter Sewell. From rewrite rules to bisimulation congruences. Technical Report 444, University of Cambridge, June 1998.

[Sew98c]
Peter Sewell. From rewrite rules to bisimulation congruences. In Proceedings of CONCUR '98: Concurrency Theory (Nice). LNCS 1466, pages 269--284, September 1998.

[Mel98]
P.-A. Melliès, Axiomatic Rewriting Theory IV A stability theorem in Rewriting Theory, Proceedings of the 14th Annual Symposium on Logic in Computer Science, Indianapolis, pp. 287-298, 1998. LICS'98

[AHM98]
S. Abramsky, K. Honda and G. McCusker, A fully abstract game semantics for general references, Proceedings of the 14th Annual Symposium on Logic in Computer Science, Indianapolis, pp. 334--344, 1998. LICS '98

[BDER97]
Patrick Baillot, Vincent Danos, Thomas Ehrhard, and Laurent Regnier. Believe it or not, AJM's games model is a model of linear logic. In Proceedings of Logic in Computer Science '97. IEEE, 1997.

[BDER98]
Patrick Baillot, Vincent Danos, Thomas Ehrhard, and Laurent Regnier. Timeless games. In Proceedings of Computer Science Logic '98. Springer LNCS 1414, 1998.

[DCLN98]
Roberto Di Cosmo, Jean-Vincent Loddo, and Stéphane Nicolet. A game semantics foundation for logic programming. In Catuscia Palamidessi, Hugh Glaser, and Karl Meinke, editors, PLILP'98, volume 1490, pages 355--373, 1998.

[DHR96]
Vincent Danos, Hugo Herbelin, and Laurent Regnier. Games semantics and abstract machines. In Proceeding of Logic in Computer Science '96, 1996.

[LTL98]
J.-J. Levy, B. Thomsen, L. Leth: ``First Year Report for Esprit Working Group 21836 CONFER-2 CONcurrency and Functions: Evaluation and Reduction'', EATCS Bulletin Number 64 February 1998 pp. 42-62.

[TLT98]
B. Thomsen and L. Leth Thomsen: ``Towards global computations guided by concurrency theory'', EATCS Bulletin Number 66 October 1998 pp. 92-98.

[AFG98a]
Martín Abadi, Cédric Fournet, and Georges Gonthier. Secure implementation of channel abstractions. In Thirteenth Symposium on Logic in Computer Science (LICS '98, Indianapolis), June 1998, pages 105--116.

[AFG98b]
Martín Abadi, Cédric Fournet, and Georges Gonthier. Secure implementation of channel abstractions. Manuscript, full version of this paper, on the Web at http://pauillac.inria.fr/join, 1998.

[BFL98]
Michele Boreale, Cédric Fournet, and Cosimo Laneve. Bisimulations in the join-calculus. In IFIP Working Conference on Programming Concepts, Methods and Calculi (PROCOMET' 98). IFIP, June 1998.

[FG98]
Cédric Fournet and Georges Gonthier. A hierarchy of equivalences for asynchronous calculi. In Proc. of ICALP'98, July 1998.

[lF98a]
Fabrice Le Fessant, Ian Piumarta, and Marc Shapiro. An implementation for complete asynchronous distributed garbage collection. In Proceedings of SIGPLAN'98 Conference on Programming Languages Design and Implementation, ACM SIGPLAN Notices, Montreal, June 1998. ACM Press.

[Lav98]
Carolina Lavatelli. Deadlock sensitive types for lambda calculus with resources. In 8th Conference FST & TCS 1998, Chennai, India, 1998.

[lFM98]
Fabrice Le Fessant and Luc Maranget. Compiling join-patterns. In Uwe Nestmann and Benjamin C. Pierce, editors, HLCL '98: High-Level Concurrent Languages (Nice, France, September 12, 1998), volume 16.3 of entcs. Elsevier Science Publishers, 1998.

[AC98]
R. Amadio, S. Coupet-Grimal, « Analysis of a guard condition in type theory (extended abstract) », in : Proc. FOSSACS, ETAPS 98, Springer Lect. Notes in Comp. Sci. 1378, p. 48--62, 1998.

[AP98]
R. Amadio, S. Prasad, « Modelling IP mobility », in : Proc. CONCUR98, Springer Lect. Notes in Comp. Sci. 1466, p. 301--316, 1998.

[BS97]
M. Boreale, D. Sangiorgi, « Bisimulation in name-passing calculi without matching », in : thirteen LICS Conf., IEEE Computer Society Press, 1998.

[CH98]
I. Castellani, M. Hennessy, « Testing theories for asynchronous languages », in : Proceedings FST-TCS'98, 1998. To appear

[S98a]
S. Dal-Zilio, « Objets concurrents dans un p-calcul applicatif », in : accepté par les Journées Francophones des Langages Applicatifs, 1998.

[S98b]
S. Dal-Zilio, « Quiet and Bouncing Objects: Two Migration Abstractions in a Simple Distributed Blue Calculus », in : 1st International Workshop on Semantics of Objects as Processes, BRICS Notes Series, 1998.

[HKMN98]
H. Hüttel, J. Kleist, M. Merro, and U. Nestmann. Migration = cloning ; aliasing. To be presented at Sixth Workshop on Foundations of Object-Oriented Languages (FOOL 6), 1999.

[KlSa98]
J. Kleist, D. Sangiorgi, « Imperative Objects and Mobile Processes », in : Proc. IFIP Working Conference on Programming Concepts and Methods (PROCOMET'98), North-Holland, 1998.

[MeSa98]
M. Merro, D. Sangiorgi, « On asynchrony in name-passing calculi », in : 25th ICALP, LNCS, 1443, Springer Verlag, 1998.

[ME98]
M. Merro, « On the Expressiveness of Chi, Update and Fusion Calculi », Electronic Notes in Theoretical Computer Science Volume 16 , Issue 2

1998.

[STR98]
D. Sangiorgi, « Interpreting functions as pi-calculus processes: a tutorial », rapport de recherche NoRR-3470, INRIA-Sophia Antipolis, 1998.

[Bou98]
G. Boudol, « On the semantics of the call-by-name CPS-transform », available at the author's web page, 1998, submitted.

[1]
PV98a J. Parrow and B. Victor. The fusion calculus: Expressiveness and symmetry in mobile processes. In Proceedings of LICS '98, 1998.

[2]
PV98b J. Parrow and B. Victor. The tau-laws of fusion. In D. Sangiorgi and R. de Simone, eds, Proceedings of CONCUR '98, volume 1466 of LNCS, pages 99--114. Springer, Sept. 1998.

[3]
Vic98a B. Victor. The Fusion Calculus: Expressiveness and Symmetry in Mobile Processes. PhD thesis, Department of Computer Systems, Uppsala University, June 1998. Available as report DoCS 98/98.

[4]
VP98 B. Victor and J. Parrow. Concurrent constraints in the fusion calculus. In K. G. Larsen, S. Skyum and G. Winskel, eds, Proceedings of ICALP '98, volume 1443 of LNCS, pages 455--469. Springer, July 1998.

[BNFP98]
Bettini, L., De Nicola, R., Ferrari, G., Pugliese, R. Interactive Mobile Agents in XKLAIM. WETICE'98, Proceedings, IEEE, 1998, to appear.

[B98]
Bruni, R., A Logic for Modular Descriptions of Asynchronous and Synchronized Concurrent Systems (abstract) in Proceedings 2nd International Workshop on Rewriting Logic and its Applications, (Kirchner C., Kirchner H., Editors), ENTCS 15 (1998).

[BGM98]
Bruni R., Gadducci F., and Montanari U. Normal Forms for Partitions and Relations in Proceedings 13th Workshop on Algebraic Development Techniques, LNCS, to appear.

[BM98a]
Bruni, R. and Montanari, U. Zero-Safe Nets: The Individual Token Approach in Proceedings 12th Workshop on Algebraic Development Techniques, (Parisi-Presicce F., Editor), LNCS 1376, pp. 122--140 (1998).

[BMM98a]
Bruni R., Meseguer J. and Montanari U. Process and Term Tile Logic Technical Report SRI-CSL-98-06, SRI International (July 1998). Also Technical Report TR-98-09, Department of Computer Science, University of Pisa (1998).

[BMM98b]
Bruni R., Meseguer J. and Montanari U. Internal Strategies in a Rewriting Implementation of Tile Systems in Proceedings 2nd International Workshop on Rewriting Logic and its Applications, (Kirchner C., Kirchner H., Editors), ENTCS 15 (1998).

[BMM98c]
Bruni R., Meseguer J. and Montanari U. Implementing Tile Systems: Some Examples from Process Calculi in Proceedings 6th Italian Conference on Theoretical Computer Science, World Scientific, 1998.

[BMMS98]
Bruni R., Meseguer J., Montanari U. and Sassone V., A Comparison of Petri Net Semantics under the Collective Token Philosophy in Proceedings 4th Asian Computing Science Conference, (Hsiang J., Ohori A., Editors), LNCS, to appear.

[BM98b]
Bruni, R., Montanari, U., Zero-Safe Nets: Comparing the Collective and Individual Token Information and Computation, to appear.

[NFP98]
De Nicola, R., Ferrari, G., Pugliese, R., Klaim: a Kernel Language for Agents Interaction and Mobility. IEEE Transactions on Software Engineering, Vol.24(5):315-330, May, 1998.

[FGMPR98]
Ferrari,G., Gnesi, S., Montanari, U., Pistore, M. and Ristori, G. Verifying Mobile Processes in the HAL Environment, In Proc. CAV'98, LNCS 1427. Springer Verlag, 1998.

[FeM98]
Ferrari, G. and Montanari, U., Tile Formats for Located and Mobile Systems, To appear in Information and Computation, 1998.

[HLMP98]
Honsell, F., Lenisa, M., Montanari, U., Pistore, M. Final Semantics for the pi-Calculus, In Proc. PROCOMET'98, 1998.

[HIM98]
Hirsch, D., Inverardi, P., and Montanari, U., Modeling Software Architectures and Styles with Graph Grammars and Constraint Solving, to appear in Proceedings WICSA 98, 1998.

[MM98]
Montanari, U. and Meseguer, J., Mapping Tile Logic into Rewriting Logic, in: Francesco Parisi-Presicce, Ed., Recent Trends in Algebraic Development Techniques, Spinger LNCS 1376, 1998, pp. 62-91. i

[MP98]
Montanari , U. and Pistore, M. An Introduction to History Dependent Automata In Proc. HOOTS'98, ENTCS 10. Elsevier Science, 1998.

[MT98]
Montanari , U. and Talcott, C., Can Actors and pi-Agents Live Together?, in: Andrew Gordon, Andrew Pitts and Carolyn Talcott, Eds, Second Workshop on Higher-Order Operational Techniques in Semantics (HOOTS II), ENTCS, Vol. 10, 1998.

[HR98]
Matthew Hennessy and James Riely. Type-safe execution of mobile agents in anonymous networks (extended abstract). In Proceedings of 4th Workshop on Mobile Object Systems, Brussels, Belgium, July 1998. Full version available as Computer Science Technical Report 03/98. Available from http://www.cogs.susx.ac.uk/.

[Rat98]
J. Rathke. Resource based models for asynchrony. In Proc. FOSSACS'98, International Conference on Foundations of Software Science and Computation Structures, Lisbon. Springer-Verlag, 1998.

[RH98]
James Riely and Matthew Hennessy. Resource access control in systems of mobile agents (extended abstract). In Proceedings of 3rd International Workshop on High-Level Concurrent Languages, Nice, France, September 1998. Full version available as Computer Science Technical Report 02/98. Available from http://www.cogs.susx.ac.uk/.

[Yos98]
Nobuko Yoshida. Minimality and separation results on asynchronous mobile processes: representability theorem by concurrent combinators (extended abstract). In Proceedings of CONCUR98, Nice, France, September 1998. Full version available as Computer Science Technical Report 05/98. Available from http://www.cogs.susx.ac.uk/.

[QW98]
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, to appear.

[LW98]
X. Liu and D. Walker, Partial confluence of processes and systems of objects, Theoretical Computer Science 206 (1998) 127--162.

[PW98]
A. Philippou and D. Walker, On transformations of concurrent object programs, Theoretical Computer Science 195 (1998) 259--289.

Previous Contents