A simpler proof theory for nominal logic

Lecture Notes in Computer Science

Volumn 3441, Issue , 2005, Pages 379-394

  Cheney, James ^a  

^a UNIVERSITY OF EDINBURGH   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

DIFFERENTIATION (CALCULUS); FORMAL LANGUAGES; MATHEMATICAL MODELS; PROBLEM SOLVING; THEOREM PROVING;

AXIOMATIC THEORY; DEDUCTION CALCULI; NOMINAL LOGIC;

FORMAL LOGIC;

EID: 24644502792     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-31982-5_24     Document Type: Conference Paper

References (14)

1. Luís Caires and Luca Cardelli. A spatial logic for concurrency-II. Theoretical Computer Science, 322(3):517-565, September 2004.
2. J. Cheney and C. Urban. Alpha-Prolog: A logic programming language with names, binding and alpha-equivalence. In Proc. 20th Int. Conf. on Logic Programming (ICLP 2004), number 3132 in LNCS, pages 269-283, 2004.
3. James Cheney. A simpler proof theory for nominal logic. Technical Report EDI-INF-RR-0237, LFCS, University of Edinburgh, November 2004.
4. James Cheney. A sound and complete translation of generic judgments into nominal logic. Technical report, LFCS, University of Edinburgh, 2005. In preparation.
5. James R. Cheney. Nominal Logic Programming. PhD thesis, Cornell University, Ithaca, NY, August 2004.
6. M. J. Gabbay. Fresh logic: A logic of FM, 2003. Submitted.
7. M. J. Gabbay and J. Cheney. A proof theory for nominal logic. In Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science (LICS 2004), pages 139-148, Turku, Finland, 2004.
8. M. J. Gabbay and A. M. Pitts. A new approach to abstract syntax with variable binding. Formal Aspects of Computing, 13:341-363, 2002.
9. Dale Miller and Alwen Tiu. A proof theory for generic judgments: extended abstract. In Proc. 18th Symp. on Logic in Computer Science (LICS 2003), pages 118-127. IEEE Press, 2003.
10. Aleksandar Nanevski. Meta-programming with names and necessity. In Proc. 8th ACM SIGPLAN Int. Conf. on Functional Programming, pages 206-217. ACM Press, 2002.
11. Sara Negri and Jan von Plato. Structural Proof Theory. Cambridge University Press, 2001.
12. A. M. Pitts. Nominal logic, a first order theory of names and binding. Information and Computation, 183:165-193, 2003.
13. Ulrich Schöpp and Ian Stark. A dependent type theory with names and binding. In Proceedings of the 2004 Computer Science Logic Conference, number 3210 in Lecture notes in Computer Science, pages 235-249, Karpacz, Poland, 2004.
14. C. Urban, A. M. Pitts, and M. J. Gabbay. Nominal unification. Theoretical Computer Science, 323(1-3):473-497, 2004.