Skip to main content
Log in

Pseudo-distributive laws and axiomatics for variable binding

  • Published:
Higher-Order and Symbolic Computation

Abstract

We give a general category theoretic formulation of the substitution structure underlying the category theoretic study of variable binding proposed by Fiore, Plotkin, and Turi. This general formulation provides the foundation for their work on variable binding, as well as Tanaka’s linear variable binding and variable binding for other binders and for mixtures of binders as for instance in the Logic of Bunched Implications. The key structure developed by Fiore et al. was a substitution monoidal structure, from which their formulation of binding was derived; so we give an abstract formulation of a substitution monoidal structure, then, at that level of generality, derive the various category theoretic structures they considered. The central construction we use is that of a pseudo-distributive law between 2-monads on Cat, which suffices to induce a pseudo-monad on Cat, and hence a substitution monoidal structure on the free object on 1. We routinely generalise that construction to account for types.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Barber, A., Gardner, P., Hasegawa, M., Plotkin, G.: From action calculi to linear logic. In: Proceedings CSL 97, LNCS 1414, pp. 78–97 (1998)

  2. Blackwell, R., Kelly, G.M., Power, A.J.: Two-dimensional monad theory. J. Pure Appl. Algebra 59, 1–41 (1989)

    Article  MATH  MathSciNet  Google Scholar 

  3. Cheng, E., Hyland, J.M.E., Power, A.J.: Pseudo-distributive laws. In: Proc. MFPS 03, ENTCS 83, (2003)

  4. Day, B.J.: On closed categories of functors. In Midwest Category Seminar Reports IV, vol. 137 of Lecture Noes in Mathematics, pp. 1–38 (1970)

  5. Fiore, M.: Semantic analysis of normalisation by evaluation for typed lambda calculus. In: Proceedings PPDP 02, ACM Press, pp. 26–37 (2002)

  6. Fiore, M., Plotkin, G., Turi, D.: Abstract syntax and variable binding. In: Proceedings LICS 99, IEEE Press, pp. 193–202 (1999)

  7. Gadducci, F., Miculan, M., Montanari, U.: Some characterisation results for permutation algebras. In: Proceedings COMETA 03, ENTCS (2003)

  8. Gabbay, M., Pitts, A.M.: A new approach to abstract syntax involving binders. In: Proceedings LICS 99, IEEE Press, pp. 214–224 (1999)

  9. Ghani, N., Yemane, K., Victor, B.: Relationally staged computations in calculi of mobile processes. In: Proceedings CMCS 04, ENTCS (2004)

  10. Hasegawa, M.: Logical predicates for intuitionistic linear type theories. In: Proceedings TLCA 99, LNCS 1581, pp. 198–212, IEEE Press, (1999)

  11. Hofmann, M.: Semantical analysis of higher-order abstract syntax. In: Proceedings LICS 99, pp. 204–213, IEEE Press (1999)

  12. Hyland, M., Power, A.: Pseudo-commutative monads and pseudo-closed 2-categories. J. Pure Appl. Algebra 175, 141–185 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  13. Im, G.B., Kelly, G.M.: A universal property of the convolution monoidal structure. J. Pure Appl. Algebra 43, 75–88 (1986)

    Article  MATH  MathSciNet  Google Scholar 

  14. Joyal, A.: Une théorie combinatoire des séries formelle. Adv Math 42, 1–82 (1981)

    Article  MATH  MathSciNet  Google Scholar 

  15. Kelly, G.M.: An abstract approach to coherence. In: Coherence in categories, LNM 281, pp. 106–147 (1972)

  16. Kelly, G.: The Basic Concepts of Enriched Category Theory. Cambridge University Press (1982)

  17. Mac Lane, S.: Categories for the Working Mathematician. Springer-Verlag (1971)

  18. Marmolejo, F.: Distributive laws for pseudo-monads. Theory and Applications of Categories 5, 91–147 (1999)

    MATH  MathSciNet  Google Scholar 

  19. Miculan, M., Scagnetto, I.: A framework for typed HOAS and semantics. In: Proceedings PPDP 03, ACM Press, pp. 184–194 (2003)

  20. Moggi, E.: Computational lambda-calculus and monads. In: Proceedings LICS 89, pp. 14–23 (1989)

  21. O’Hearn, P.W., Tennent, R.D.: Algol-like Languages, Progress in Theoretical Computer Science Series. Birkhauser (1997)

  22. Plotkin, G.D., Power, A.J.: Algebraic Operations and Generic Effects. In: Proceedings MFCSIT 2000, Applied Categorical Structures 11, 69–94 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  23. Power, A.J.: Enriched lawvere theories. Theory and Applications of Categories 6, 83–93 (1999)

    MATH  MathSciNet  Google Scholar 

  24. Power, A.J.: Models of the computational λ-calculus. In: Proceedings MFCSIT 2002, ENTCS 40 (2001)

  25. Power, A.J.: A unified category-theoretic approach to variable binding. In: Proceedings MERLIN 2003, ACM Digital Library (2003)

  26. Power, A.J.: Countable Lawvere theories and computational effects. In: Proceedings MFCSIT 2004, ENTCS, to appear.

  27. Power, A.J., Tanaka, M.: Binding signatures for generic contexts. In: Proceedings TLCA 2005, LNCS 3461, pp. 308–323 (2005)

  28. Tanaka, M., Power, A.J.: A Unified Category-Theoretic Formulation of Typed Binding Signatures. In: Proceedings MERLIN 2005, ACM Digital Library (2005)

  29. Tanaka, M., Power, A.J.: A Unified Category-Theoretic Semantics for Binding Signatures in Substructural Logics. Journal of Logic and Computation, 16(1), 5–25 (2006).

    Article  MathSciNet  Google Scholar 

  30. Pym, D.: The Semantics and Proof Theory of the Logic of Bunched Implications, Applied Logic Series. Kluwerer (2002)

  31. Tanaka, M.: Abstract syntax and variable binding for linear binders. In: Proceedings MFCS 2000, LNCS 1893, pp. 670–679 (2000)

  32. Tanaka, M.: Pseudo-Distributive Laws and a Unified Framework for Variable Binding. Ph.D Thesis, the University of Edinburgh (2004)

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Miki Tanaka.

Additional information

This work has been done with the support of EPSRC grant GR/586372/01, A Theory of Effects for Programming Languages.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Tanaka, M., Power, J. Pseudo-distributive laws and axiomatics for variable binding. Higher-Order Symb Comput 19, 305–337 (2006). https://doi.org/10.1007/s10990-006-8750-x

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10990-006-8750-x

Keywords

Navigation