• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations | Disambiguate

DMCA

Nominal logic programming (2006)

Cached

  • Download as a PDF

Download Links

  • [arxiv.org]
  • [homepages.inf.ed.ac.uk]
  • [homepages.inf.ed.ac.uk]
  • [homepages.inf.ed.ac.uk]

  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by James Cheney , Christian Urban
Citations:39 - 9 self
  • Summary
  • Citations
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

BibTeX

@MISC{Cheney06nominallogic,
    author = {James Cheney and Christian Urban},
    title = {Nominal logic programming},
    year = {2006}
}

Share

Facebook Twitter Reddit Bibsonomy

OpenURL

 

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. This technique is especially well-suited for prototyping type systems, proof theories, operational semantics rules, and other formal systems in which bound names are present. In many cases, nominal logic programs are essentially literal translations of “paper” specifications. As such, nominal logic programming provides an executable specification language for prototyping, communicating, and experimenting with formal systems. 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 two examples.

Keyphrases

nominal logic    nominal logic programming    formal system    nominal logic program    bound name    many case    correct behavior    proof theory    rigorous foundation    first-order logic    operational semantics    simple foundation    executable specification language    operational semantics rule    paper specification    type system    literal translation    abstract syntax modulo consistent renaming    typical nominal logic program   

Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University