On solving nominal disunification constraints
From MaRDI portal
Publication:2219072
DOI10.1016/J.ENTCS.2020.02.002zbMATH Open1495.03048OpenAlexW3014001713WikidataQ113317345 ScholiaQ113317345MaRDI QIDQ2219072FDOQ2219072
Authors: Mauricio Ayala-Rincón, Maribel Fernández, Deivid Vale, Daniele Nantes-Sobrinho 
Publication date: 19 January 2021
Full work available at URL: https://doi.org/10.1016/j.entcs.2020.02.002
Recommendations
Combinatory logic and lambda calculus (03B40) Logic in computer science (03B70) Semantics in the theory of computing (68Q55)
Cites Work
- Nominal sets. Names and symmetry in computer science
- Nominal (universal) algebra: equational logic with names and binding
- Nominal unification
- Title not available (Why is that?)
- Nominal rewriting
- Nominal Algebra and the HSP Theorem
- Equational problems and disunification
- Narrowing based procedures for equational disunification
- Equivariant unification
- On solving equations and disequations
- Combination techniques and decision problems for disunification
- Title not available (Why is that?)
- Matching and alpha-equivalence check for nominal terms
- Fixed-point constraints for nominal equational unification
- Nominal C-unification
- On solving nominal fixpoint equations
- Nominal narrowing
- Asymmetric unification and disunification
- Higher order disunification: some decidable cases
Cited In (4)
This page was built for publication: On solving nominal disunification constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2219072)
