Hard Life with Weak Binders

DOI10.1016/j.entcs.2009.06.013zbMath1291.68278OpenAlexW2086215097MaRDI QIDQ5170666

Massimo Bartoletti, Roberto Zunino, Gian-Luigi Ferrari, Pierpaolo Degano

Publication date: 23 July 2014

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.2009.06.013

zbMATH Keywords

variable bindingalpha-conversionfreshnessnominal calculi

Mathematics Subject Classification ID

Logic in computer science (03B70) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items

Hard Life with Weak Binders

Uses Software

• Freshml

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A new approach to abstract syntax with variable binding
• Algebra of communicating processes with abstraction
• A calculus of mobile processes. II
• Names of the \(\pi\)-calculus agents handled locally
• Type reconstruction for linear \(\pi\)-calculus with I/O subtyping.
• On a monadic semantics for freshness
• Structured coalgebras and minimal HD-automata for the \(\pi\)-calculus
• A theory of contracts for web services
• Proof Pearl: De Bruijn Terms Really Do Work
• Closed reduction: explicit substitutions without $\alpha$ -conversion
• Hard Life with Weak Binders
• FreshML
• Types and Effects for Resource Usage Analysis