Show simple item record

ACM Transactions on Programming Languages and Systems

dc.contributor.authorJames Cheney
dc.contributor.authorChristian Urban
dc.date.accessioned2011-01-17T16:58:59Z
dc.date.available2011-01-17T16:58:59Z
dc.date.issued2008-08
dc.identifier.issn0164-0925en
dc.identifier.urihttp://portal.acm.org/citation.cfm?doid=1387673.1387675en
dc.identifier.urihttp://hdl.handle.net/1842/4608
dc.description.abstractNominal 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.language.isoenen
dc.publisherAssociation for Computing Machineryen
dc.titleNominal Logic Programmingen
dc.typeArticleen
dc.identifier.doi10.1145/1387673.1387675en
rps.issue5en
rps.volume30en
rps.titleACM Transactions on Programming Languages and Systemsen
dc.extent.pageNumbers26en
dc.date.updated2011-01-17T16:59:00Z
dc.identifier.eIssn1558-4593en


Files in this item

This item appears in the following Collection(s)

Show simple item record