Nominal Logic Programming
dc.contributor.author
James Cheney
en
dc.contributor.author
Christian Urban
en
dc.date.accessioned
2011-01-17T16:58:59Z
dc.date.available
2011-01-17T16:58:59Z
dc.date.issued
2008-08
dc.date.updated
2011-01-17T16:59:00Z
dc.description.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, α-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.
en
dc.extent.pageNumbers
26
en
dc.identifier.doi
10.1145/1387673.1387675
dc.identifier.eIssn
1558-4593
dc.identifier.issn
0164-0925
dc.identifier.uri
http://portal.acm.org/citation.cfm?doid=1387673.1387675
dc.identifier.uri
http://hdl.handle.net/1842/4608
dc.language.iso
en
dc.publisher
Association for Computing Machinery
en
dc.title
Nominal Logic Programming
en
dc.type
Article
en
rps.issue
5
en
rps.title
ACM Transactions on Programming Languages and Systems
en
rps.volume
30
en
Files
Original bundle
1 - 1 of 1
- Name:
- CheneyJ_Nominal Logic Programming.pdf
- Size:
- 585 KB
- Format:
- Adobe Portable Document Format
This item appears in the following Collection(s)