Permissive-Nominal Logic

PPDP'10 - Proceedings of the 2010 Symposium on Principles and Practice of Declarative Programming

Volumn , Issue , 2010, Pages 165-176

  Dowek, Gilles ^a   Gabbay, Murdoch J ^a  

^a NONE

Author keywords

First order logic; Mechanized mathematics; Permissive Nominal terms

Indexed keywords

EXPRESSIVE POWER; FIRST ORDER LOGIC; FIRST-ORDER; HIGHER ORDER LOGIC; LAMBDA-CALCULUS; MECHANIZED MATHEMATICS; NOMINAL LOGIC; NOMINAL TERMS;

BINDERS; CALCULATIONS; COMPUTER PROGRAMMING; DIFFERENTIATION (CALCULUS);

FORMAL LOGIC;

EID: 77956259987     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1836089.1836111     Document Type: Conference Paper

References (31)

1. Michael Beeson. Lambda logic. In Second International Joint Conference on Automated Reasoning (IJCAR 2004), volume 3097 of Lecture Notes in Computer Science, pages 460-474. Springer, 2004.
2. Christophe Calvès. A Haskell nominal toolkit. In Proceedings of the 2nd International Workshop on Theory and Applications of Abstraction, Substitution and Naming (TAASN 2009), 2009.
3. Christophe Calvès and Maribel Fernández. A polynomial nominal unification algorithm. Theoretical Computer Science, 403:285-306, August 2008.
4. James Cheney. A simpler proof theory for nominal logic. In FoS-SaCS, volume 3441 of Lecture Notes in Computer Science, pages 379-394. Springer, 2005.
5. James Cheney. Completeness and Herbrand theorems for nominal logic. Journal of Symbolic Logic, 71:299-320, 2006.
6. Gilles Dowek, Murdoch J. Gabbay, and Dominic P. Mulligan. Permissive Nominal Terms and their Unification. In Proceedings of the 24th Italian Conference on Computational Logic (CILC'09), 2009.
7. Gilles Dowek, Murdoch J. Gabbay, and Dominic P. Mulligan. Permissive Nominal Terms and their Unification (journal version). Logic Journal of the IGPL, 2010. In press.
8. Gilles Dowek, Thérèse Hardin, and Claude Kirchner. Binding logic: Proofs and models. In Proceedings of the 9th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning (LPAR 2002), pages 130-144. Springer, 2002.
9. William M. Farmer. The seven virtues of simple type theory. Journal of Applied Logic, 3(6):267-286, 2008.
10. Maribel Fernández and Murdoch J. Gabbay. Nominal rewriting (journal version). Information and Computation, 205(6):917-965, 2007.
11. Murdoch J. Gabbay. A NEW calculus of contexts. In Proceedings of the 7th ACM SIGPLAN symposium on Principles and Practice of Declarative Programming (PPDP 2005), pages 94-105. ACM, 2005.
12. Murdoch J. Gabbay. Fresh Logic. Journal of Applied Logic, 5(2):356-387, June 2007.
13. Murdoch J. Gabbay. A General Mathematics of Names. Information and Computation, 205(7):982-1011, July 2007.
14. Murdoch J. Gabbay and James Cheney. A Sequent Calculus for Nominal Logic. In Proceedings of the 19th IEEE Symposium on Logic in Computer Science (LICS 2004), pages 139-148. IEEE Computer Society, 2004.
15. Murdoch J. Gabbay and Stéphane Lengrand. The lambda-context calculus (extended version). Information and computation, 207:1369-1400, 2009.
16. Murdoch J. Gabbay and Aad Mathijssen. Capture-Avoiding Substitution as a Nominal Algebra. Formal Aspects of Computing, 20(4-5):451-479, June 2008.
17. Murdoch J. Gabbay and Aad Mathijssen. One-and-a-halfth-order Logic. Journal of Logic and Computation, 18(4):521-562, August 2008.
18. Murdoch J. Gabbay and Aad Mathijssen. Nominal universal algebra: equational logic with names and binding. Journal of Logic and Computation, 19(6):1455-1508, December 2009.
19. Murdoch J. Gabbay and Dominic P. Mulligan. Semantic nominal terms. In TAASN, 2009.
20. Murdoch J. Gabbay and Dominic P. Mulligan. Two-level lambda-calculus. In Proceedings of the 17th International Workshop on Functional and (Constraint) Logic Programming (WFLP 2008), volume 246, pages 107-129, August 2009.
21. Murdoch J. Gabbay and Dominic P. Mulligan. Universal algebra over lambda-terms and nominal terms: the connection in logic between nominal techniques and higher-order variables. In Proceedings of the 4th International Workshop on Logical Frameworks and Meta-Languages (LFMTP 2009), pages 64-73. ACM, 2009.
22. Murdoch J. Gabbay and Andrew M. Pitts. A New Approach to Abstract Syntax with Variable Binding. Formal Aspects of Computing, 13(3-5):341-363, 2001.
23. Andrew Gacek, Dale Miller, and Gopalan Nadathur. Combining generic judgments with recursive definitions. In Proceedings of the 23rd IEEE Symposium on Logic in Computer Science (LICS 2008), pages 33-44. IEEE Computer Society Press, 2008.
24. Dale Miller and Alwen Tiu. A proof theory for generic judgments (extended abstract). In Proceedings of the 18th IEEE Symposium on Logic in Computer Science (LICS 2003), pages 118-127. IEEE Computer Society Press, 2003.
25. Dominic P. Mulligan. Implementation of permissive nominal terms. Available at http://www2.macs.hw.ac.uk/~dpm8/permissive/perm.htm, 2009.
26. Lawrence C. Paulson. The foundation of a generic theorem prover. Journal of Automated Reasoning, 5(3):363-397, 1989.
27. Lawrence C. Paulson. Isabelle: the next 700 theorem provers. In P. Odifreddi, editor, Logic and Computer Science, pages 361-386. Academic Press, 1990.
28. Andrew M. Pitts. Nominal logic, a first order theory of names and binding. Information and Computation, 186(2):165-193, 2003.
29. Joseph Shoenfield. Mathematical Logic. Addison-Wesley, 1967.
30. Alwen Tiu. A logic for reasoning about generic judgments. Electronic Notes in Theoretical Computer Science, 174(5):3-18, 2007.
31. Christian Urban, Andrew M. Pitts, and Murdoch J. Gabbay. Nominal Unification. Theoretical Computer Science, 323(1-3):473-497, 2004.