Nominal logic, a first order theory of names and binding

Information and Computation

Volumn 186, Issue 2, 2003, Pages 165-193

  Pitts, Andrew M ^a  

^a UNIVERSITY OF CAMBRIDGE   (United Kingdom)

Author keywords

Abstract syntax; Fresh names; Permutation; Variable binding

Indexed keywords

FORMAL LOGIC; SEMANTICS; SET THEORY;

PERMUTATIONS;

INFORMATION SCIENCE;

EID: 0142089908     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0890-5401(03)00138-X     Document Type: Conference Paper

References (38)

1. H.P. Barendregt, The Lambda Calculus: Its Syntax and Semantics, revised ed., North-Holland, Amsterdam, 1984.
2. M.J. Beeson, Foundations of Constructive Mathematics, Ergebnisse der Mathematik und ihrer Grenzgebeite, Springer, Berlin, 1985.
3. L. Caires, L. Cardelli, A spatial logic for concurrency (part I), in: N. Kobayashi, B.C. Pierce (Eds.), Theoretical Aspects of Computer Software, 4th International Symposium, TACS 2001, Sendai, Japan, October 29-31, 2001, Proceedings, Lecture Notes in Computer Science, vol. 2215, Springer, Berlin, 2001, pp. 1-38.
4. L. Caires, L. Cardelli, A spatial logic for concurrency (part II), in: 13th International Conference on Concurrency Theory, CONCUR 2002, Proceedings, Lecture Notes in Computer Science, Springer, Berlin, 2002.
5. L. Cardelli, A.D. Gordon, Logical properties of name restriction, in: S. Abramsky (Ed.), Typed Lambda Calculus and Applications, 5th International Conference, Lecture Notes in Computer Science, vol. 2044, Springer, Berlin, 2001.
6. The Coq proof assistant, version 7.2, January 2002. Institut National de Recherche en Informatique et en Automatique, France. Available from 〈coq.inria.fr〉.
7. 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 (1972) 381-392.
8. J. Despeyroux, F. Pfenning, C. Schürmann, Primitive recursion for higher-order abstract syntax, in: Typed Lambda Calculus and Applications, 3rd International Conference, Lecture Notes in Computer Science, vol. 1210, Springer, Berlin, 1997, pp. 147-163.
9. G. Dowek, T. Hardin, C. Kirchner. A completeness theorem for an extension of first-order logic with binders, in: S. Ambler, R. Crole, A. Momigliano (Eds.), 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, University of Leicester, 2001, pp. 49-63.
10. G. Dowek, T. Hardin, C. Kirchner, HOL-λσ An intentional first-order expression of higher-order logic, Mathematical Structures in Computer Science 11 (1) (2001) 21-45.
11. M.P. Fiore, G.D. Plotkin, D. Turi, Abstract Syntax and Variable Binding, 14th Annual Symposium on Logic in Computer Science, IEEE Computer Society Press, Washington, 1999, pp. 193-202.
12. P.J. Freyd, The axiom of choice, Journal of Pure and Applied Algebra 19 (1980) 103-125.
13. M.J. Gabbay, A theory of inductive definitions with α-equivalence: semantics, implementation, programming language, Ph.D. thesis, University of Cambridge, 2000.
14. M.J. Gabbay, FM-HOL, a higher-order theory of names, in: Thirty Five years of Automath, Heriot-Watt University, Edinburgh, April 2002, Informal Proceedings, 2002.
15. M.J. Gabbay, FM techniques in Isabelle, Preprint, March 2002.
16. M.J. Gabbay, A.M. Pitts, A new approach to abstract syntax involving binders, 14th Annual Symposium on Logic in Computer Science, IEEE Computer Society Press, Washington, 1999, pp. 214-224.
17. M.J. Gabbay, A.M. Pitts, A new approach to abstract syntax with variable binding, Formal Aspects of Computing 13 (2002) 341-363.
18. A.D. Gordon, T. Melham, Five axioms of alpha-conversion, in: Theorem Proving in Higher Order Logics: 9th Interational Conference, TPHOLs'96, Lecture Notes in Computer Science, vol. 1125, Springer, Berlin, 1996, pp. 173-191.
19. C.A. Gunter, Semantics of Programming Languages: Structures and Techniques, Foundations of Computing, MIT Press, Cambridge, 1992.
20. L. Hallnäs, Partial inductive definitions, Theoretical Computer Science 87 (1991) 115-142.
21. M. Hamana, A logic programming language based on binding algebras, in: N. Kobayashi, B.C. Pierce (Eds.), Theoretical Aspects of Computer Software, 4th International Symposium, TACS 2001, Sendai, Japan, October 29-31, 2001, Proceedings, Lecture Notes in Computer Science, vol. 2215, Springer, Berlin, 2001, pp. 243-262.
22. K. Honda, Elementary structures in process theory (1): sets with renaming, Mathematical Structures in Computer Science 10 (2000) 617-663.
23. F. Honsell, M. Miculan, I. Scagnetto, An axiomatic approach to metareasoning on nominal algebras in hoas, in: F. Orejas, P.G. Spirakis, J. van Leeuwen (Eds.), 28th International Colloquium on Automata, Languages and Programming, ICALP 2001, Crete, Greece, July 2001, Proceedings, Lecture Notes in Computer Science, vol. 2076, Springer, Heidelberg, 2001, pp. 963-978.
24. B. Huppert, in: Endliche Gruppen I, Grundlehren Math. Wiss., vol. 134, Springer, Berlin, 1967.
25. T.J. Jech, About the axiom of choice, in: J. Barwise (Ed.), Handbook of Mathematical Logic, North-Holland, Amsterdam, 1977, pp. 345-370.
26. M. Makkai, G.E. Reyes, Lecture Notes in Mathematics, Springer, Berlin, 1977.
27. R.C. McDowell, D.A. Miller, Reasoning with higher-order abstract syntax in a logical framework, ACM Transactions on Computational Logic 3 (1) (2002) 80-136.
28. J. McKinna, R. Pollack, Some type theory and lambda calculus formalised, Journal of Automated Reasoning 23 (1999) 373-409.
29. M. Miculan. Developing (meta)theory of lambda-calculus in the theory of contexts, in: S. Ambler, R. Crole, A. Momigliano (Eds.), 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, University of Leicester, 2001, pp. 65-81.
30. D.A. Miller, A compact representation of proofs, Studia Logica 46 (4) (1987) 347-370.
31. L.C. Paulson, in: Isabelle: A Generic Theorem Prover, Lecture Notes in Computer Science, vol. 828, Springer, Berlin, 1994.
32. F. Pfenning, C. Elliott, Higher-order abstract syntax, Proceedings ACM-SIGPLAN Conference on Programming Language Design and Implementation, ACM Press, New York, 1988, pp. 199-208.
33. A.M. Pitts, Categorical logic, in: S. Abramsky, D.M. Gabbay, T.S.E. Maibaum (Eds.), Handbook of Logic in Computer Science, vol. 5. Algebraic and Logical Structures, Oxford University Press, 2000 (Chapter 2).
34. A.M. Pitts, Nominal logic: A first order theory of names and binding, in: N. Kobayashi, B.C. Pierce (Eds.), Theoretical Aspects of Computer Software, 4th International Symposium, TACS 2001, Sendai, Japan, October 29-31, 2001, Proceedings, Lecture Notes in Computer Science, vol. 2215, Springer, Berlin, 2001, pp. 219-242.
35. A.M. Pitts, M.J. Gabbay, A metalanguage for programming with bound names modulo renaming, in: R. Backhouse, J.N. Oliveira (Eds.), Mathematics of Program Construction, 5th International Conference, MPC2000, Ponte de Lima, Portugal, July 2000, Proceedings, Lecture Notes in Computer Science, vol. 1837, Springer, Heidelberg, 2000, pp. 230-255.
36. C. Schürmann, Automating the meta-theory of deductive systems, Ph.D. thesis, Carnegie-Mellon University, 2000.
37. D.S. Scott, Identity and existence in intuitionistic logic, in: M.P. Fourman, C.J. Mulvey, D.S. Scott (Eds.), Applications of Sheaves, Proceedings, Durham 1977, Lecture Notes in Mathematics, vol. 753, Springer, Berlin, 1979, pp. 660-696.
38. R. Vestergaard, J. Brotherson, A formalised first-order confluence proof for the λ-calculus using one-sorted variable names, in: A. Middeldorp (Ed.), Rewriting Techniques and Applications, 12th International Conference, RTA 2001, Utrecht, The Netherlands, May 2001, Proceedings, Lecture Notes in Computer Science, vol. 2051, Springer, Heidelberg, 2001, pp. 306-321.