Nominal logic programming

James Cheney, Christian Urban

Research output: Contribution to journalArticlepeer-review

Abstract

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.
Original languageEnglish
Article number26
Number of pages47
JournalACM Letters on Programming Languages and Systems
Volume30
Issue number5
DOIs
Publication statusPublished - Aug 2008

Keywords

  • Nominal logic
  • logic programming
  • name-binding
  • semantics

Fingerprint

Dive into the research topics of 'Nominal logic programming'. Together they form a unique fingerprint.

Cite this