Two Views on Unification: Terms as Strategies

Authors Furio Honsell, Marina Lenisa , Ivan Scagnetto



PDF
Thumbnail PDF

File

LIPIcs.FSTTCS.2024.26.pdf
  • Filesize: 0.74 MB
  • 15 pages

Document Identifiers

Author Details

Furio Honsell
  • Department of Mathematics, Computer Science and Physics, University of Udine, Italy
Marina Lenisa
  • Department of Mathematics, Computer Science and Physics, University of Udine, Italy
Ivan Scagnetto
  • Department of Mathematics, Computer Science and Physics, University of Udine, Italy

Acknowledgements

The authors express their gratitude to the referees for their useful comments.

Cite As Get BibTex

Furio Honsell, Marina Lenisa, and Ivan Scagnetto. Two Views on Unification: Terms as Strategies. In 44th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 323, pp. 26:1-26:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024) https://doi.org/10.4230/LIPIcs.FSTTCS.2024.26

Abstract

In [Furio Honsell et al., 2024], the authors have shown that linear application in Geometry of Interaction (GoI) models of λ-calculus amounts to resolution between principal types of linear λ-terms. This analogy also works in the reverse direction. Indeed, an alternative definition of unification between algebraic terms can be given by viewing the terms to be unified as strategies, i.e. sets of pairs of occurrences of the same variable, and verifying the termination of the GoI interaction obtained by playing the two strategies. In this paper we prove that such a criterion of unification is equivalent to the standard one. It can be viewed as a local, bottom-up, definition of unification. Dually, it can be understood as the GoI interpretation of unification. The proof requires generalizing earlier work to arbitrary algebraic constructors and allowing for multiple occurrences of the same variable in terms. In particular, we show that two terms σ and τ unify if and only if R(σ) ⊆̂(τ) ;̂ ({R}(σ) ;̂ {R}(τ))^* and (τ) ⊆̂(σ) ;̂ ({R}(τ) ;̂ {R}(σ))^*, where {R}(σ) denotes the set of pairs of paths leading to the same variable in the term σ, ⊆̂ denotes "inclusion up to substitution" and ;̂ denotes "composition up to substitution".

Subject Classification

ACM Subject Classification
  • Theory of computation → Program semantics
  • Theory of computation → Linear logic
Keywords
  • unification
  • geometry of interaction
  • games

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads

References

  1. Samson Abramsky. A structural approach to reversible computation. Theoretical Computer Science, 347(3):441-464, 2005. URL: https://doi.org/10.1016/j.tcs.2005.07.002.
  2. Samson Abramsky, Esfandiar Haghverdi, and Philip Scott. Geometry of Interaction and linear combinatory algebras. Mathematical Structures in Computer Science, 12(5):625-665, 2002. URL: https://doi.org/10.1017/S0960129502003730.
  3. Samson Abramsky and Marina Lenisa. Linear realizability and full completeness for typed lambda-calculi. Annals of Pure and Applied Logic, 134(2):122-168, 2005. URL: https://doi.org/10.1016/j.apal.2004.08.003.
  4. Beniamino Accattoli, Ugo Dal Lago, and Gabriele Vanoni. The Machinery of Interaction. In Proceedings of the 22nd International Symposium on Principles and Practice of Declarative Programming, PPDP '20, New York, NY, USA, 2020. Association for Computing Machinery. URL: https://doi.org/10.1145/3414080.3414108.
  5. Beniamino Accattoli, Ugo Dal Lago, and Gabriele Vanoni. Multi types and reasonable space. Proc. ACM Program. Lang., 6(ICFP), August 2022. URL: https://doi.org/10.1145/3547650.
  6. Beniamino Accattoli, Ugo Dal Lago, and Gabriele Vanoni. Reasonable Space for the λ-Calculus, Logarithmically. In Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS '22, New York, NY, USA, 2022. Association for Computing Machinery. URL: https://doi.org/10.1145/3531130.3533362.
  7. Marc Bagnol. On the Resolution Semiring. Theses, Aix-Marseille Universite, December 2014. URL: https://theses.hal.science/tel-01215334.
  8. Patrick Baillot and Marco Pedicini. Elementary complexity and geometry of interaction. Fundamenta Informaticae, 45(1-2):1-31, 2001. URL: http://content.iospress.com/articles/fundamenta-informaticae/fi45-1-2-02.
  9. Alberto Ciaffaglione, Pietro Di Gianantonio, Furio Honsell, Marina Lenisa, Ivan Scagnetto, et al. λ!-calculus, Intersection Types, and Involutions. In Leibniz International Proceedings in Informatics, LIPIcs, volume 131. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Dagstuhl Publishing, 2019. Google Scholar
  10. Alberto Ciaffaglione, Furio Honsell, Marina Lenisa, Ivan Scagnetto, et al. The involutions-as-principal types/application-as-unification analogy. EPiC Series in Computing, 57:254-270, 2018. URL: https://doi.org/10.29007/NTWG.
  11. Pietro Di Gianantonio and Marina Lenisa. Principal Types as Lambda Nets. In Henning Basold, Jesper Cockx, and Silvia Ghilezan, editors, 27th International Conference on Types for Proofs and Programs (TYPES 2021), volume 239 of Leibniz International Proceedings in Informatics (LIPIcs), pages 5:1-5:23, Dagstuhl, Germany, 2022. Schloss Dagstuhl - Leibniz-Zentrum für Informatik. URL: https://doi.org/10.4230/LIPIcs.TYPES.2021.5.
  12. Boris Eng. An exegesis of transcendental syntax. Theses, Université Sorbonne Paris Nord, June 2023. URL: https://hal.science/tel-04179276.
  13. Jean-Yves Girard. Geometry of Interaction 1: Interpretation of System F. In R. Ferro, C. Bonotto, S. Valentini, and A. Zanardo, editors, Logic Colloquium '88, volume 127 of Studies in Logic and the Foundations of Mathematics, pages 221-260. Elsevier, 1989. URL: https://doi.org/10.1016/S0049-237X(08)70271-4.
  14. Jean-Yves Girard. Geometry of interaction 2: Deadlock-free algorithms. In Per Martin-Löf and Grigori Mints, editors, COLOG-88, pages 76-93, Berlin, Heidelberg, 1990. Springer Berlin Heidelberg. Google Scholar
  15. Jean-Yves Girard. Geometry of Interaction III: accommodating the additives. London Mathematical Society Lecture Note Series, pages 329-389, 1995. Google Scholar
  16. Jean-Yves Girard. Transcendental syntax I: deterministic case. Mathematical Structures in Computer Science, 27(5):827-849, 2017. URL: https://doi.org/10.1017/S0960129515000407.
  17. Furio Honsell. Talk delivered at IFIP W.G. 2.2 Bologna Meeting, 2023. Google Scholar
  18. Furio Honsell, Marina Lenisa, and Ivan Scagnetto. Λ-Symsym: An Interactive Tool for Playing with Involutions and Types. In Ugo de'Liguoro, Stefano Berardi, and Thorsten Altenkirch, editors, 26th International Conference on Types for Proofs and Programs (TYPES 2020), volume 188 of Leibniz International Proceedings in Informatics (LIPIcs), pages 7:1-7:18, Dagstuhl, Germany, 2021. Schloss Dagstuhl - Leibniz-Zentrum für Informatik. URL: https://doi.org/10.4230/LIPIcs.TYPES.2020.7.
  19. Furio Honsell, Marina Lenisa, and Ivan Scagnetto. Principal Types as Partial Involutions, 2024. URL: https://doi.org/10.48550/arXiv.2402.07230.
  20. Alberto Martelli and Ugo Montanari. An Efficient Unification Algorithm. ACM Trans. Program. Lang. Syst., 4(2):258-282, April 1982. URL: https://doi.org/10.1145/357162.357169.
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail