Constraint solving in non-permutative nominal abstract syntax

DOI10.2168/LMCS-7(3:6)2011zbMath1237.68063OpenAlexW2074167529MaRDI QIDQ3224672

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

constraint solvingalpha-equivalencenominal abstract syntax

Mathematics Subject Classification ID

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

Related Items (1)

Nominal unification with atom-variables

Uses Software

• Twelf

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