Skip to main content

Initial Algebras of Terms with Binding and Algebraic Structure

  • Chapter
Categories and Types in Logic, Language, and Physics

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 8222))

Abstract

One of the many results which makes Joachim Lambek famous is: an initial algebra of an endofunctor is an isomorphism. This fixed point result is often referred to as “Lambek’s Lemma”. In this paper, we illustrate the power of initiality by exploiting it in categories of algebra-valued presheaves \(\mathcal{E}{\kern-.2ex}\mathcal{M}(T)^{\mathbb{N}}\), for a monad T on Sets. The use of presheaves to obtain certain calculi of expressions (with variable binding) was introduced by Fiore, Plotkin, and Turi. They used set-valued presheaves, whereas here the presheaves take values in a category \(\mathcal{E}{\kern-.2ex}\mathcal{M}(T)\) of Eilenberg-Moore algebras. This generalisation allows us to develop a theory where more structured calculi can be obtained. The use of algebras means also that we work in a linear context and need a separate operation ! for replication, for instance to describe strength for an endofunctor on \(\mathcal{E}{\kern-.2ex}\mathcal{M}(T)\). We apply the resulting theory to give systematic descriptions of non-trivial calculi: we introduce non-deterministic and weighted lambda terms and expressions for automata as initial algebras, and we formalise relevant equations diagrammatically.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Atkey, R., Johann, P., Ghani, N.: When is a type refinement an inductive type? In: Hofmann, M. (ed.) FOSSACS 2011. LNCS, vol. 6604, pp. 72–87. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  2. Barr, M., Wells, C.: Toposes, Triples and Theories. Springer, Berlin (1985), Revized and corrected version available from www.cwru.edu/artsci/math/wells/pub/ttt.html

  3. Bonsangue, M., Milius, S., Silva, A.: Sound and complete axiomatizations of coalgebraic language equivalence. ACM Trans. on Computational Logic 14(1) (2013)

    Google Scholar 

  4. Borceux, F.: Handbook of Categorical Algebra. Encyclopedia of Mathematics, vol. 50, 51 and 52. Cambridge Univ. Press (1994)

    Google Scholar 

  5. Coecke, B., Pavlović, D., Vicary, J.: A new description of orthogonal bases. Math. Struct. in Comp. Sci., 1–13 (2012)

    Google Scholar 

  6. de’ Liguoro, U., Piperno, A.: Non-deterministic extensions of untyped λ-calculus. Inf. & Comp. 122, 149–177 (1995)

    Article  Google Scholar 

  7. Ésik, Z., Kuich, W.: Free iterative and iteration k-semialgebras. CoRR, abs/1008.1507 (2010)

    Google Scholar 

  8. Fiore, M., Plotkin, G., Turi, D.: Abstract syntax and variable binding. In: LICS, pp. 193–202. IEEE Computer Society (1999)

    Google Scholar 

  9. Fiore, M., Staton, S.: Comparing operational models of name-passing process calculi. Inf. & Comp. 2004(4), 524–560 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  10. Fiore, M., Turi, D.: Semantics of name and value passing. In: Logic in Computer Science, pp. 93–104. IEEE Computer Science Press (2001)

    Google Scholar 

  11. Goguen, J., Thatcher, J., Wagner, E., Wright, J.: Initial algebra semantics and continuous algebras. Journ. ACM 24(1), 68–95 (1977)

    Article  MathSciNet  MATH  Google Scholar 

  12. Hasuo, I., Jacobs, B., Sokolova, A.: Generic trace theory via coinduction. Logical Methods in Computer Science 3(4:11) (2007)

    Google Scholar 

  13. Jacobs, B.: Semantics of weakening and contraction. Ann. Pure & Appl. Logic 69(1), 73–106 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  14. Jacobs, B.: Categorical Logic and Type Theory. North Holland, Amsterdam (1999)

    MATH  Google Scholar 

  15. Jacobs, B.: A bialgebraic review of deterministic automata, regular expressions and languages. In: Futatsugi, K., Jouannaud, J.-P., Meseguer, J. (eds.) Algebra, Meaning, and Computation. LNCS, vol. 4060, pp. 375–404. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  16. Jacobs, B.: Bases as coalgebras. In: Corradini, A., Klin, B., Cîrstea, C. (eds.) CALCO 2011. LNCS, vol. 6859, pp. 237–252. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  17. Jacobs, B.: Introduction to Coalgebra. Towards Mathematics of States and Observations (2012) Book, in preparation; version 2 available from http://www.cs.ru.nl/B.Jacobs/CLG/JacobsCoalgebraIntro.pdf

  18. Joyal, A., Moerdijk, I.: Algebraic Set Theory. LMS, vol. 220. Cambridge Univ. Press (1995)

    Google Scholar 

  19. Klin, B.: Bialgebras for structural operational semantics: An introduction. Theor. Comp. Sci. 412(38), 5043–5069 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  20. Kock, A.: Bilinearity and cartesian closed monads. Math. Scand. 29, 161–174 (1971)

    Article  MathSciNet  MATH  Google Scholar 

  21. Kock, A.: Closed categories generated by commutative monads. Journ. Austr. Math. Soc XII, 405–424 (1971)

    Article  MathSciNet  MATH  Google Scholar 

  22. Lambek, J.: A fixed point theorem for complete categories. Math. Zeitschr. 103, 151–161 (1968)

    Article  MATH  Google Scholar 

  23. Manes, E.G.: Algebraic Theories. Springer, Berlin (1974)

    Google Scholar 

  24. Mac Lane, S.: Categories for the Working Mathematician. Springer, Berlin (1971)

    Google Scholar 

  25. Møgelberg, R.E., Staton, S.: Linearly-used state in models of call-by-value. In: Corradini, A., Klin, B., Cîrstea, C. (eds.) CALCO 2011. LNCS, vol. 6859, pp. 298–313. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  26. Pagani, M., della Rocca, S.R.: Solvability in resource lambda-calculus. In: Ong, L. (ed.) FOSSACS 2010. LNCS, vol. 6014, pp. 358–373. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  27. Rabinovich, A.M.: A complete axiomatisation for trace congruence of finite state behaviors. In: Main, M.G., Melton, A.C., Mislove, M.W., Schmidt, D., Brookes, S.D. (eds.) MFPS 1993. LNCS, vol. 802, pp. 530–543. Springer, Heidelberg (1994)

    Chapter  Google Scholar 

  28. Rutten, J.: Universal coalgebra: a theory of systems. Theor. Comput. Sci. 249(1), 3–80 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  29. Silva, A.: Kleene coalgebra. PhD thesis, Radboud University Nijmegen (2010)

    Google Scholar 

  30. Silva, A., Bonchi, F., Bonsangue, M., Rutten, J.: Generalizing the powerset construction, coalgebraically. In: Proc. FSTTCS 2010. LIPIcs, vol. 8, pp. 272–283 (2010)

    Google Scholar 

  31. Silva, A., Bonsangue, M., Rutten, J.: Non-deterministic kleene coalgebras. Logical Methods in Computer Science 6(3) (2010)

    Google Scholar 

  32. Uustalu, T., Vene, V., Pardo, A.: Recursion schemes from comonads. Nordic Journ. Comput. 8(3), 366–390 (2001)

    MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Jacobs, B., Silva, A. (2014). Initial Algebras of Terms with Binding and Algebraic Structure. In: Casadio, C., Coecke, B., Moortgat, M., Scott, P. (eds) Categories and Types in Logic, Language, and Physics. Lecture Notes in Computer Science, vol 8222. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-54789-8_12

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-54789-8_12

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-54788-1

  • Online ISBN: 978-3-642-54789-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics