James Cheney  Home/Search
Context Related
| homepages.inf.ed.ac.uk/j...sptnltr.pdf Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: homepages.inf.ed.a...publications (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Nominal logic is a variant of first-order logic which provides support for reasoning about bound names in abstract syntax. A key feature of nominal logic is the new-quantifier, which quantifies over fresh names (names not appearing in any values considered so far). Previous attempts have been made to develop convenient rules for reasoning with the new-quantifier, but we argue that none of these attempts is completely satisfactory. In this paper we develop a new sequent calculus for nominal... (Update)
Cited by: More
Toward a General Theory of Names, Binding and Scope - James Cheney University (Correct)
The Semantics of Nominal Logic Programs - James Cheney University (Correct)
A Simpler Proof Theory for Nominal Logic - Cheney (2005) (Correct)
Active bibliography (related documents): More All
1.1: Nominal Logic Programming - Cheney (2004) (Correct)
0.5: Avoiding Equivariance in Alpha-Prolog - Urban, Cheney (2004) (Correct)
0.4: Equivariant Unification - Cheney (Correct)
Similar documents based on text: More All
0.6: Completeness and Herbrand Theorems for Nominal Logic - Cheney (2006) (Correct)
0.5: A Sequent Calculus for Nominal Logic - Gabbay, Cheney (2004) (Correct)
0.4: The Complexity of Equivariant Unification - Cheney (Correct)
Related documents from co-citation: More All
4: Theoretical Computer Science (context) - Urban, Pitts et al. - 2004
4: A first-order theory of names and binding - Pitts - 2001
4: Alpha-Prolog: A logic programming language with names - Cheney, Urban - 2004
BibTeX entry: (Update)
James Cheney. A simpler proof theory for nominal logic. In Proceedings of the 2005. http://citeseer.ist.psu.edu/article/cheney05simpler.html More
@misc{ cheney05simpler,
author = "J. Cheney",
title = "A simpler proof theory for nominal logic",
text = "James Cheney. A simpler proof theory for nominal logic. In Proceedings
of the 2005.",
year = "2005",
url = "citeseer.ist.psu.edu/article/cheney05simpler.html" }
Citations (may not include all citations):45 A new approach to abstract syntax with variable binding - Gabbay, Pitts - 2002
32 a first order theory of names and binding - Pitts - 2003
9 A proof theory for nominal logic (context) - Gabbay, Cheney - 2004
9 Theoretical Computer Science (context) - Urban, Pitts et al. - 2004
9 Number 43 in Cambridge Tracts in Theoretical Computer Scienc.. (context) - Troelstra, Schwichtenberg et al. - 2000
8 Alpha-Prolog: A logic programming language with names - Cheney, Urban - 2004
6 Nominal Logic Programming - Cheney - 2004
5 Structural Proof Theory (context) - Negri, von Plato - 2001
4 A simpler proof theory for nominal logic - Cheney - 2005
4 A dependent type theory with names and binding - opp, Stark - 2004
3 Fresh logic: A logic of FM (context) - Gabbay - 2003
Documents on the same site (http://homepages.inf.ed.ac.uk/jcheney/publications/publications.html): More
System Description: Alpha-Prolog, a Fresh Approach to Logic.. - Cheney, Urban (2003) (Correct)
Nominal Logic Programming - Cheney (2004) (Correct)
An Empirical Evaluation of Simple DTD-Conscious Compression.. - Cheney (2005) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC