Compression for Coinductive Infinitary Rewriting: A Generic Approach, with Applications to Cut-Elimination for Non-Wellfounded Proofs

Documenti analoghi

• Infinitary Cut-Elimination for Non-Wellfounded Parsimonious Linear Logic
  di: Acclavio, Matteo, et al.
  Pubblicazione: (2023)
• Coalgebraic Non-Wellfounded Proofs: Recursiveness and GTC
  di: Kori, Mayuko
  Pubblicazione: (2026)
• The Constructive $μ$-calculus: Game Semantics and Non-Wellfounded Proof Systems
  di: Pacheco, Leonardo
  Pubblicazione: (2026)
• Finitary Simulation of Infinitary $β$-Reduction via Taylor Expansion, and Applications
  di: Cerda, Rémy, et al.
  Pubblicazione: (2022)
• Nominal Algebraic-Coalgebraic Data Types, with Applications to Infinitary Lambda-Calculi
  di: Cerda, Rémy
  Pubblicazione: (2025)