Local Bigraphs and Confluence: Two Conjectures. (Extended Abstract)

Electronic Notes in Theoretical Computer Science

Volumn 175, Issue 3, 2007, Pages 65-73

  Milner, Robin ^a  

^a UNIVERSITY OF CAMBRIDGE   (United Kingdom)

Author keywords

bigraph; confluence; lambda calculus; locality

Indexed keywords

BIGRAPH LOCALITY; CONFLUENCE; LAMBDA CALCULUS;

COMPUTATIONAL METHODS; MODEL CHECKING; REAL TIME SYSTEMS;

GRAPH THEORY;

EID: 34250362340     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.entcs.2006.07.035     Document Type: Article

References (9)

1. Abadi M., Cardelli L., Curien P.-L., and Levy J.-J. Explicit substitutions. Journal of Functional Programming 1 (1991) 375-416
2. Barendregt H. The Lambda Calculus: its Syntax and Semantics (1984), North Holland
3. Bundgaard M., and Hildebrandt T. Bigraphical semantics of higher-order mobile embedded resources with local names. Proc. GT-VC 2005. Electronic Notes in Theoretical Computer Science 154 2 (2006) 7-29
4. Jensen, O-H. and Milner, R. (2003), Bigraphs and transitions. Proc 30th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL), 2003, 16pp
5. Jensen, O.H. and Milner, R. (2004), Bigraphs and mobile processes (revised). Technical Report 580, University of Cambridge Computer Laboratory. Available from http://www.cl.cam.ac.uk/users/rm135
6. Leifer J., and Milner R. Bisimulation congruences for reactive systems. Proc. CONCUR2000. LNCS Vol 1877 (2000) 243-258
7. Leifer, J. and Milner, R. (2006), Link graphs, transitions and Petri nets. To appear in Mathematical Structures in Computer Science
8. Milner, R. (2004), Bigraphs whose names have multiple locality. Technical Report UCAM-CL-TR-603, University of Cambridge, Computer Laboratory. Available from http://www.cl.cam.ac.uk/TechReports/UCAM-CL-TR-603.pdf
9. sub as an explicit substitution calculus (draft)