Nominal Logic Programming

Details Nominal Logic Programming Nominal Logic Programming

2006-09-12

arxiv.org/abs/cs/0609062v2

ACM Transactions on Programming Languages and Systems 30(5):26, August 2008

Computer Science

Programming Languages

46 pages; 19 page appendix; 13 figures. Revised journal submission as of July 23, 2007

Scientific paper

10.1145/1387673.1387675

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.

Affiliated with

Also associated with

No associations

Rating

Nominal Logic Programming does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Nominal Logic Programming, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Nominal Logic Programming will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-691132