skip to main content
research-article
Open Access

Elements of Quantitative Rewriting

Published:11 January 2023Publication History
Skip Abstract Section

Abstract

We introduce a general theory of quantitative and metric rewriting systems, namely systems with a rewriting relation enriched over quantales modelling abstract quantities. We develop theories of abstract and term-based systems, refining cornerstone results of rewriting theory (such as Newman’s Lemma, Church-Rosser Theorem, and critical pair-like lemmas) to a metric and quantitative setting. To avoid distance trivialisation and lack of confluence issues, we introduce non-expansive, linear term rewriting systems, and then generalise the latter to the novel class of graded term rewriting systems. These systems make quantitative rewriting modal and context-sensitive, this way endowing rewriting with coeffectful behaviours.

References

  1. Martín Abadi, Anindya Banerjee, Nevin Heintze, and Jon G. Riecke. 1999. A Core Calculus of Dependency. In POPL ’99, Proceedings of the 26th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, San Antonio, TX, USA, January 20-22, 1999. 147–160. Google ScholarGoogle Scholar
  2. Andreas Abel and Jean-Philippe Bernardy. 2020. A unified view of modalities in type systems. Proc. ACM Program. Lang., 4, ICFP (2020), 90:1–90:28. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. Samson Abramsky. 2002. Predicative Copying and Polynomial Time. Clifford Lectures, Tulane. Google ScholarGoogle Scholar
  4. Samson Abramsky, Esfandiar Haghverdi, and Philip Scott. 2002. Geometry of interaction and linear combinatory algebras. Mathematical Structures in Computer Science, 12, 5 (2002), 625–665. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. Peter Aczel. 1978. A general Church-Rosser theorem. Draft, Manchester. Google ScholarGoogle Scholar
  6. A. Arnold and M. Nivat. 1980. Metric Interpretations of Infinite Trees and Semantics of non Deterministic Recursive Programs. Theor. Comput. Sci., 11 (1980), 181–205. Google ScholarGoogle ScholarCross RefCross Ref
  7. Andrea Asperti and Stefano Guerrini. 1998. The optimal implementation of functional programming languages (Cambridge tracts in theoretical computer science, Vol. 45). Cambridge University Press. Google ScholarGoogle Scholar
  8. Robert Atkey. 2018. Syntax and Semantics of Quantitative Type Theory. In Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2018, Oxford, UK, July 09-12, 2018. 56–65. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. Martin Avanzini, Ugo Dal Lago, and Akihisa Yamada. 2020. On probabilistic term rewriting. Sci. Comput. Program., 185 (2020). Google ScholarGoogle Scholar
  10. Giorgio Bacci, Radu Mardare, Prakash Panangaden, and Gordon Plotkin. 2020. Foundations of Probabilistic Programming. Cambridge University Press, 333–360. https://doi.org/10.1017/9781108770750.011 Google ScholarGoogle ScholarCross RefCross Ref
  11. Giorgio Bacci, Radu Mardare, Prakash Panangaden, and Gordon D. Plotkin. 2018. An Algebraic Theory of Markov Processes. In Proc. of LICS 2018, Anuj Dawar and Erich Grädel (Eds.). ACM, 679–688. https://doi.org/10.1145/3209108.3209177 Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. Giorgio Bacci, Radu Mardare, Prakash Panangaden, and Gordon D. Plotkin. 2021. Tensor of Quantitative Equational Theories. In 9th Conference on Algebra and Coalgebra in Computer Science, CALCO 2021, August 31 to September 3, 2021, Salzburg, Austria, Fabio Gadducci and Alexandra Silva (Eds.) (LIPIcs, Vol. 211). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 7:1–7:17. https://doi.org/10.4230/LIPIcs.CALCO.2021.7 Google ScholarGoogle ScholarCross RefCross Ref
  13. Roland Carl Backhouse. 2000. Galois Connections and Fixed Point Calculus. In Algebraic and Coalgebraic Methods in the Mathematics of Program Construction, International Summer School and Workshop, Oxford, UK, April 10-14, 2000, Revised Lectures, Roland Carl Backhouse, Roy L. Crole, and Jeremy Gibbons (Eds.) (Lecture Notes in Computer Science, Vol. 2297). Springer, 89–148. https://doi.org/10.1007/3-540-47797-7_4 Google ScholarGoogle ScholarCross RefCross Ref
  14. Paolo Baldan, Filippo Bonchi, Henning Kerstan, and Barbara König. 2014. Behavioral Metrics via Functor Lifting. In Proc. of FSTTCS. 403–415. Google ScholarGoogle Scholar
  15. Paolo Baldan, Filippo Bonchi, Henning Kerstan, and Barbara König. 2015. Towards Trace Metrics via Functor Lifting. In Proc. of CALCO 2015. 35–49. Google ScholarGoogle Scholar
  16. H.P. Barendregt. 1984. The lambda calculus: its syntax and semantics. North-Holland. Google ScholarGoogle Scholar
  17. R. Belohlávek. 2002. Fuzzy Relational Systems: Foundations and Principles. Springer US. Google ScholarGoogle Scholar
  18. Radim Belohlávek, Tomas Kuhr, and Vilém Vychodil. 2009. Confluence and related properties of fuzzy relations. In FUZZ-IEEE 2009, IEEE International Conference on Fuzzy Systems, Jeju Island, Korea, 20-24 August 2009, Proceedings. IEEE, 569–574. https://doi.org/10.1109/FUZZY.2009.5277248 Google ScholarGoogle ScholarCross RefCross Ref
  19. Radim Belohlávek, Tomas Kuhr, and Vilém Vychodil. 2010. Confluence and termination of fuzzy relations. Inf. Sci., 180, 17 (2010), 3288–3303. https://doi.org/10.1016/j.ins.2010.04.007 Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. Radim Belohlávek and Vilém Vychodil. 2005. Fuzzy Equational Logic (Studies in Fuzziness and Soft Computing, Vol. 186). Springer. https://doi.org/10.1007/b105121 Google ScholarGoogle ScholarCross RefCross Ref
  21. Jean-Philippe Bernardy, Mathieu Boespflug, Ryan R. Newton, Simon Peyton Jones, and Arnaud Spiwack. 2018. Linear Haskell: practical linearity in a higher-order polymorphic language. PACMPL, 2, POPL (2018), 5:1–5:29. Google ScholarGoogle Scholar
  22. M. Bezem, J.W. Klop, E. Barendsen, R. de Vrijer, and Terese. 2003. Term Rewriting Systems. Cambridge University Press. Google ScholarGoogle Scholar
  23. Richard S. Bird and Oege de Moor. 1997. Algebra of programming. Prentice Hall. Google ScholarGoogle Scholar
  24. M.M. Bonsangue, F. Van Breugel, and J.J.M.M. Rutten. 1998. Generalized Metric Spaces: Completion, Topology, and Powerdomains via the Yoneda Embedding. Theor. Comput. Sci., 193, 1-2 (1998), 1–51. Google ScholarGoogle ScholarDigital LibraryDigital Library
  25. R.V. Book and F. Otto. 1993. String-rewriting Systems. Springer-Verlag. Google ScholarGoogle Scholar
  26. Aloïs Brunel, Marco Gaboardi, Damiano Mazza, and Steve Zdancewic. 2014. A Core Quantitative Coeffect Calculus. In Proc. of ESOP 2014. 351–370. Google ScholarGoogle ScholarDigital LibraryDigital Library
  27. Pritam Choudhury, Harley Eades III, Richard A. Eisenberg, and Stephanie Weirich. 2021. A Graded Dependent Type System with a Usage-Aware Semantics. Proc. ACM Program. Lang., 5, POPL (2021), Article 50, jan, 32 pages. https://doi.org/10.1145/3434331 Google ScholarGoogle ScholarDigital LibraryDigital Library
  28. Alonzo Church and J. B. Rosser. 1936. Some Properties of Conversion. Trans. Amer. Math. Soc., 39, 3 (1936), 472–482. Google ScholarGoogle ScholarCross RefCross Ref
  29. R. Crubillé and U. Dal Lago. 2014. On Probabilistic Applicative Bisimulation and Call-by-Value lambda-Calculi. In Proc. of ESOP 2014. 209–228. Google ScholarGoogle Scholar
  30. R. Crubillé and U. Dal Lago. 2015. Metric Reasoning about lambda-Terms: The Affine Case. In Proc. of LICS 2015. 633–644. Google ScholarGoogle Scholar
  31. R. Crubillé and U. Dal Lago. 2017. Metric Reasoning About lambda-Terms: The General Case. In Proc. of ESOP 2017. 341–367. Google ScholarGoogle Scholar
  32. H.B. Curry and R. Feys. 1958. Combinatory Logic (Combinatory Logic). North-Holland Publishing Company. Google ScholarGoogle Scholar
  33. H.B. Curry and R. Feys. 1958. Combinatory Logic (Combinatory Logic). North-Holland Publishing Company. Google ScholarGoogle Scholar
  34. Francesco Dagnino and Fabio Pasquali. 2022. Logical Foundations of Quantitative Equality. In Proceedings of the 37th ACM/IEEE Symposium on Logic in Computer Science, LICS 2022. ACM. https://doi.org/10.1145/3531130.3533337 to appear Google ScholarGoogle ScholarDigital LibraryDigital Library
  35. Fredrik Dahlqvist and Renato Neves. 2022. An Internal Language for Categories Enriched over Generalised Metric Spaces. In Proc. of CSL 2022, Florin Manea and Alex Simpson (Eds.) (LIPIcs, Vol. 216). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 16:1–16:18. https://doi.org/10.4230/LIPIcs.CSL.2022.16 Google ScholarGoogle ScholarCross RefCross Ref
  36. Ugo Dal Lago and Francesco Gavazzo. 2019. Effectful Normal Form Bisimulation. In Proc. of ESOP 2019. 263–292. Google ScholarGoogle Scholar
  37. Ugo Dal Lago and Francesco Gavazzo. 2020. Differential Logical Relations Part II: Increments and Derivatives. In Proc. of ICTCS 2020. 101–114. Google ScholarGoogle Scholar
  38. Ugo Dal Lago and Francesco Gavazzo. 2021. Differential logical relations, part II increments and derivatives. Theoretical Computer Science, issn:0304-3975 https://doi.org/10.1016/j.tcs.2021.09.027 Google ScholarGoogle ScholarDigital LibraryDigital Library
  39. Ugo Dal Lago and Francesco Gavazzo. 2021. Modal Reasoning = Metric Reasoning, via Lawvere. CoRR, abs/2103.03871 (2021), arXiv:2103.03871. arxiv:2103.03871 Google ScholarGoogle Scholar
  40. Ugo Dal Lago and Francesco Gavazzo. 2022. Effectful Program Distancing. Proc. ACM Program. Lang., 6, POPL (2022), https://doi.org/10.1145/3498680 Google ScholarGoogle ScholarDigital LibraryDigital Library
  41. Ugo Dal Lago and Francesco Gavazzo. 2022. A relational theory of effects and coeffects. Proc. ACM Program. Lang., 6, POPL (2022), 1–28. https://doi.org/10.1145/3498692 Google ScholarGoogle ScholarDigital LibraryDigital Library
  42. Ugo Dal Lago, Francesco Gavazzo, and Akira Yoshimizu. 2019. Differential Logical Relations, Part I: The Simply-Typed Case. In Proc. of ICALP 2019. 111:1–111:14. https://doi.org/10.4230/LIPIcs.ICALP.2019.111 Google ScholarGoogle ScholarCross RefCross Ref
  43. A.A. de Amorim, M. Gaboardi, J. Hsu, S. Katsumata, and I. Cherigui. 2017. A semantic account of metric preservation. In Proc. of POPL 2017. 545–556. Google ScholarGoogle Scholar
  44. J.W. de Bakker and J.I. Zucker. 1982. Denotational Semantics of Concurrency. In STOC. 153–158. Google ScholarGoogle Scholar
  45. M.M. Deza and E. Deza. 2009. Encyclopedia of Distances. Springer Berlin Heidelberg. Google ScholarGoogle Scholar
  46. Henk Doornbos, Roland Carl Backhouse, and Jaap van der Woude. 1997. A Calculational Approach to Mathematical Induction. Theor. Comput. Sci., 179, 1-2 (1997), 103–135. https://doi.org/10.1016/S0304-3975(96)00154-5 Google ScholarGoogle ScholarDigital LibraryDigital Library
  47. W. Du, Y. Deng, and D. Gebler. 2016. Behavioural Pseudometrics for Nondeterministic Probabilistic Systems. In Proc. of SETTA 2016. 67–84. Google ScholarGoogle Scholar
  48. M.H. Escardo. 1999. A metric model of PCF. In Workshop on Realizability Semantics and Applications. Google ScholarGoogle Scholar
  49. N. Ferns, P Panangaden, and D. Precup. 2004. Metrics for Finite Markov Decision Processes. In Prof. of UAI 2004. 162–169. Google ScholarGoogle Scholar
  50. N. Ferns, P Panangaden, and D. Precup. 2005. Metrics for Markov Decision Processes with Infinite State Spaces. In Prof. of UAI 2005. 201–208. Google ScholarGoogle Scholar
  51. Robert C Flagg. 1992. Completeness in continuity spaces. In AMS Conference proceedings. 13, 183–199. Google ScholarGoogle Scholar
  52. Peter J. Freyd and Andre Scedrov. 1990. Categories, allegories (North-Holland mathematical library, Vol. 39). North-Holland. Google ScholarGoogle Scholar
  53. Marco Gaboardi, Shin-ya Katsumata, Dominic A. Orchard, Flavien Breuvart, and Tarmo Uustalu. 2016. Combining effects and coeffects via grading. In Proc. of ICFP 2016. 476–489. Google ScholarGoogle ScholarDigital LibraryDigital Library
  54. Francesco Gavazzo. 2018. Quantitative Behavioural Reasoning for Higher-order Effectful Programs: Applicative Distances. In Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2018, Oxford, UK, July 09-12, 2018. 452–461. Google ScholarGoogle ScholarDigital LibraryDigital Library
  55. Francesco Gavazzo. 2019. Coinductive Equivalences and Metrics for Higher-order Languages with Algebraic Effects. Ph. D. Dissertation. University of Bologna, Italy. http://amsdottorato.unibo.it/9075/ Google ScholarGoogle Scholar
  56. Francesco Gavazzo and Cecilia Di Florio. 2022. Quantitative and Metric Rewriting: Abstract, Non-Expansive, and Graded Systems. CoRR, abs/2206.13610 (2022), https://doi.org/10.48550/arXiv.2206.13610 Google ScholarGoogle Scholar
  57. D. Gebler, Larsen. K.G., and S. Tini. 2016. Compositional bisimulation metric reasoning with Probabilistic Process Calculi. Logical Methods in Computer Science, 12, 4 (2016). Google ScholarGoogle Scholar
  58. Dan R. Ghica and Alex I. Smith. 2014. Bounded Linear Types in a Resource Semiring. In Programming Languages and Systems - 23rd European Symposium on Programming, ESOP 2014, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2014, Grenoble, France, April 5-13, 2014, Proceedings. 331–350. Google ScholarGoogle Scholar
  59. D. Gusfield. 1997. Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology. Cambridge University Press. Google ScholarGoogle ScholarDigital LibraryDigital Library
  60. P. Hájek. 1998. Metamathematics of Fuzzy Logic. Springer Netherlands. Google ScholarGoogle Scholar
  61. J.R. Hindley. 1964. The Church-Rosser Property and a Result in Combinatory Logic. Ph. D. Dissertation. University of Newcastle-upon-Tyne. Google ScholarGoogle Scholar
  62. J.R. Hindley. 2008. Basic Simple Type Theory. Cambridge University Press. Google ScholarGoogle ScholarDigital LibraryDigital Library
  63. J.R. Hindley and J.P. Seldin. 2008. Lambda-Calculus and Combinators: An Introduction. Cambridge University Press. Google ScholarGoogle Scholar
  64. 2014. Monoidal Topology. A Categorical Approach to Order, Metric, and Topology, D. Hofmann, G.J. Seal, and W. Tholen (Eds.) (Encyclopedia of Mathematics and its Applications). Cambridge University Press. Google ScholarGoogle Scholar
  65. Gérard P. Huet. 1980. Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems: Abstract Properties and Applications to Term Rewriting Systems. J. ACM, 27, 4 (1980), 797–821. https://doi.org/10.1145/322217.322230 Google ScholarGoogle ScholarDigital LibraryDigital Library
  66. Simon L. Peyton Jones. 1987. The Implementation of Functional Programming Languages. Prentice-Hall. Google ScholarGoogle ScholarDigital LibraryDigital Library
  67. F.W. Lawvere. 1973. Metric spaces, generalized logic, and closed categories. Rend. Sem. Mat. Fis. Milano, 43 (1973), 135–166. Google ScholarGoogle ScholarCross RefCross Ref
  68. Radu Mardare, Prakash Panangaden, and Gordon D. Plotkin. 2016. Quantitative Algebraic Reasoning. In Proc. of LICS 2016, Martin Grohe, Eric Koskinen, and Natarajan Shankar (Eds.). ACM, 700–709. https://doi.org/10.1145/2933575.2934518 Google ScholarGoogle ScholarDigital LibraryDigital Library
  69. Radu Mardare, Prakash Panangaden, and Gordon D. Plotkin. 2017. On the axiomatizability of quantitative algebras. In Proc. of LICS 2017. IEEE Computer Society, 1–12. https://doi.org/10.1109/LICS.2017.8005102 Google ScholarGoogle ScholarCross RefCross Ref
  70. Radu Mardare, Prakash Panangaden, and Gordon D. Plotkin. 2018. Free complete Wasserstein algebras. Log. Methods Comput. Sci., 14, 3 (2018), https://doi.org/10.23638/LMCS-14(3:19)2018 Google ScholarGoogle ScholarCross RefCross Ref
  71. Radu Mardare, Prakash Panangaden, and Gordon D. Plotkin. 2021. Fixed-Points for Quantitative Equational Logics. In Proc. of LICS 2021. IEEE, 1–13. https://doi.org/10.1109/LICS52264.2021.9470662 Google ScholarGoogle ScholarDigital LibraryDigital Library
  72. Daniel Marshall, Michael Vollmer, and Dominic Orchard. 2022. Linearity and Uniqueness: An Entente Cordiale. In Programming Languages and Systems, Ilya Sergey (Ed.). Springer International Publishing, Cham. 346–375. Google ScholarGoogle Scholar
  73. Stephan Meier-Oeser. 2011. Medieval Semiotics. In The Stanford Encyclopedia of Philosophy (Summer 2011 ed.), Edward N. Zalta (Ed.). Metaphysics Research Lab, Stanford University. Google ScholarGoogle Scholar
  74. Matteo Mio, Ralph Sarkis, and Valeria Vignudelli. 2021. Combining Nondeterminism, Probability, and Termination: Equational and Metric Reasoning. In Proc. of LICS 2021. IEEE, 1–14. https://doi.org/10.1109/LICS52264.2021.9470717 Google ScholarGoogle ScholarDigital LibraryDigital Library
  75. Matteo Mio, Ralph Sarkis, and Valeria Vignudelli. 2022. Beyond Nonexpansive Operations in Quantitative Algebraic Reasoning. CoRR, abs/2201.09087 (2022), arxiv:2201.09087 Google ScholarGoogle Scholar
  76. Georg Moser and Manuel Schneckenreither. 2020. Automated amortised resource analysis for term rewrite systems. Sci. Comput. Program., 185 (2020), https://doi.org/10.1016/j.scico.2019.102306 Google ScholarGoogle ScholarDigital LibraryDigital Library
  77. J.R. Munkres. 2000. Topology. Prentice Hall, Incorporated. Google ScholarGoogle Scholar
  78. Matthias Naaf, Florian Frohn, Marc Brockschmidt, Carsten Fuhs, and Jürgen Giesl. 2017. Complexity Analysis for Term Rewriting by Integer Transition Systems. In Proc. of FroCoS 2017, Clare Dixon and Marcelo Finger (Eds.) (Lecture Notes in Computer Science, Vol. 10483). Springer, 132–150. https://doi.org/10.1007/978-3-319-66167-4_8 Google ScholarGoogle ScholarCross RefCross Ref
  79. M. H. A. Newman. 1942. On Theories with a Combinatorial Definition of "Equivalence". Annals of Mathematics, 43, 2 (1942), 223–243. Google ScholarGoogle ScholarCross RefCross Ref
  80. Dominic Orchard, Vilem-Benjamin Liepelt, and Harley Eades III. 2019. Quantitative Program Reasoning with Graded Modal Types. Proc. ACM Program. Lang., 3, ICFP (2019), Article 110, 110:1–110:30 pages. Google ScholarGoogle ScholarDigital LibraryDigital Library
  81. Tomas Petricek, Dominic A. Orchard, and Alan Mycroft. 2014. Coeffects: a calculus of context-dependent computation. In Proc. of ICFP 2014. 123–135. Google ScholarGoogle ScholarDigital LibraryDigital Library
  82. J. Reed and B.C. Pierce. 2010. Distance makes the types grow stronger: a calculus for differential privacy. In Proc. of ICFP 2010. 157–168. Google ScholarGoogle Scholar
  83. Emily Riehl and Dominic Verity. 2022. Elements of ∞ -Category Theory. Cambridge University Press. https://doi.org/10.1017/9781108936880 Google ScholarGoogle ScholarCross RefCross Ref
  84. Barry K. Rosen. 1970. Tree-Manipulating Systems and Church-Rosser Theorems. In Proceedings of the 2nd Annual ACM Symposium on Theory of Computing, May 4-6, 1970, Northampton, Massachusetts, USA. ACM, 117–127. https://doi.org/10.1145/800161.805157 Google ScholarGoogle ScholarDigital LibraryDigital Library
  85. K.I. Rosenthal. 1990. Quantales and their applications. Longman Scientific & Technical. Google ScholarGoogle Scholar
  86. Richard Routley and Robert K. Meyer. 1972. The semantics of entailment - II. J. Philos. Log., 1, 1 (1972), 53–73. Google ScholarGoogle ScholarCross RefCross Ref
  87. Richard Routley and Robert K. Meyer. 1972. The semantics of entailment - III. J. Philos. Log., 1, 2 (1972), 192–208. Google ScholarGoogle ScholarCross RefCross Ref
  88. Richard Routley and Robert K. Meyer. 1973. The Semantics of Entailment. In Truth, Syntax and Modality, Hugues Leblanc (Ed.) (Studies in Logic and the Foundations of Mathematics, Vol. 68). Elsevier, 199 – 243. Google ScholarGoogle Scholar
  89. D. Sands. 1998. Improvement Theory and Its Applications. In Higher Order Operational Techniques in Semantics, A. D. Gordon and A. M. Pitts (Eds.). Cambridge University Press, 275–306. Google ScholarGoogle ScholarDigital LibraryDigital Library
  90. Gunther Schmidt. 2011. Relational Mathematics (Encyclopedia of Mathematics and its Applications, Vol. 132). Cambridge University Press. Google ScholarGoogle Scholar
  91. Mícheál Ó Searcóid. 2006. Metric Spaces. Springer London. Google ScholarGoogle Scholar
  92. L.A. Steen and J.A. Seebach. 1995. Counterexamples in Topology. Dover Publications. Google ScholarGoogle Scholar
  93. M. H. Stone. 1949. Postulates for the barycentric calculus. Ann. Mat. Pura Appl. (4), 29, 1 (1949), 25–30. https://doi.org/10.1007/BF02413910 Google ScholarGoogle ScholarCross RefCross Ref
  94. Isar Stubbe. 2014. An introduction to quantaloid-enriched categories. Fuzzy Sets Syst., 256 (2014), 95–116. https://doi.org/10.1016/j.fss.2013.08.009 Google ScholarGoogle ScholarDigital LibraryDigital Library
  95. Alfred Tarski. 1941. On the Calculus of Relations. J. Symb. Log., 6, 3 (1941), 73–89. https://doi.org/10.2307/2268577 Google ScholarGoogle ScholarCross RefCross Ref
  96. A. Thue. 1914. Probleme über Veränderungen von Zeichenreihen nach gegebenen Regeln. J. Dybwad. Google ScholarGoogle Scholar
  97. Alasdair Urquhart. 1972. Semantics for Relevant Logics. J. Symb. Log., 37, 1 (1972), 159–169. Google ScholarGoogle ScholarCross RefCross Ref
  98. Vincent van Oostrom and Yoshihito Toyama. 2016. Normalisation by Random Descent. In Proc. of FSCD 2016, Delia Kesner and Brigitte Pientka (Eds.) (LIPIcs, Vol. 52). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 32:1–32:18. https://doi.org/10.4230/LIPIcs.FSCD.2016.32 Google ScholarGoogle ScholarCross RefCross Ref
  99. C. Villani. 2008. Optimal Transport: Old and New. Springer Berlin Heidelberg. Google ScholarGoogle Scholar

Index Terms

  1. Elements of Quantitative Rewriting

      Recommendations

      Comments

      Login options

      Check if you have access through your login credentials or your institution to get full access on this article.

      Sign in

      Full Access

      • Article Metrics

        • Downloads (Last 12 months)223
        • Downloads (Last 6 weeks)30

        Other Metrics

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader
      About Cookies On This Site

      We use cookies to ensure that we give you the best experience on our website.

      Learn more

      Got it!