References

  1. Maxime Beauquier & Carstern Schürmann (2010): Bigraphs in CLF. Technical Report, TR 2010-126. IT University of Copenhagen.
  2. Iliano Cervesato, Frank Pfenning, David Walker & Kevin Watkins (2002): A Concurrent Logical Framework II: Examples and Applications. Technical Report, CMU-CS-02-102. Caregie Mello University, Pittsburgh, PA 15213.
  3. Ole Høgh Jensen & Robin Milner (2003): Bigraphs and Transitions. In: Proceedings of the 30th ACM SIGPLAN–SIGACT Symposium on Principles of Programming Languages (POPL'03). ACM Press, pp. 38–49, doi:10.1145/604131.604135.
  4. Pablo López, Frank Pfenning, Jeff Polakow & Kevin Watkins (2005): Monadic concurrent linear logic programming. In: Pedro Barahona & Amy P. Felty: Proceedings of the 7th International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming, Lisbon, Portugal, pp. 35–46, doi:10.1145/1069774.1069778.
  5. Robin Milner (2003): Bigraphs for Petri Nets. In: Jörg Desel, Wolfgang Reisig & Grzegorz Rozenberg: Lectures on Concurrency and Petri Nets, Advances in Petri Nets, Lecture Notes in Computer Science 3098. Springer-Verlag, pp. 686–701, doi:10.1007/978-3-540-27755-2_19.
  6. Robin Milner (2006): Pure Bigraphs: Structure and Dynamics. Information and Computation 204(1), pp. 60–122, doi:10.1016/j.ic.2005.07.003.
  7. Robin Milner (2009): The Space and Motion of Communication Agents. Cambridge University Press.
  8. Anders Schack-Nielsen & Carsten Schürmann (2008): Celf — A Logical Framework for Deductive and Concurrent Systems (System Description). In: IJCAR '08: Proceedings of the 4th international joint conference on Automated Reasoning. Springer-Verlag, Berlin, Heidelberg, pp. 320–326, doi:10.1007/978-3-540-71070-7_28.
  9. Anders Schack-Nielsen & Carsten Schürmann (2010): Pattern Unification for the Lambda Calculus with Linear and Affine Types. Electronic Proceedings in Theoretical Computer Science 34, pp. 101–116, doi:10.4204/EPTCS.34.9. In Proceedings LFMTP 2010.

Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org