Nominal logic: A first order theory of names and binding

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2215, Issue , 2001, Pages 219-242

  Pitts, Andrew M ^a  

^a UNIVERSITY OF CAMBRIDGE   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SOFTWARE; FORMAL LOGIC; SEMANTICS; SYNTACTICS;

EXPLICIT SUBSTITUTIONS; FIRST ORDER LOGIC; FIRST ORDER THEORIES; HIGHER-ORDER ABSTRACT SYNTAX; LOGICAL PROPERTIES; OPERATIONAL SEMANTICS; STRUCTURAL INDUCTION; SYNTACTICAL STRUCTURES;

COMPUTER CIRCUITS;

EID: 84978984890     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45500-0_11     Document Type: Conference Paper

References (27)

1. M. J. Beeson. Foundations of Constructive Mathematics. Ergebnisse der Mathematik und ihrer Grenzgebeite. Springer-Verlag, Berlin, 1985.
2. L. Caires and L. Cardelli. A spatial logic for concurrency. Draft of 11 April, 2001.
3. L. Cardelli and A. D. Gordon. Logical properties of name restriction. In S. Abramsky, editor, Typed Lambda Calculus and Applications, 5th International Conference, volume 2044 of Lecture Notes in Computer Science. Springer-Verlag, Berlin, 2001.
4. The Coq proof assistant. Institut National de Recherche en Informatique et en Automatique, France. http://coq. inria. fr/.
5. N. G. de Bruijn. Lambda calculus notation with nameless dummies, a tool for automatic formula manipulation, with application to the Church-Rosser theorem. Indag. Math., 34: 381-392, 1972.
6. J. Despeyroux, F. Pfenning, and C. Schürmann. Primitive recursion for higherorder abstract syntax. In Typed Lambda Calculus and Applications, 3rd International Conference, volume 1210 of Lecture Notes in Computer Science, pages 147-163. Springer-Verlag, Berlin, 1997.
7. G. Dowek, T. Hardin, and C. Kirchner. A completeness theorem for an extension of first-order logic with binders. In S. Ambler, R. Crole, and A. Momigliano, editors, Mechanized Reasoning about Languages with Variable Binding (MERLIN 20001), Proceedings of a Workshop held in conjunction with the International Joint Conference on Automated Reasoning, IJCAR 2001, Siena, June 2001, Department of Computer Science Technical Report 2001/26, pages 49-63. University of Leicester, 2001.
8. P. J. Freyd. The axiom of choice. Journal of Pure and Applied Algebra, 19: 103-125, 1980.
9. M. J. Gabbay. AThe ory of Inductive Definitions with α-Equivalence: Semantics, Implementation, Programming Language. PhD thesis, Cambridge University, 2000.
10. M. J. Gabbay and A. M. Pitts. A new approach to abstract syntax involving binders. In 14th Annual Symposium on Logic in Computer Science, pages 214-224. IEEE Computer Society Press, Washington, 1999.
11. M. J. Gabbay and A. M. Pitts. A new approach to abstract syntax with variable binding. Formal Aspects of Computing, 2001. Special issue in honour of Rod Burstall. To appear.
12. A. D. Gordon and T. Melham. Five axioms of alpha-conversion. In Theorem Proving in Higher Order Logics: 9th Interational Conference, TPHOLs'96, volume 1125 of Lecture Notes in Computer Science, pages 173-191. Springer-Verlag, Berlin, 1996.
13. C. A. Gunter. Semantics of Programming Languages: Structures and Techniques. Foundations of Computing. MIT Press, 1992.
14. K. Honda. Elementary structures in process theory (1): Sets with renaming. Mathematical Structures in Computer Science, 10: 617-663, 2000.
15. F. Honsell, M. Miculan, and I. Scagnetto. An axiomatic approach to metareasoning on systems in higher-order abstract syntax. In Twenty-Eighth International Colloquium on Automata, Languages and Programming, ICALP 2001, Crete, Greece, July 2001, Proceedings, Lecture Notes in Computer Science. Springer-Verlag, Heidelberg, 2001.
16. B. Huppert. Endliche Gruppen I, volume 134 of Grundlehren Math. Wiss. Springer, Berlin, 1967.
17. T. J. Jech. About the axiom of choice. In J. Barwise, editor, Handbook of Mathematical Logic, pages 345-370. North-Holland, 1977.
18. M. Makkai and G. E. Reyes. First Order Categorical Logic, volume 611 of Lecture Notes in Mathematics. Springer-Verlag, Berlin, 1977.
19. J. McKinna and R. Pollack. Some type theory and lambda calculus formalised. To appear in Journal of Automated Reasoning, Special Issue on Formalised Mathematical Theories (F. Pfenning, Ed.), 1998.
20. M. Miculan. Developing (meta)theory of lambda-calculus in the theory of contexts. In S. Ambler, R. Crole, and A. Momigliano, editors, Mechanized Reasoning about Languages with Variable Binding (MERLIN 20001), Proceedings of aWorkshop held in conjunction with the International Joint Conference on Automated Reasoning, IJCAR 2001, Siena, June 2001, Department of Computer Science Technical Report 2001/26, pages 65-81. University of Leicester, 2001.
21. L. C. Paulson. Isabelle: AGeneric Theorem Prover, volume 828 of Lecture Notes in Computer Science. Springer-Verlag, Berlin, 1994.
22. F. Pfenning and C. Elliott. Higher-order abstract syntax. In Proc. ACMSIGPLAN Conference on Programming Language Design and Implementation, pages 199-208. ACM Press, 1988.
23. A. M. Pitts. Categorical logic. In S. Abramsky, D. M. Gabbay, and T. S. E. Maibaum, editors, Handbook of Logic in Computer Science, Volume 5. Algebraic and Logical Structures, chapter 2. Oxford University Press, 2000.
24. A. M. Pitts and M. J. Gabbay. A metalanguage for programming with bound names modulo renaming. In R. Backhouse and J. N. Oliveira, editors, Mathematics of Program Construction. 5th International Conference, MPC2000, Ponte de Lima, Portugal, July 2000. Proceedings, volume 1837 of Lecture Notes in Computer Science, pages 230-255. Springer-Verlag, Heidelberg, 2000.
25. C. Schürmann. Automating the Meta-Theory of Deductive Systems. PhD thesis, Carnegie-Mellon University, 2000.
26. D. S. Scott. Identity and existence in intuitionistic logic. In M. P. Fourman, C. J. Mulvey, and D. S. Scott, editors, Applications of Sheaves, Proceedings, Durham 1977, volume 753 of Lecture Notes in Mathematics, pages 660-696. Springer-Verlag, Berlin, 1979.
27. R. Vestergaard and J. Brotherson. A formalised first-order confluence proof for the λ-calculus using one-sorted variable names. In A. Middeldorp, editor, Rewriting Techniques and Applications, 12th International Conference, RTA 2001, Utrecht, The Netherlands, May 2001, Proceedings, volume 2051 of Lecture Notes in Computer Science, pages 306-321. Springer-Verlag, Heidelberg, 2001.