skip to main content
article

Computational flux

Published:01 January 2001Publication History

Abstract

No abstract available.

References

  1. 1 Abadi, M. and Gordon, A.D. (1997), A calculus for cryptographic protocols: the spi calculus. Proc. 4th ACM Conference on Computer and Communications Security, ACM Press, 36-47.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. 2 Berry, G. and Boudol, G. (1992), The chemical abstract machine. Journal of Theoretical Computer Science, Vol 96, pp217-248.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. 3 Cardelli, L. and Gordon, A.D. (2000), Mobile ambients. Foundations of System Specification and Computational Structures, LNCS 1378, 140-155.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. 4 Cattarti, G.L., Leifer, J.J. and Milner, R. (2000),. Contexts and Embeddings for dosed shallow action graphs. University of Cambridge Computer Laboratory, Technical Report 496. {Submitted for publication. Available at http://www.cam.cl, ac.uk/usors/jj121 .]]Google ScholarGoogle Scholar
  5. 5 Fournet, C. and Gonthier, G. (1996), The reflexive Chain and the join calculus. Proc. 23rd Annual ACM Symposium on Principles of Programming Languages, Florida, pp372-385.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. 6 Gardner, P.A. and Wischik, L.G. (2000), Explicit fusions. Proc. MFCS 2000. LNCS 1893.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. 7 Lafont, Y. (1990), Interaction nets. Proc. 17th ACM Symposium on Principles of Programming Languages (POPL 90), pp95-108.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. 8 Leifer, J.J. and Milner, R. (2000), Deriving bisimulation congruences for reactive systems. Proc. CONCUR2000. {Available at http : //www. cam. el. ac. uk/users /j j 121 .}]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. 9 Milner, R. (1979), Flowgraphs and Flow Algebras. Journal of ACM, 26,4,1979, pp794-818.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. 10 Milner, R. (1996), Calculi for interaction. Acta Informatica 33, 707-737.]]Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. 11 Milner, R., Parrow, J. and Walker D. (1992), A calculus of mobile processes, Parts I and II. Journal of Information and Computation, Vol 100, ppl-40 and pp41-77.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. 12 Parrow, J. and Victor, B. (1998), The fusion calculus: expressiveness and symmetry in mobile processes. Proc. LICS'98, IEEE Computer Society Press.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. 13 Petri, C.A. (1962), Fundamentals of a theory of asynchronous information flow. Proc. IFIP Congress '62, Noah Holland, pp386-390.]]Google ScholarGoogle Scholar
  14. 14 Pierce, B.C. and Turner, D.N. (2000), Pict: A programruing language based on the pi-calculus. In Proof Language and Interaction: Essays in Honour of Robin Milner, ed. G.D.Plotkin, C.P.Stirling and M.Tofte, MIT Press, pp455- 494.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. 15 Wadsworth, C.E (1971), Semantics and pragmatics of the lambda-calculus. Dissertation, Oxford University.]]Google ScholarGoogle Scholar
  16. 16 Wojciechowski, ET. and Sewell, P. (1999), Nomadic Pict: Language and infrastructure design for mobile agents. Proc. ASA/MA '99, Palm Springs, California.]] Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Computational flux

              Recommendations

              Comments

              Login options

              Check if you have access through your login credentials or your institution to get full access on this article.

              Sign in

              Full Access

              • Published in

                cover image ACM SIGPLAN Notices
                ACM SIGPLAN Notices  Volume 36, Issue 3
                March 2001
                303 pages
                ISSN:0362-1340
                EISSN:1558-1160
                DOI:10.1145/373243
                Issue’s Table of Contents
                • cover image ACM Conferences
                  POPL '01: Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
                  January 2001
                  304 pages
                  ISBN:1581133367
                  DOI:10.1145/360204

                Copyright © 2001 ACM

                Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

                Publisher

                Association for Computing Machinery

                New York, NY, United States

                Publication History

                • Published: 1 January 2001

                Check for updates

                Qualifiers

                • article

              PDF Format

              View or Download as a PDF file.

              PDF

              eReader

              View online with eReader.

              eReader