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 Analysis of Symmetry in Quantitative Semantics (2401.17483v1)

Published 30 Jan 2024 in cs.LO and math.CT

Abstract: In this paper, we build on a recent bicategorical model called thin spans of groupoids, introduced by Clairambault and Forest. Notably, thin spans feature a decomposition of symmetry into two sub-groupoids of polarized -- positive and negative -- symmetries. We first construct a variation of the original exponential of thin spans, based on sequences rather than families. Then we give a syntactic characterisation of the interpretation of simply-typed lambda-terms in thin spans, in terms of rigid intersection types and rigid resource terms. Finally, we formally relate thin spans with the weighted relational model and generalized species of structure. This allows us to show how some quantities in those models reflect polarized symmetries: in particular we show that the weighted relational model counts witnesses from generalized species of structure, divided by the cardinal of a group of positive symmetries.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (28)
  1. Full Abstraction for PCF. Inf. Comput. 163, 2 (2000), 409–470. https://doi.org/10.1006/inco.2000.2930
  2. Thin Games with Symmetry and Concurrent Hyland-Ong Games. Log. Methods Comput. Sci. 15, 1 (2019). https://doi.org/10.23638/LMCS-15(1:18)2019
  3. Pierre Clairambault and Simon Forest. 2023. The Cartesian Closed Bicategory of Thin Spans of Groupoids. In LICS. 1–13. https://doi.org/10.1109/LICS56636.2023.10175754
  4. From Thin Concurrent Games to Generalized Species of Structures. In LICS. 1–14. https://doi.org/10.1109/LICS56636.2023.10175681
  5. Daniel De Carvalho. 2007. Sémantiques de la logique linéaire et temps de calcul. Ph. D. Dissertation.
  6. Daniel de Carvalho. 2018. Execution time of λ𝜆\lambdaitalic_λ-terms via denotational semantics and intersection types. Math. Struct. Comput. Sci. 28, 7 (2018), 1169–1203. https://doi.org/10.1017/S0960129516000396
  7. A semantic measure of the execution time in linear logic. Theor. Comput. Sci. 412, 20 (2011), 1884–1902. https://doi.org/10.1016/j.tcs.2010.12.017
  8. Thomas Ehrhard. 2002. On Köthe Sequence Spaces and Linear Logic. Math. Struct. Comput. Sci. 12, 5 (2002), 579–623.
  9. Full Abstraction for Probabilistic PCF. J. ACM 65, 4 (2018), 23:1–23:44.
  10. Thomas Ehrhard and Laurent Regnier. 2003. The differential lambda-calculus. Theor. Comput. Sci. 309, 1-3 (2003), 1–41. https://doi.org/10.1016/S0304-3975(03)00392-X
  11. Thomas Ehrhard and Laurent Regnier. 2008. Uniformity and the Taylor expansion of ordinary lambda-terms. Theoretical Computer Science 403, 2-3 (2008), 347–372.
  12. The cartesian closed bicategory of generalised species of structures. Journal of the London Mathematical Society 77, 1 (2008), 203–220.
  13. Marcelo Fiore and Philip Saville. 2021. Coherence for bicategorical cartesian closed structure. Math. Struct. Comput. Sci. 31, 7 (2021), 822–849. https://doi.org/10.1017/S0960129521000281
  14. Philippa Gardner. 1994. Discovering Needed Reductions Using Type Theory. In TACS (Lecture Notes in Computer Science, Vol. 789). Springer, 555–574.
  15. Jean-Yves Girard. 1987. Linear Logic. Theor. Comput. Sci. 50 (1987), 1–102. https://doi.org/10.1016/0304-3975(87)90045-4
  16. Jean-Yves Girard. 1988. Normal functors, power series and λ𝜆\lambdaitalic_λ-calculus. Ann. Pure Appl. Log. 37, 2 (1988), 129–177.
  17. J. M. E. Hyland and C.-H. Luke Ong. 2000. On Full Abstraction for PCF: I, II, and III. Inf. Comput. 163, 2 (2000), 285–408. https://doi.org/10.1006/inco.2000.2917
  18. Martin Hyland. 1997. Game Semantics. Semantics and Logics of Computation 14 (1997), 131.
  19. Weighted Relational Models of Typed Lambda-Calculi. In 28th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2013, New Orleans, LA, USA, June 25-28, 2013. IEEE Computer Society, 301–310. https://doi.org/10.1109/LICS.2013.36
  20. François Lamarche. 1992. Quantitative Domains and Infinitary Algebras. Theor. Comput. Sci. 94, 1 (1992), 37–62.
  21. Paul-André Melliès. 2019. Template games and differential linear logic. In LICS. IEEE, 1–13.
  22. Paul-André Mellies. 2003. Asynchronous games 1: Uniformity by group invariance.
  23. Paul-André Mellies. 2009. Categorical semantics of linear logic. Panoramas et syntheses 27 (2009), 15–215.
  24. Federico Olimpieri. 2021. Intersection Type Distributors. In 36th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2021, Rome, Italy, June 29 - July 2, 2021. IEEE, 1–15. https://doi.org/10.1109/LICS52264.2021.9470617
  25. Federico Olimpieri and Lionel Vaux Auclair. 2022. On the Taylor expansion of λ𝜆\lambdaitalic_λ-terms and the groupoid structure of their rigid approximants. Log. Methods Comput. Sci. 18, 1 (2022).
  26. Applying quantitative semantics to higher-order quantum computing. In POPL. ACM, 647–658.
  27. Generalised species of rigid resource terms. In 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2017, Reykjavik, Iceland, June 20-23, 2017. IEEE Computer Society, 1–12. https://doi.org/10.1109/LICS.2017.8005093
  28. Species, Profunctors and Taylor Expansion Weighted by SMCC: A Unified Framework for Modelling Nondeterministic, Probabilistic and Quantum Programs. In LICS. ACM, 889–898.
Citations (1)

Summary

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