A polynomial nominal unification algorithm
type: Item
instance of: scholarly article
title: A polynomial nominal unification algorithm
zbMATH Open document ID: 1154.68108
author: Christophe Calvès
author: Maribel Fernández
published in: Theoretical Computer Science
publication date: 2008-09-16T00:00:00Z
Mathematics Subject Classification ID: 68W05
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 5344351
zbMATH Keywords: binders
zbMATH Keywords: \(\alpha \)-equivalence
zbMATH Keywords: nominal syntax
zbMATH Keywords: graphs
zbMATH Keywords: unification
describes a project that uses: Freshml
MaRDI profile type: Publication
full work available at URL: j.tcs.2008.05.012
OpenAlex ID: W2024790008
cites work: Implementing nominal unification
cites work: Nominal Matching and Alpha-Equivalence
cites work: Nominal rewriting
cites work: Numbering matters
cites work: A Logic Programming Language with Lambda-Abstraction, Function Variables, and Simple Unification
cites work: Nominal logic, a first order theory of names and binding
cites work: Q2721104
cites work: Q4951112
cites work: Unification of higher-order patterns in linear time and space
cites work: FreshML
cites work: Typed Lambda Calculi and Applications
cites work: Nominal unification
DOI: 10.1016/J.TCS.2008.05.012
description: scientific article; zbMATH DE number 5344351