Nominal syntax with atom substitutions
From MaRDI portal
Publication:2662669
DOI10.1016/j.jcss.2021.01.002zbMath1477.68138OpenAlexW3126385261MaRDI QIDQ2662669
Maribel Fernández, Jesús Emilio Domínguez
Publication date: 14 April 2021
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jcss.2021.01.002
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A new approach to abstract syntax with variable binding
- Capture-avoiding substitution as a nominal algebra
- A polynomial nominal unification algorithm
- The undecidability of the second-order unification problem
- Third order matching is decidable
- Checking overlaps of nominal rewriting rules
- On the undecidability of second-order unification
- Nominal unification
- Nominal logic, a first order theory of names and binding
- Nominal syntax with atom substitutions: matching, unification, rewriting
- Nominal rewriting
- Nominal Equational Logic
- Unifying Nominal Unification
- The First-Order Nominal Link
- Permissive nominal terms and their unification: an infinite, co-infinite approach to nominal techniques
- From nominal to higher-order rewriting and back again
- Nominal Matching and Alpha-Equivalence
- Nominal (Universal) Algebra: Equational Logic with Names and Binding
- Decidability of fourth-order matching
- FreshML
- Dependent Types for Nominal Terms with Atom Substitutions
- Confluence of orthogonal nominal rewriting systems revisited
- Computer Science Logic
- Logic Programming
- An Efficient Nominal Unification Algorithm
- Automata, Languages and Programming
- α lean TA P: A Declarative Theorem Prover for First-Order Classical Logic
- (Nominal) Unification by Recursive Descent with Triangular Substitutions
- Nominal Unification from a Higher-Order Perspective
This page was built for publication: Nominal syntax with atom substitutions
