Foundations of logic programming; (2nd extended ed.)
Foundations of logic programming; (2nd extended ed.)
Constraint Logic Programming in the Sequent Calculus
LPAR '94 Proceedings of the 5th International Conference on Logic Programming and Automated Reasoning
Nominal logic, a first order theory of names and binding
Information and Computation - TACS 2001
Constraint Logic Programming with Hereditary Harrop formulas
Theory and Practice of Logic Programming
A Sequent Calculus for Nominal Logic
LICS '04 Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science
Theoretical Computer Science
Nominal logic programming
A simpler proof theory for nominal logic
FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
Mechanized metatheory model-checking
Proceedings of the 9th ACM SIGPLAN international conference on Principles and practice of declarative programming
ACM Transactions on Programming Languages and Systems (TOPLAS)
| Hi-index | 0.00 |
Nominal logic programming is a form of logic programming with “concrete” names and binding, based on nominal logic, a theory of α-equivalence founded on swapping and freshness constraints. Previous papers have employed diverse characterizations of the semantics of nominal logic programs, including operational, denotational, and proof-theoretic characterizations; however, the formal properties and relationships among them have not been fully investigated. In this paper we give a uniform and improved presentation of these characterizations and prove appropriate soundness and completeness results. We also give some applications of these results.