Nominal Logic Programming
| dc.creator | Cheney, James | |
| dc.creator | Urban, Christian | |
| dc.date | 2006-09-12 | |
| dc.date | 2007-08-20 | |
| dc.date.accessioned | 2026-07-07T10:02:36Z | |
| dc.date.available | 2026-07-07T10:02:36Z | |
| dc.description | 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. | |
| dc.description | 46 pages; 19 page appendix; 13 figures. Revised journal submission as of July 23, 2007 | |
| dc.identifier | https://arxiv.org/abs/cs/0609062 | |
| dc.identifier | http://arxiv.org/abs/cs/0609062 | |
| dc.identifier | ACM Transactions on Programming Languages and Systems 30(5):26, August 2008 | |
| dc.identifier | doi:10.1145/1387673.1387675 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/169029 | |
| dc.subject | Programming Languages | |
| dc.subject | Logic in Computer Science | |
| dc.subject | D.1.6; F.3.2; F.4.1 | |
| dc.title | Nominal Logic Programming | |
| dc.type | text |