Nominal Logic Programming
<|reference_start|>Nominal Logic Programming: Nominal logic is an extension of first-order logic which provides a simple foundation for formalizing and reasoning about abstract syntax modulo consistent renaming of bound names (that is, alpha-equivalence). This article investigates logic programming based on nominal logic. We describe some typical nominal logic programs, and develop the model-theoretic, proof-theoretic, and operational semantics of such programs. Besides being of interest for ensuring the correct behavior of implementations, these results provide a rigorous foundation for techniques for analysis and reasoning about nominal logic programs, as we illustrate via examples.<|reference_end|>
@article{cheney2006nominal,
    title={Nominal Logic Programming},
    author={James Cheney, Christian Urban},
    journal={ACM Transactions on Programming Languages and Systems 30(5):26,
  August 2008},
    year={2006},
    doi={10.1145/1387673.1387675},
    archivePrefix={arXiv},
    eprint={cs/0609062},
    primaryClass={cs.PL cs.LO}
}