A polymorphic type system for PROLOG.
Artificial Intelligence
Programming in Prolog (3rd ed.)
Programming in Prolog (3rd ed.)
Theoretical Computer Science
Foundations of logic programming; (2nd extended ed.)
Foundations of logic programming; (2nd extended ed.)
PLDI '88 Proceedings of the ACM SIGPLAN 1988 conference on Programming Language design and Implementation
A logical analysis of modules in logic programming
Journal of Logic Programming
Qu-Prolog: an extended Prolog for meta level programming
Meta-programming in logic programming
Logic programming in the LF logical framework
Logical frameworks
Horn clause programs with polymorphic types: semantics and resolution
TAPSOFT '89 2nd international joint conference on Theory and practice of software development
A framework for defining logics
Journal of the ACM (JACM)
A calculus of mobile processes, I
Information and Computation
The art of Prolog (2nd ed.): advanced programming techniques
The art of Prolog (2nd ed.): advanced programming techniques
The Qu-Prolog unification algorithm: formalisation and correctness
Theoretical Computer Science - Special issue on theoretical computer science in Australia and New Zealand
Proof-theoretic foundation of compilation in logic programming languages
JICSLP'98 Proceedings of the 1998 joint international conference and symposium on Logic programming
The Semantics of Predicate Logic as a Programming Language
Journal of the ACM (JACM)
Types and programming languages
Types and programming languages
Dynamic Logic
PI-Calculus: A Theory of Mobile Processes
PI-Calculus: A Theory of Mobile Processes
Concepts in Programming Languages
Concepts in Programming Languages
Constraint Logic Programming in the Sequent Calculus
LPAR '94 Proceedings of the 5th International Conference on Logic Programming and Automated Reasoning
Separation Logic: A Logic for Shared Mutable Data Structures
LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
A Proposal for Modules in Lambda-Prolog
ELP '93 Proceedings of the 4th International Workshop on Extensions of Logic Programming
A Metalanguage for Programming with Bound Names Modulo Renaming
MPC '00 Proceedings of the 5th International Conference on Mathematics of Program Construction
A Logic Programming Language Based on Binding Algebras
TACS '01 Proceedings of the 4th International Symposium on Theoretical Aspects of Computer Software
Information and Computation
Handbook of automated reasoning
Semantical Analysis of Higher-Order Abstract Syntax
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
Abstract Syntax and Variable Binding
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
DalI: An Untyped CBV Operational Semantics and Equational Theoryofr Datatypes with Binders(Technical Development)
FreshML: programming with binders made simple
ICFP '03 Proceedings of the eighth ACM SIGPLAN international conference on Functional programming
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
Multi-threading and message communication in Qu-Prolog
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
Scrap your nameplate: (functional pearl)
Proceedings of the tenth ACM SIGPLAN international conference on Functional programming
A proof theory for generic judgments
ACM Transactions on Computational Logic (TOCL)
Alpha-structural recursion and induction
Journal of the ACM (JACM)
Proceedings of the 34th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
On a monadic semantics for freshness
Theoretical Computer Science - Applied semantics: Selected topics
A Logic for Reasoning about Generic Judgments
Electronic Notes in Theoretical Computer Science (ENTCS)
Electronic Notes in Theoretical Computer Science (ENTCS)
Static Name Control for FreshML
LICS '07 Proceedings of the 22nd Annual IEEE Symposium on Logic in Computer Science
Optimizing the runtime processing of types in polymorphic logic programming languages
LPAR'05 Proceedings of the 12th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
The semantics of nominal logic programs
ICLP'06 Proceedings of the 22nd international conference on Logic Programming
Mechanized metatheory for the masses: the PoplMark challenge
TPHOLs'05 Proceedings of the 18th international conference on Theorem Proving in Higher Order Logics
Nominal techniques in Isabelle/HOL
CADE' 20 Proceedings of the 20th international conference on Automated Deduction
A simpler proof theory for nominal logic
FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
Avoiding equivariance in alpha-prolog
TLCA'05 Proceedings of the 7th international conference on Typed Lambda Calculi and Applications
RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
Resolving Inductive Definitions with Binders in Higher-Order Typed Functional Programming
ESOP '09 Proceedings of the 18th European Symposium on Programming Languages and Systems: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
Relating nominal and higher-order abstract syntax specifications
Proceedings of the 12th international ACM SIGPLAN symposium on Principles and practice of declarative programming
Journal of Automated Reasoning
Information and Computation
Stone duality for nominal Boolean algebras with И
CALCO'11 Proceedings of the 4th international conference on Algebra and coalgebra in computer science
Encoding Abstract Syntax Without Fresh Names
Journal of Automated Reasoning
Formalizing Adequacy: A Case Study for Higher-order Abstract Syntax
Journal of Automated Reasoning
Reasoning about higher-order relational specifications
Proceedings of the 15th Symposium on Principles and Practice of Declarative Programming
| Hi-index | 0.00 |
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.