Information Services banner Edinburgh Research Archive The University of Edinburgh crest

Edinburgh Research Archive >
Informatics, School of >
Informatics Publications >

Please use this identifier to cite or link to this item: http://hdl.handle.net/1842/4608

This item has been viewed 8 times in the last year. View Statistics

Files in This Item:

File Description SizeFormat
CheneyJ_Nominal Logic Programming.pdf585 kBAdobe PDFView/Open
Title: Nominal Logic Programming
Authors: James Cheney
Christian Urban
Issue Date: Aug-2008
Journal Title: ACM Transactions on Programming Languages and Systems
Volume: 30
Issue: 5
Page Numbers: 26
Publisher: Association for Computing Machinery
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.
URI: http://portal.acm.org/citation.cfm?doid=1387673.1387675
http://hdl.handle.net/1842/4608
ISSN: 0164-0925
Appears in Collections:Informatics Publications

Items in ERA are protected by copyright, with all rights reserved, unless otherwise indicated.

 

Valid XHTML 1.0! Unless explicitly stated otherwise, all material is copyright © The University of Edinburgh 2013, and/or the original authors. Privacy and Cookies Policy