Affiliation:
1. University of Edinburgh, Edinburgh, Scotland
2. Technische Universität, München
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.
Funder
Office of Naval Research
Engineering and Physical Sciences Research Council
Air Force Office of Scientific Research
Publisher
Association for Computing Machinery (ACM)
Reference76 articles.
1. Explicit substitutions
2. Mechanized Metatheory for the Masses: The PoplMark Challenge
3. Barendregt H. P. 1984. The Lambda Calculus. North-Holland. Barendregt H. P. 1984. The Lambda Calculus. North-Holland.
4. A Linear Logical Framework
Cited by
26 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Nominal Matching Logic;Proceedings of the 24th International Symposium on Principles and Practice of Declarative Programming;2022-09-20
2. ON NOMINAL SYNTAX AND PERMUTATION FIXED POINTS;LOG METH COMPUT SCI;2020
3. Towards Meta-interpretive Learning of Programming Language Semantics;Inductive Logic Programming;2020
4. Typed Nominal Rewriting;ACM Transactions on Computational Logic;2018-02-15
5. Validating Brouwer's continuity principle for numbers using named exceptions;Mathematical Structures in Computer Science;2017-11-02