Local Bigraphs and Confluence: Two Conjectures

DOI10.1016/j.entcs.2006.07.035zbMath1277.68197OpenAlexW2157460885WikidataQ123165446 ScholiaQ123165446MaRDI QIDQ2866344

Arthur J. Milner

Publication date: 13 December 2013

Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.entcs.2006.07.035

zbMATH Keywords

confluencelocalitylambda calculusbigraph

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Combinatory logic and lambda calculus (03B40)

Related Items

Reactive systems, (semi-)saturated semantics and coalgebras on presheaves ⋮ The Negligible and Yet Subtle Cost of Pattern Matching ⋮ Unification for $$\lambda $$ -calculi Without Propagation Rules ⋮ The Prismoid of Resources ⋮ A resource aware semantics for a focused intuitionistic calculus ⋮ On the value of variables ⋮ A strong call-by-need calculus ⋮ Exponentials as Substitutions and the Cost of Cut Elimination in Linear Logic ⋮ Tight typings and split bounds, fully developed ⋮ A prismoid framework for languages with resources ⋮ Reactive Systems, Barbed Semantics, and the Mobile Ambients ⋮ RPO, Second-Order Contexts, and λ-Calculus ⋮ Unnamed Item ⋮ The Useful MAM, a Reasonable Implementation of the Strong $$\lambda $$ -Calculus ⋮ A Fresh Look at the λ-Calculus ⋮ Kind Bigraphs ⋮ (In)efficiency and reasonable cost models ⋮ An Algebra for Directed Bigraphs

Cites Work

• The lambda calculus. Its syntax and semantics. Rev. ed.
• Bigraphs and transitions
• Transition systems, link graphs and Petri nets
• Explicit substitutions
• Unnamed Item
• Unnamed Item