PNL to HOL: From the logic of nominal sets to the logic of higher-order functions
Abstract
Permissive-Nominal Logic (PNL) extends first-order predicate logic with term-formers that can bind names in their arguments. It takes a semantics in (permissive-)nominal sets. In PNL, the @?-quantifier or @l-binder are just term-formers satisfying axioms, and their denotation is functions on nominal atoms-abstraction. Then we have higher-order logic (HOL) and its models in ordinary (i.e. Zermelo-Fraenkel) sets; the denotation of @? or @l is functions on full or partial function spaces. This raises the following question: how are these two models of binding connected? What translation is possible between PNL and HOL, and between nominal sets and functions? We exhibit a translation of PNL into HOL, and from models of PNL to certain models of HOL. It is natural, but also partial: we translate a restricted subsystem of full PNL to HOL. The extra part which does not translate is the symmetry properties of nominal sets with respect to permutations. To use a little nominal jargon: we can translate names and binding, but not their nominal equivariance properties. This seems reasonable since HOL-and ordinary sets-are not equivariant. Thus viewed through this translation, PNL and HOL and their models do different things, but they enjoy non-trivial and rich subsystems which are isomorphic.
References
[1]
Abadi, Martín, Cardelli, Luca, Curien, Pierre-Louis and Lévy, Jean-Jacques, Explicit substitutions. Journal of Functional Programming. v1 i4. 375-416.
[2]
Andrews, Peter B., An Introduction to Mathematical Logic and Type Theory: To Truth Through Proof. 1986. Academic Press.
[3]
Benzmüller, Christoph, Brown, Chad E. and Kohlhase, Michael, Higher-order semantics and extensionality. Journal of Symbolic Logic. v69. 1027-1088.
[4]
Bojanczyk, Mikolaj, Braud, Laurent, Klin, Bartek and Lasota, Slawomir, Towards nominal computation. In: Proceedings of the 39th ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages, ACM Press. pp. 401-412.
[5]
Completeness and Herbrand theorems for nominal logic. Journal of Symbolic Logic. v71. 299-320.
[6]
Church, Alonzo, A formulation of the simple theory of types. Journal of Symbolic Logic. 56-68.
[7]
Cheney, James and Urban, Christian, Alpha-prolog: a logic programming language with names, binding and alpha-equivalence. In: Demoen, Bart, Lifschitz, Vladimir (Eds.), Lecture Notes in Computer Science, vol. 3132. Springer. pp. 269-283.
[8]
de Bruijn, Nicolaas G., Lambda calculus notation with nameless dummies, a tool for automatic formula manipulation, with application to the Church¿Rosser theorem. Indagationes Mathematicae. v5 i34. 381-392.
[9]
Dowek, Gilles and Gabbay, Murdoch J., Permissive nominal logic. In: Proceedings of the 12th International ACM SIGPLAN Symposium on Principles and Practice of Declarative Programming, ACM Press. pp. 165-176.
[10]
Dowek, Gilles and Gabbay, Murdoch J., Permissive nominal logic (journal version). Transactions on Computational Logic. v13 i3.
[11]
. In: D¿Agostino, Marcello, Gabbay, Dov M., Hähnle, Reiner, Posegga, Joachim (Eds.), Handbook of Tableau Methods, Kluwer.
[12]
Gilles Dowek, Murdoch J. Gabbay, Dominic P. Mulligan, Permissive nominal terms and their unification, in: Proceedings of the 24th Italian Conference on Computational Logic, CILC¿09, 2009.
[13]
Dowek, Gilles, Gabbay, Murdoch J. and Mulligan, Dominic P., Permissive nominal terms and their unification: an infinite, co-infinite approach to nominal techniques (journal version). Logic Journal of the IGPL. v18 i6. 769-822.
[14]
Despeyroux, Joëlle and Hirschowitz, André, Higher-order abstract syntax with induction in COQ. In: Lecture Notes in Computer Science, vol. 822. Springer. pp. 159-173.
[15]
Gilles Dowek, Thérèse Hardin, Claude Kirchner, Theorem proving modulo, Rapport de Recherche 3400, Institut National de Recherche en Informatique et en Automatique, April 1998.
[16]
Despeyroux, Joëlle, Pfenning, Frank and Schürmann, Carsten, Primitive recursion for higher-order abstract syntax. Theoretical Computer Science. v266 i1-2. 1-57.
[17]
Farmer, William M., The seven virtues of simple type theory. Journal of Applied Logic. v3 i6. 267-286.
[18]
Marcelo, Fiore and Hur, Chung-Kil, Second-order equational logic. In: Lecture Notes in Computer Science, Springer.
[19]
Fiore, Marcelo and Turi, Daniele, Semantics of name and value passing. In: Proceedings of the 16th IEEE Symposium on Logic in Computer Science, IEEE Computer Society Press. pp. 93-104.
[20]
Gabbay, Murdoch J., Fresh logic. Journal of Applied Logic. v5 i2. 356-387.
[21]
Gabbay, Murdoch J., A general mathematics of names. Information and Computation. v205 i7. 982-1011.
[22]
Gabbay, Murdoch J., A study of substitution, using nominal techniques and Fraenkel'Mostowski sets. Theoretical Computer Science. v410 i12-13. 1159-1189.
[23]
Gabbay, Murdoch J., Foundations of nominal techniques: logic and semantics of variables in abstract syntax. Bulletin of Symbolic Logic. v17 i2. 161-229.
[24]
Gabbay, Murdoch J., Stone duality for first-order logic: a nominal approach. In: Howard Barringer Festschrift,
[25]
Gabbay, Murdoch J., Two-level nominal sets and semantic nominal terms: an extension of nominal set theory for handling meta-variables. Mathematical Structures in Computer Science. v21. 997-1033.
[26]
Gabbay, Murdoch J., Meta-variables as infinite lists in nominal terms unification and rewriting. Logic Journal of the IGPL.
[27]
Gabbay, Murdoch J., Nominal terms and nominal logics: from foundations to meta-mathematics. In: Handbook of Philosophical Logic, vol. 17. Kluwer.
[28]
Gentzen, Gerhard, Untersuchungen über das logische Schließen {Investigations into logical deduction}. Mathematische Zeitschrift. v39.
[29]
Gabbay, Murdoch J. and Hofmann, Martin, Nominal renaming sets. In: Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning, Springer. pp. 158-173.
[30]
Gabbay, Murdoch J. and Lengrand, Stéphane, The lambda-context calculus. Electronic Notes in Theoretical Computer Science. v196 iJanuary. 19-35.
[31]
Gabbay, Murdoch J. and Lengrand, Stéphane, The lambda-context calculus (extended version). Information and computation. v207 iDecember. 1369-1400.
[32]
Gabbay, Murdoch J. and Mathijssen, Aad, Capture-avoiding Substitution as a Nominal Algebra. In: Lecture Notes in Computer Science, vol. 4281. pp. 198-212.
[33]
Gabbay, Murdoch J. and Mathijssen, Aad, One-and-a-halfth-order logic. In: Proceedings of the 8th ACM-SIGPLAN International Symposium on Principles and Practice of Declarative Programming, ACM. pp. 189-200.
[34]
Gabbay, Murdoch J. and Mathijssen, Aad, A formal calculus for informal equality with binding. In: Lecture Notes in Computer Science, vol. 4576. Springer. pp. 162-176.
[35]
Gabbay, Murdoch J. and Mathijssen, Aad, Capture-avoiding substitution as a nominal algebra. Formal Aspects of Computing. v20 i4-5. 451-479.
[36]
Gabbay, Murdoch J. and Mathijssen, Aad, One-and-a-halfth-order Logic. Journal of Logic and Computation. v18 i4. 521-562.
[37]
Gabbay, Murdoch J. and Mathijssen, Aad, Nominal universal algebra: equational logic with names and binding. Journal of Logic and Computation. v19 i6. 1455-1508.
[38]
Gabbay, Murdoch J. and Mulligan, Dominic P., 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, ACM. pp. 64-73.
[39]
Gabbay, Murdoch J. and Mathijssen, Aad, A nominal axiomatisation of the lambda-calculus. Journal of Logic and Computation. v20 i2. 501-531.
[40]
Gadducci, Fabio, Miculan, Marino and Montanari, Ugo, About permutation algebras, (pre)sheaves and named sets. Higher Order Symbolic Computation. v19 i2-3. 283-304.
[41]
Gabbay, Murdoch J. and Pitts, Andrew M., A new approach to abstract syntax with variable binding. Formal Aspects of Computing. v13 i3-5. 341-363.
[42]
Roger Hindley, J. and Seldin, Jonathan P., Lambda-Calculus and Combinators, An Introduction. 2008. 2nd ed. Cambridge University Press.
[43]
Levy, Jordi and Villaret, Mateu, Nominal unification from a higher-order perspective. In: Lecture Notes in Computer Science, vol. 5117. Springer.
[44]
Levy, Jordi and Villaret, Mateu, Nominal unification from a higher-order perspective. Transactions on Computational Logic (TOCL). v13.
[45]
Miller, Dale, A logic programming language with lambda-abstraction, function variables, and simple unification. Journal of Logic and Computation. v1 i4. 497-536.
[46]
Miller, Dale, Logic, higher order. In: Shapiro, Stuart (Ed.), Encyclopedia of Artificial Intelligence, Wiley.
[47]
Miller, Dale, Unification under a mixed prefix. Journal of Symbolic Computation. v14 i4. 321-358.
[48]
Mayr, Richard and Nipkow, Tobias, Higher-order rewrite systems and their confluence. Theoretical Computer Science. v192. 3-29.
[49]
Miller, Dale and Tiu, Alwen, A proof theory for generic judgments (extended abstract). In: Proceedings of the 18th IEEE Symposium on Logic in Computer Science, IEEE Computer Society Press. pp. 118-127.
[50]
Pfenning, Frank and Elliott, Conal, Higher-order abstract syntax. In: PLDI (Programming Language Design and Implementation), ACM Press. pp. 199-208.
[51]
Pitts, Andrew M., Nominal logic, a first order theory of names and binding. Information and Computation. v186 i2. 165-193.
[52]
Prawitz, Dag, Natural Deduction: A Prooof-Theoretical Study. 1965. Almquist and Wiksell.
[53]
Smullyan, Raymond, First-Order Logic. 1968. Springer.
[54]
. In: Szabo, M.E. (Ed.), Collected Papers of Gerhard Gentzen, North Holland.
[55]
Urban, Christian, Pitts, Andrew M. and Gabbay, Murdoch J., Nominal unification. Theoretical Computer Science. v323 i1-3. 473-497.
Index Terms
- PNL to HOL: From the logic of nominal sets to the logic of higher-order functions
Index terms have been assigned to the content through auto-classification.
Recommendations
Permissive-nominal logic: First-order logic over nominal terms and sets
Permissive-Nominal Logic (PNL) is an extension of first-order predicate logic in which term-formers can bind names in their arguments.
This allows for direct axiomatizations with binders, such as of the λ-binder of the lambda-calculus or the ∀-binder of ...
Mechanising Gödel–Löb Provability Logic in HOL Light
AbstractWe introduce our implementation in HOL Light of the metatheory for Gödel–Löb provability logic (GL), covering soundness and completeness w.r.t. possible world semantics and featuring a prototype of a theorem prover for GL itself. The strategy we ...
An embedding of the ACL2 logic in HOL
ACL2 '06: Proceedings of the sixth international workshop on the ACL2 theorem prover and its applicationsWe describe an embedding of the ACL2 logic into higher-order logic. An implementation of this embedding allows ACL2 to be used as an oracle for higher-order logic provers.
Comments
Information & Contributors
Information
Published In
Copyright © Elsevier B.V. © 2012.
Publisher
Elsevier Science Publishers Ltd.
United Kingdom
Publication History
Published: 01 September 2012
Author Tags
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 21 Sep 2024
Other Metrics
Citations
View Options
View options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in