References

  1. A. Asperti & S. Guerrini (1998): The Optimal Implementation of Functional Programming Languages. Cambridge University Press.
  2. F. Baader & T. Nipkow (1998): Term Rewriting and All That. Cambridge University Press, doi:10.1017/CBO9781139172752.
  3. A. Bawden (1986): Connection Graphs. In: LFP 1986. ACM, pp. 258–265, doi:10.1145/319838.319868.
  4. G. Boudol (1985): Computational semantics of term rewriting systems. In: M. Nivat & J.C. Reynolds: Algebraic Methods in Semantics. Cambridge University Press, pp. 169–236.
  5. H.J.S. Bruggink (2008): Equivalence of Reductions in Higher-Order Rewriting. Utrecht University. Available at http://dspace.library.uu.nl/handle/1874/27575.
  6. A. Church & J.B. Rosser (1936): Some properties of conversion. Transactions of the American Mathematical Society 39, pp. 472–482, doi:10.1090/S0002-9947-1936-1501858-0.
  7. P. Dehornoy & alii (2015): Foundations of Garside Theory. European Mathematical Society, doi:10.4171/139.
  8. V.A. Gijsbers (2019): Time and Causality across the Sciences, chapter 4: On the Causal Nature of Time, pp. 49–71. Cambridge University Press, doi:10.1017/9781108592703.004.
  9. A. Guglielmi, T. Gundersen & M. Parigot (2010): A Proof Calculus Which Reduces Syntactic Bureaucracy. In: RTA 2010, LIPIcs 6. Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik, pp. 135–150, doi:10.4230/LIPIcs.RTA.2010.135.
  10. T. Hirschowitz (2013): Cartesian closed 2-categories and permutation equivalence in higher-order rewriting. LMCS 9(3), doi:10.2168/LMCS-9(3:10)2013.
  11. G. Huet & J.-J. Lévy (1991): Computations in Orthogonal Rewriting Systems, Part \calc@A \calc@Acountłet \calc@B \calc@Bcount \calc@B \calc@A \calc@B \calc@A (calc) Package calc Error: `' invalid at this pointSee the calc package documentation for explanation.I expected to see one of: + - * / )\calc@A 1!\calc@A \calc@B \c@Romancnt \calc@B V + \calc@A \calc@Acountłet \calc@B \calc@Bcount \calc@B \calc@A \calc@B \calc@A (calc) Package calc Error: `' invalid at this pointSee the calc package documentation for explanation.I expected to see one of: + - * / )\calc@A 2!\calc@A \calc@B \c@Romancnt \calc@B V. In: J.L. Lassez & G.D. Plotkin: Computational Logic – Essays in Honor of Alan Robinson. MIT Press, pp. 395–443. Update of: Call-by-need computations in non-ambiguous linear term rewriting systems, 1979.
  12. A. Joyal & R. Street (1991): The geometry of tensor calculus,łet \calc@A \calc@Acountłet \calc@B \calc@Bcount \calc@B \calc@A \calc@B \calc@A (calc) Package calc Error: `' invalid at this pointSee the calc package documentation for explanation.I expected to see one of: + - * / )\calc@A 1!\calc@A \calc@B \c@Romancnt \calc@B V. Advances in Mathematics 88(1), pp. 55–112, doi:10.1016/0001-8708(91)90003-P.
  13. Z. Khasidashvili & J.R.W. Glauert (1996): Discrete Normalization and Standardization in Deterministic Residual Structures. In: ALP'96, LNCS 1139. Springer, pp. 135–149, doi:10.1007/3-540-61735-3_9.
  14. Z. Khasidashvili & J.R.W. Glauert (2002): Relating conflict-free stable transition and event models via redex families. TCS 286(1), pp. 65–95, doi:10.1016/S0304-3975(01)00235-3.
  15. J.W. Klop (1980): Combinatory Reduction Systems. Rijks\-uni\-ver\-si\-teit Utrecht.
  16. Y. Lafont (1990): Interaction Nets. In: 17th POPL. ACM Press, pp. 95–108, doi:10.1145/96709.96718.
  17. C. Laneve (1994): Distributive Evaluations of lambda-calculus. Fundam. Informaticae 20(4), pp. 333–352, doi:10.3233/FI-1994-2043.
  18. J.-J. Lévy (1978): Réductions correctes et optimales dans le λ-calcul. Thèse de doctorat d'état. Université Parisłet \calc@A \calc@Acountłet \calc@B \calc@Bcount \calc@B \calc@A \calc@B \calc@A (calc) Package calc Error: `' invalid at this pointSee the calc package documentation for explanation.I expected to see one of: + - * / )\calc@A 7!\calc@A \calc@B \c@Romancnt \calc@B V. Available at http://pauillac.inria.fr/~levy/pubs/78phd.pdf.
  19. P.-A. Melliès (1996): Description Abstraite des Systèmes de Réécriture. Thèse de doctorat. Université Parisłet \calc@A \calc@Acountłet \calc@B \calc@Bcount \calc@B \calc@A \calc@B \calc@A (calc) Package calc Error: `' invalid at this pointSee the calc package documentation for explanation.I expected to see one of: + - * / )\calc@A 7!\calc@A \calc@B \c@Romancnt \calc@B V. Available at http://www.irif.fr/~mellies/phd-mellies.pdf.
  20. P.-A. Melliès (2005): Axiomatic Rewriting Theoryłet \calc@A \calc@Acountłet \calc@B \calc@Bcount \calc@B \calc@A \calc@B \calc@A (calc) Package calc Error: `' invalid at this pointSee the calc package documentation for explanation.I expected to see one of: + - * / )\calc@A 1!\calc@A \calc@B \c@Romancnt \calc@B V: A Diagrammatic Standardization Theorem. In: Essays Dedicated to Jan Willem Klop, LNCS 3838. Springer, pp. 554–638, doi:10.1007/11601548_23.
  21. J. Meseguer (1992): Conditional rewriting logic as a unified model of concurrency. Theoretical Computer Science 96, pp. 73–155, doi:10.1016/0304-3975(92)90182-F.
  22. M.H.A. Newman (1942): On theories with a combinatorial definition of ``equivalence''. Annals of Mathematics 43, pp. 223–243, doi:10.2307/2269299.
  23. V. van Oostrom (2004): Sub-Birkhoff. In: FLOPS 2004, LNCS 2998. Springer, pp. 180–195, doi:10.1007/978-3-540-24754-8_14.
  24. V. van Oostrom (2020): Some symmetries of commutation diamonds. In: IWC 2020, pp. 1–7. Available at http://iwc2020.cic.unb.br/iwc2020_proceedings.pdf.
  25. V. van Oostrom, K.J. van de Looij & M. Zwitserlood (2004): Lambdascope. In: ALPS 2004, pp. 9. Available at http://www.javakade.nl/research/pdf/lambdascope.pdf.
  26. V. van Oostrom & F. van Raamsdonk (1994): Weak Orthogonality Implies Confluence: The Higher Order Case. In: LFCS'94, LNCS 813. Springer, pp. 379–392, doi:10.1007/3-540-58140-5_35.
  27. J. Pearl (2009): Causality: models, reasoning, and inference, 2nd edition. Cambridge University Press, doi:10.1017/CBO9780511803161.
  28. G.D. Plotkin & V.R. Pratt (1996): Teams can see pomsets. In: D.A. Peled, V.R. Pratt & G.J. Holzmann: Partial Order Methods in Verification, Proceedings of a DIMACS Workshop, Princeton, New Jersey, USA, July 24-26, 1996, DIMACS Series in Discrete Mathematics and Theoretical Computer Science 29. DIMACS/AMS, pp. 117–128, doi:10.1090/dimacs/029/07.
  29. D. Pous (2010): Untyping Typed Algebraic Structures and Colouring Proof Nets of Cyclic Linear Logic. In: A. Dawar & H. Veith: Computer Science Logic, 24th International Workshop, CSL 2010, 19th Annual Conference of the EACSL, Brno, Czech Republic, August 23-27, 2010. Proceedings, LNCS 6247. Springer, pp. 484–498, doi:10.1007/978-3-642-15205-4_37.
  30. T. Rowland & E.W. Weisstein: Causal Network. Available at https://mathworld.wolfram.com/CausalNetwork.html.
  31. M. Shanahan (2016): The Frame Problem. In: E.N. Zalta: The Stanford Encyclopedia of Philosophy, Spring 2016 edition. Metaphysics Research Lab, Stanford University.
  32. C.L. Smith (2017): Optimal Sharing Graphs for Substructural Higher-order Rewriting Systems. University of Kent. Available at https://kar.kent.ac.uk/63884/.
  33. E.W. Stark (1989): Concurrent Transition Systems. TCS 64, pp. 221–269, doi:10.1016/0304-3975(89)90050-9.
  34. C.A. Stewart (2002): Reducibility between Classes of Port Graph Grammar. J. Comput. Syst. Sci. 65(2), pp. 169–223, doi:10.1006/jcss.2002.1814.
  35. Terese (2003): Term Rewriting Systems. Cambridge University Press.
  36. A. Visser (2011): On the ambiguation of Polish notation. Theoretical Computer Science 412(28), pp. 3404–3411, doi:10.1016/j.tcs.2011.01.025. Festschrift in Honour of Jan Bergstra.
  37. G. Winskel (1989): An introduction to event structures. In: Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, LNCS 354. Springer, pp. 364–397, doi:10.1007/BFb0013026.
  38. S. Wolfram (2002): A New Kind of Science. Available at https://www.wolframscience.com/nks/.
  39. S. Wolfram (2020): A Class of Models with the Potential to Represent Fundamental Physics. Complex Systems 28(2), pp. 107–536, doi:10.25088/ComplexSystems.29.1.2.
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org