Fixed-point constraints for nominal equational unification
From MaRDI portal
Publication:4993333
DOI10.4230/LIPICS.FSCD.2018.7zbMATH Open1462.68089OpenAlexW2886708969MaRDI QIDQ4993333FDOQ4993333
Maribel Fernández, Daniele Nantes-Sobrinho, Mauricio Ayala-Rincón
Publication date: 15 June 2021
Full work available at URL: https://doi.org/10.4230/LIPIcs.FSCD.2018.7
Recommendations
Cites Work
- Nominal logic, a first order theory of names and binding
- Nominal sets. Names and symmetry in computer science
- A new approach to abstract syntax with variable binding
- Nominal unification
- Nominal rewriting
- A polynomial nominal unification algorithm
- Capture-avoiding substitution as a nominal algebra
- Equivariant unification
- Nominal unification of higher order expressions with recursive let
- Unifying Nominal Unification
- A formalisation of nominal \(\alpha\)-equivalence with A and AC function symbols
Cited In (11)
- On solving nominal disunification constraints
- Meta-variables as infinite lists in nominal terms unification and rewriting
- A formalisation of nominal C-matching through unification with protected variables
- Title not available (Why is that?)
- Unranked Nominal Unification
- A formalisation of nominal \(\alpha\)-equivalence with A, C, and AC function symbols
- Formalising nominal C-unification generalised with protected variables
- A Certified Functional Nominal C-Unification Algorithm
- Narrowing based procedures for equational disunification
- Nominal Unification and Matching of Higher Order Expressions with Recursive Let
- Title not available (Why is that?)
This page was built for publication: Fixed-point constraints for nominal equational unification
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4993333)
