Formalizing Computational Paths and Fundamental Groups in Lean

Documenti analoghi

• The Seifert-van Kampen Theorem via Computational Paths: A Formalized Approach to Computing Fundamental Groups
  di: Ramos, Arthur F., et al.
  Pubblicazione: (2025)
• A Modular Lean 4 Framework for Confluence and Strong Normalization of Lambda Calculi with Products and Sums
  di: Ramos, Arthur, et al.
  Pubblicazione: (2025)
• Implicit automata in λ-calculi III: affine planar string-to-string functions
  di: Pradic, Cécilia, et al.
  Pubblicazione: (2024)
• Languages given by Finite Automata over the Unary Alphabet
  di: Czerwiński, Wojciech, et al.
  Pubblicazione: (2023)
• Probabilistic automatic complexity of finite strings
  di: Gill, Kenneth
  Pubblicazione: (2024)