Unranked Nominal Unification
From MaRDI portal
Publication:6487232
Recommendations
Cites work
- scientific article; zbMATH DE number 3569825 (Why is no real title available?)
- scientific article; zbMATH DE number 3577484 (Why is no real title available?)
- scientific article; zbMATH DE number 599028 (Why is no real title available?)
- scientific article; zbMATH DE number 2043541 (Why is no real title available?)
- A Machine-Oriented Logic Based on the Resolution Principle
- A certified functional nominal C-unification algorithm
- A formalisation of nominal \(\alpha\)-equivalence with A, C, and AC function symbols
- A new approach to abstract syntax with variable binding
- Artificial Intelligence and Symbolic Computation
- Completeness in PVS of a nominal unification algorithm
- Fixed-point constraints for nominal equational unification
- Flexary operators for formalized mathematics
- Foundations of Information and Knowledge Systems
- Handbook of automated reasoning. In 2 vols
- Higher-order unification and matching
- Knowledge representation, the world wide web, and the evolution of logic
- Mathematical Knowledge Management
- Minimal and complete word unification
- Nominal C-unification
- Nominal logic, a first order theory of names and binding
- Nominal unification
- Nominal unification of higher order expressions with recursive let
- Nominal unification with atom and context variables
- On nominal syntax and permutation fixed points
- On the relation between context and sequence unification
- Sequence Unification Through Currying
- Solving equations with sequence variables and sequence functions
- Term Rewriting and All That
- Unification modulo \(\alpha\)-equivalence in a mathematical assistant system
- Unification theory
- Unification: a multidisciplinary survey
Cited in
(2)
This page was built for publication: Unranked Nominal Unification
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6487232)
