Nominal Unification and Matching of Higher Order Expressions with Recursive Let
From MaRDI portal
Publication:5075515
DOI10.3233/FI-222110MaRDI QIDQ5075515
Mateu Villaret, Yunus D. K. Kutz, Temur Kutsia, Jordi Levy, Manfred Schmidt-Schauss
Publication date: 16 May 2022
Published in: Fundamenta Informaticae (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2102.08146
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Parameter reduction and automata evaluation for grammar-compressed trees
- Equivariant unification
- A polynomial nominal unification algorithm
- Graph isomorphism is in the low hierarchy
- The undecidability of the second-order unification problem
- A unification algorithm for typed \(\bar\lambda\)-calculus
- Complexity of the hamiltonian cycle in regular graph problem
- Nominal unification with atom-variables
- Nominal C-unification
- Completeness in PVS of a nominal unification algorithm
- A formalisation of nominal \(\alpha\)-equivalence with A and AC function symbols
- On the undecidability of second-order unification
- Nominal unification
- Nominal rewriting
- Nominal unification of higher order expressions with recursive let
- Unification and matching on compressed terms
- Algorithms for Extended Alpha-Equivalence and Complexity
- Permissive nominal terms and their unification: an infinite, co-infinite approach to nominal techniques
- Safety of Nöcker's strictness analysis
- An Efficient Unification Algorithm
- A Logic Programming Language with Lambda-Abstraction, Function Variables, and Simple Unification
- The Planar Hamiltonian Circuit Problem is NP-Complete
- Isomorphism Testing for Graphs, Semigroups, and Finite Automata are Polynomially Equivalent Problems
- CoCaml: Functional Programming with Regular Coinductive Types
- Fixed-Point Constraints for Nominal Equational Unification
- Computer Science Logic
- A rewriting calculus for cyclic higher-order term graphs
- Graph isomorphism in quasipolynomial time [extended abstract]
- An Efficient Nominal Unification Algorithm
- Coinductive Logic Programming
- General Bindings and Alpha-Equivalence in Nominal Isabelle
- Nominal Unification from a Higher-Order Perspective
