A Name Abstraction Functor for Named Sets

DOI10.1016/j.entcs.2008.05.019zbMath1279.68052OpenAlexW2010455780MaRDI QIDQ2873662

Ugo Montanari, Vincenzo Ciancia

Publication date: 24 January 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.2008.05.019

zbMATH Keywords

bindingnominal setsgarbage collectionnamed setsDe Bruijn indexes

Mathematics Subject Classification ID

Abstract data types; algebraic specification (68Q65) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (6)

Families of Symmetries as Efficient Models of Resource Binding ⋮ A coalgebraic semantics for causality in Petri nets ⋮ Symmetries, local names and dynamic (de)-allocation of names ⋮ A Category of Explicit Fusions ⋮ Ugo Montanari and Software Verification ⋮ Event based choreography

Uses Software

• SLMC

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Modal logics for mobile processes
• A new approach to abstract syntax with variable binding
• About permutation algebras, (pre)sheaves and named sets
• A calculus of mobile processes. I
• A fully abstract model for the \(\pi\)-calculus.
• Compositional SOS and beyond: A coalgebraic view of open systems
• Coalgebraic minimization of HD-automata for the \(\pi\)-calculus using polymorphic types
• A spatial logic for concurrency. I
• Comparing operational models of name-passing process calculi
• Structured coalgebras and minimal HD-automata for the \(\pi\)-calculus
• Institutions: abstract model theory for specification and programming
• Coalgebraic Modal Logic Beyond Sets
• Foundations of Software Science and Computation Structures

This page was built for publication: A Name Abstraction Functor for Named Sets