Constraint solving in non-permutative nominal abstract syntax

DOI10.2168/LMCS-7(3:6)2011MaRDI QIDQ3224672zbMATH OpenOpenAlexFDO

Authors Matthew R. Lakin

Publication date 2 April 2012

Published in Logical Methods in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2168/lmcs-7(3:6)2011

zbMATH Keywords

alpha-equivalenceconstraint solvingnominal abstract syntax

Mathematics Subject Classification ID

Logic in computer science (03B70) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Recommendations

• On solving nominal fixpoint equations
• On solving nominal disunification constraints
• Equivariant unification
• Automata, Languages and Programming
• A polynomial nominal unification algorithm

Cited in

(2)

• Nominal unification with atom-variables
• Solving Not-Substring Constraint withFlat Abstraction

Describes a project that uses

Uses Software

• Twelf

This page was built for publication: Constraint solving in non-permutative nominal abstract syntax

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3224672)