Nominal logic programming

  title={Nominal logic programming},
  author={James Cheney and Christian Urban},
  journal={ACM Trans. Program. Lang. Syst.},
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, α-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… CONTINUE READING
Highly Cited
This paper has 74 citations. REVIEW CITATIONS


Publications citing this paper.

74 Citations

Citations per Year
Semantic Scholar estimates that this publication has 74 citations based on the available data.

See our FAQ for additional information.


Publications referenced by this paper.
Showing 1-10 of 12 references

A Logic for Reasoning about Generic Judgments

Electr. Notes Theor. Comput. Sci. • 2007
View 6 Excerpts
Highly Influenced

A Linear Logical Framework

Inf. Comput. • 2002
View 5 Excerpts
Highly Influenced

Nominal logic programming

Ph.D. thesis, Cornell University, Ithaca, NY. • 2004
View 8 Excerpts
Highly Influenced

Types and programming languages

View 3 Excerpts
Highly Influenced

Similar Papers

Loading similar papers…