Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
184 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

An Introduction to Different Approaches to Initial Semantics (2401.09366v1)

Published 17 Jan 2024 in cs.LO and cs.PL

Abstract: Characterizing programming languages with variable binding as initial objects, was first achieved by Fiore, Plotkin, and Turi in their seminal paper published at LICS'99. To do so, in particular to prove initiality theorems, they developed a framework based on monoidal categories, functors with strengths, and $\Sigma$-monoids. An alternative approach using modules over monads was later introduced by Hirschowitz and Maggesi, for endofunctor categories, that is, for particular monoidal categories. This approach has the advantage of providing a more general and abstract definition of signatures and models; however, no general initiality result is known for this notion of signature. Furthermore, Matthes and Uustalu provided a categorical formalism for constructing (initial) monads via Mendler-style recursion, that can also be used for initial semantics. The different approaches have been developed further in several articles. However, in practice, the literature is difficult to access, and links between the different strands of work remain underexplored. In the present work, we give an introduction to initial semantics that encompasses the three different strands. We develop a suitable "pushout" of Hirschowitz and Maggesi's framework with Fiore's, and rely on Matthes and Uustalu's formalism to provide modular proofs. For this purpose, we generalize both Hirschowitz and Maggesi's framework, and Matthes and Uustalu's formalism to the general setting of monoidal categories studied by Fiore and collaborators. Moreover, we provide fully worked out presentation of some basic instances of the literature, and an extensive discussion of related work explaining the links between the different approaches.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (55)
  1. Jiří Adámek “Free algebras and automata realizations in the language of categories” In Commentationes Mathematicae Universitatis Carolinae 015.4 Charles University in Prague, Faculty of MathematicsPhysics, 1974, pp. 589–602 URL: http://eudml.org/doc/16649
  2. Benedikt Ahrens “Extended Initiality for Typed Abstract Syntax” In Log. Methods Comput. Sci. 8.2, 2012 DOI: 10.2168/LMCS-8(2:1)2012
  3. Benedikt Ahrens “Initial Semantics for Reduction Rules” In Log. Methods Comput. Sci. 15.1, 2019 DOI: 10.23638/LMCS-15(1:28)2019
  4. Benedikt Ahrens “Initiality for Typed Syntax and Semantics” In Journal of Formalized Reasoning 8.2, 2015, pp. 1–155 DOI: 10.6092/issn.1972-5787/4712
  5. Benedikt Ahrens “Modules over relative monads for syntax and semantics” In Math. Struct. Comput. Sci. 26.1, 2016, pp. 3–37 DOI: 10.1017/S0960129514000103
  6. “Modular Specification of Monads Through Higher-Order Presentations” In 4th International Conference on Formal Structures for Computation and Deduction, FSCD 2019, June 24-30, 2019, Dortmund, Germany 131, LIPIcs Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, pp. 6:1–6:19 DOI: 10.4230/LIPIcs.FSCD.2019.6
  7. “Presentable signatures and initial semantics” In Log. Methods Comput. Sci. 17.2, 2021 URL: https://lmcs.episciences.org/7511
  8. “Reduction monads and their signatures” In Proc. ACM Program. Lang. 4.POPL, 2020, pp. 31:1–31:29 DOI: 10.1145/3371099
  9. “Heterogeneous Substitution Systems Revisited” In 21st International Conference on Types for Proofs and Programs, TYPES 2015, May 18-21, 2015, Tallinn, Estonia 69, LIPIcs Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2015, pp. 2:1–2:23 DOI: 10.4230/LIPIcs.TYPES.2015.2
  10. Benedikt Ahrens, Ralph Matthes and Anders Mörtberg “From Signatures to Monads in UniMath” In J. Autom. Reason. 63.2, 2019, pp. 285–318 DOI: 10.1007/s10817-018-9474-4
  11. Benedikt Ahrens, Ralph Matthes and Anders Mörtberg “Implementing a category-theoretic framework for typed abstract syntax” In CPP ’22: 11th ACM SIGPLAN International Conference on Certified Programs and Proofs, Philadelphia, PA, USA, January 17 - 18, 2022 ACM, 2022, pp. 307–323 DOI: 10.1145/3497775.3503678
  12. Benedikt Ahrens, Ralph Matthes and Kobe Wullaert “Formalizing Monoidal Categories and Actions for Syntax with Binders”, 2023 arXiv:2307.16270 [cs.PL]
  13. “Initial Semantics for higher-order typed syntax in Coq” In J. Formaliz. Reason. 4, 2010, pp. 25–69
  14. Thorsten Altenkirch, James Chapman and Tarmo Uustalu “Monads need not be endofunctors” In Log. Methods Comput. Sci. 11.1, 2015 DOI: 10.2168/LMCS-11(1:3)2015
  15. “Monadic Presentations of Lambda Terms Using Generalized Inductive Types” In Computer Science Logic, 13th International Workshop, CSL ’99, 8th Annual Conference of the EACSL, Madrid, Spain, September 20-25, 1999, Proceedings 1683, Lecture Notes in Computer Science Springer, 1999, pp. 453–468 DOI: 10.1007/3-540-48168-0“˙32
  16. “Mechanized Metatheory for the Masses: The PoplMark Challenge” In Theorem Proving in Higher Order Logics, 18th International Conference, TPHOLs 2005, Oxford, UK, August 22-25, 2005, Proceedings 3603, Lecture Notes in Computer Science Springer, 2005, pp. 50–65 DOI: 10.1007/11541868“˙4
  17. “Substitution: A Formal Methods Case Study Using Monads and Transformations” In Sci. Comput. Program. 23.2-3, 1994, pp. 287–311 DOI: 10.1016/0167-6423(94)00022-0
  18. “Algebra of Programming” USA: Prentice-Hall, Inc., 1997
  19. Richard S. Bird and Lambert G.L.T. Meertens “Nested Datatypes” In Mathematics of Program Construction, MPC’98, Marstrand, Sweden, June 15-17, 1998, Proceedings 1422, Lecture Notes in Computer Science Springer, 1998, pp. 52–67 DOI: 10.1007/BFb0054285
  20. Richard S. Bird and Ross Paterson “De Bruijn Notation as a Nested Datatype” In J. Funct. Program. 9.1, 1999, pp. 77–91 DOI: 10.1017/s0956796899003366
  21. Richard S. Bird and Ross Paterson “Generalised folds for nested datatypes” In Formal Aspects Comput. 11.2, 1999, pp. 200–222 DOI: 10.1007/s001650050047
  22. Peio Borthelle, Tom Hirschowitz and Ambroise Lafont “A Cellular Howe Theorem” In LICS ’20: 35th Annual ACM/IEEE Symposium on Logic in Computer Science, Saarbrücken, Germany, July 8-11, 2020 ACM, 2020, pp. 273–286 DOI: 10.1145/3373718.3394738
  23. “List Objects with Algebraic Structure” In 2nd International Conference on Formal Structures for Computation and Deduction, FSCD 2017, September 3-9, 2017, Oxford, UK 84, LIPIcs Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017, pp. 16:1–16:18 DOI: 10.4230/LIPIcs.FSCD.2017.16
  24. “Formal metatheory of second-order abstract syntax” In Proc. ACM Program. Lang. 6.POPL, 2022, pp. 1–29 DOI: 10.1145/3498715
  25. Marcelo P. Fiore “Mathematical Models of Computational and Combinatorial Structures” In Foundations of Software Science and Computational Structures, 8th International Conference, FOSSACS 2005, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2005, Edinburgh, UK, April 4-8, 2005, Proceedings 3441, Lecture Notes in Computer Science Springer, 2005, pp. 25–46 DOI: 10.1007/978-3-540-31982-5“˙2
  26. Marcelo P. Fiore “Second-Order and Dependently-Sorted Abstract Syntax” In Proceedings of the Twenty-Third Annual IEEE Symposium on Logic in Computer Science, LICS 2008, 24-27 June 2008, Pittsburgh, PA, USA IEEE Computer Society, 2008, pp. 57–68 DOI: 10.1109/LICS.2008.38
  27. Marcelo P. Fiore “Semantic analysis of normalisation by evaluation for typed lambda calculus” In Proceedings of the 4th international ACM SIGPLAN conference on Principles and practice of declarative programming, October 6-8, 2002, Pittsburgh, PA, USA (Affiliated with PLI 2002) ACM, 2002, pp. 26–37 DOI: 10.1145/571157.571161
  28. Marcelo P. Fiore and Makoto Hamana “Multiversal Polymorphic Algebraic Theories: Syntax, Semantics, Translations, and Equational Logic” In 28th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2013, New Orleans, LA, USA, June 25-28, 2013 IEEE Computer Society, 2013, pp. 520–529 DOI: 10.1109/LICS.2013.59
  29. Marcelo P. Fiore and Chung-Kil Hur “Equational Systems and Free Constructions (Extended Abstract)” In Automata, Languages and Programming, 34th International Colloquium, ICALP 2007, Wroclaw, Poland, July 9-13, 2007, Proceedings 4596, Lecture Notes in Computer Science Springer, 2007, pp. 607–618 DOI: 10.1007/978-3-540-73420-8“˙53
  30. Marcelo P. Fiore and Chung-Kil Hur “On the construction of free algebras for equational systems” In Theor. Comput. Sci. 410.18, 2009, pp. 1704–1729 DOI: 10.1016/j.tcs.2008.12.052
  31. Marcelo P. Fiore and Chung-Kil Hur “Second-Order Equational Logic (Extended Abstract)” In Computer Science Logic, 24th International Workshop, CSL 2010, 19th Annual Conference of the EACSL, Brno, Czech Republic, August 23-27, 2010. Proceedings 6247, Lecture Notes in Computer Science Springer, 2010, pp. 320–335 DOI: 10.1007/978-3-642-15205-4“˙26
  32. Marcelo P. Fiore and Chung-Kil Hur “Term Equational Systems and Logics: (Extended Abstract)” In Proceedings of the 24th Conference on the Mathematical Foundations of Programming Semantics, MFPS 2008, Philadelphia, PA, USA, May 22-25, 2008 218, Electronic Notes in Theoretical Computer Science Elsevier, 2008, pp. 171–192 DOI: 10.1016/j.entcs.2008.10.011
  33. Marcelo P. Fiore and Ola Mahmoud “Second-Order Algebraic Theories - (Extended Abstract)” In Mathematical Foundations of Computer Science 2010, 35th International Symposium, MFCS 2010, Brno, Czech Republic, August 23-27, 2010. Proceedings 6281, Lecture Notes in Computer Science Springer, 2010, pp. 368–380 DOI: 10.1007/978-3-642-15155-2“˙33
  34. Marcelo P. Fiore, Gordon D. Plotkin and Daniele Turi “Abstract Syntax and Variable Binding” In 14th Annual IEEE Symposium on Logic in Computer Science, Trento, Italy, July 2-5, 1999 IEEE Computer Society, 1999, pp. 193–202 DOI: 10.1109/LICS.1999.782615
  35. Joseph A Goguen “An Initial Algebra Approach to the Specification, Correctness and Implementation of Abstract Data Types” In IBM Research Report 6487, 1976
  36. “Abstract data types as initial algebras and the correctness of data representations” In Computer Graphics, Pattern Recognition and Data Structure, 1975, pp. 89–93
  37. Makoto Hamana “Free S-Monoids: A Higher-Order Syntax with Metavariables” In Programming Languages and Systems: Second Asian Symposium, APLAS 2004, Taipei, Taiwan, November 4-6, 2004. Proceedings 3302, Lecture Notes in Computer Science Springer, 2004, pp. 348–363 DOI: 10.1007/978-3-540-30477-7“˙23
  38. Makoto Hamana “Polymorphic Abstract Syntax via Grothendieck Construction” In Foundations of Software Science and Computational Structures - 14th International Conference, FOSSACS 2011, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2011, Saarbrücken, Germany, March 26-April 3, 2011. Proceedings 6604, Lecture Notes in Computer Science Springer, 2011, pp. 381–395 DOI: 10.1007/978-3-642-19805-2“˙26
  39. André Hirschowitz, Tom Hirschowitz and Ambroise Lafont “Modules over Monads and Operational Semantics” In 5th International Conference on Formal Structures for Computation and Deduction, FSCD 2020, June 29-July 6, 2020, Paris, France (Virtual Conference) 167, LIPIcs Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, pp. 12:1–12:23 DOI: 10.4230/LIPIcs.FSCD.2020.12
  40. André Hirschowitz, Tom Hirschowitz and Ambroise Lafont “Modules over monads and operational semantics (expanded version)” In Log. Methods Comput. Sci. 18.3, 2022 DOI: 10.46298/lmcs-18(3:3)2022
  41. “Variable binding and substitution for (nameless) dummies” In Foundations of Software Science and Computation Structures - 25th International Conference, FOSSACS 2022, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2022, Munich, Germany, April 2-7, 2022, Proceedings 13242, Lecture Notes in Computer Science Springer, 2022, pp. 389–408 DOI: 10.1007/978-3-030-99253-8“˙20
  42. “Initial Semantics for Strengthened Signatures” In Proceedings 8th Workshop on Fixed Points in Computer Science, FICS 2012, Tallinn, Estonia, 24th March 2012 77, EPTCS, 2012, pp. 31–38 DOI: 10.4204/EPTCS.77.5
  43. “Modules over monads and initial semantics” In Inf. Comput. 208.5, 2010, pp. 545–564 DOI: 10.1016/j.ic.2009.07.003
  44. “Modules over Monads and Linearity” In Logic, Language, Information and Computation, 14th International Workshop, WoLLIC 2007, Rio de Janeiro, Brazil, July 2-5, 2007, Proceedings 4576, Lecture Notes in Computer Science Springer, 2007, pp. 218–237 DOI: 10.1007/978-3-540-73445-1“˙16
  45. Chung-Kil Hur “Categorical equational systems : algebraic models and equational reasoning”, 2010 URL: https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.608664
  46. Graham Hutton “A Tutorial on the Universality and Expressiveness of Fold” In J. Funct. Program. 9.4, 1999, pp. 355–372 DOI: 10.1017/s0956796899003500
  47. “2-dimensional categories” In arXiv preprint arXiv:2002.06055, 2020
  48. Ambroise Lafont “Signatures and models for syntax and operational semantics in the presence of variable binding” In CoRR abs/1910.09162, 2019 arXiv: http://arxiv.org/abs/1910.09162
  49. Saunders Mac Lane “Categories for the working mathematician” Springer Science & Business Media, 2013
  50. “Substitution in non-wellfounded syntax with variable binding” In Theor. Comput. Sci. 327.1-2, 2004, pp. 155–174 DOI: 10.1016/j.tcs.2004.07.025
  51. Ralph Matthes, Kobe Wullaert and Benedikt Ahrens “Substitution for Non-Wellfounded Syntax with Binders Through Monoidal Categories”, 2023 arXiv:2308.05485 [cs.PL]
  52. “On the Size of Categories” In Theory and Applications of Categories 1.9, 1998, pp. 174–178 URL: http://www.tac.mta.ca/tac/index.html#vol1
  53. E. Riehl “Category theory in context”, Aurora: Dover modern math originals Dover Publications, 2014
  54. Varmo Vene “Categorical Programming with Inductive and Coinductive Types”, 2000 URL: https://api.semanticscholar.org/CorpusID:122887692
  55. Julianna Zsido “Typed Abstract Syntax”, 2010 URL: https://theses.hal.science/tel-00535944
Citations (1)

Summary

We haven't generated a summary for this paper yet.

X Twitter Logo Streamline Icon: https://streamlinehq.com