Strong nominal semantics for fixed-point constraints

DOI10.46298/ENTICS.14777MaRDI QIDQ6831453zbMATH OpenFDO

Authors Ali K. Caires-Santos, Maribel Fernández, Daniele Nantes-Sobrinho

Publication date 2 April 2026

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.46298/ENTICS.14777

zbMATH Keywords

programming languagessemanticsbindingnominal algebra

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Semantics in the theory of computing (68Q55)

Cites work

• A formalisation of nominal \(\alpha\)-equivalence with A, C, and AC function symbols
• A new approach to abstract syntax with variable binding
• AC complement problems: Satisfiability and negation elimination
• An efficient nominal unification algorithm
• Anti-pattern Matching Modulo
• Equational problems and disunification
• Formalising nominal C-unification generalised with protected variables
• FreshML: programming with binders made simple
• Logic Programming
• Matching and alpha-equivalence check for nominal terms
• Narrowing based procedures for equational disunification
• Nominal (universal) algebra: equational logic with names and binding
• Nominal Algebra and the HSP Theorem
• Nominal equational problems
• Nominal logic, a first order theory of names and binding
• Nominal rewriting
• Nominal sets. Names and symmetry in computer science
• Nominal unification
• On nominal syntax and permutation fixed points
• On solving nominal disunification constraints
• On solving nominal fixpoint equations

Cited in

(1)

• Equational reasoning modulo commutativity in languages with binders

This page was built for publication: Strong nominal semantics for fixed-point constraints

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6831453)