The First-Order Nominal Link
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 177633
- A partial order of links
- scientific article; zbMATH DE number 2242589
- Nominal logic, a first order theory of names and binding
- The structure of first-order causality
- On the first-order prefix hierarchy
- Composition nominative first order calculi
- scientific article; zbMATH DE number 591392
- First-order theories of abstract dependence relations
- First Order Certainty Equivalence
Cites work
- A Logic Programming Language with Lambda-Abstraction, Function Variables, and Simple Unification
- A new approach to abstract syntax with variable binding
- A polynomial nominal unification algorithm
- An efficient nominal unification algorithm
- FreshML: programming with binders made simple
- scientific article; zbMATH DE number 3569825 (Why is no real title available?)
- Nominal (universal) algebra: equational logic with names and binding
- Nominal equational logic
- Nominal logic, a first order theory of names and binding
- Nominal Matching and Alpha-Equivalence
- Nominal rewriting
- Nominal unification
- Unification of higher-order patterns in linear time and space
Cited in
(9)- Completeness in PVS of a nominal unification algorithm
- Nominal unification
- A formalisation of nominal C-matching through unification with protected variables
- Nominal syntax with atom substitutions
- Formalising nominal C-unification generalised with protected variables
- Computer Science Logic
- Nominal narrowing
- An efficient nominal unification algorithm
- Unranked Nominal Unification
This page was built for publication: The First-Order Nominal Link
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3003496)
