Imagen de Portada

Ohana trees, linear approximation and multi-types for the $λ$I-calculus: No variable gets left behind or forgotten!

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Cerda, Rémy, Manzonetto, Giulio, Saurin, Alexis
Formato:	Preprint
Publicado:	2025
Materias:	Logic in Computer Science Programming Languages F.4.2; F.3.1
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

How to play the Accordion: Uniformity and the (non-)conservativity of the linear approximation of the λ-calculus (extended version)
por: Cerda, Rémy, et al.
Publicado: (2023)

Metalevel transformation of strategies
por: Rubio, Rubén, et al.
Publicado: (2024)

The Orientation Boundary for Step-Duplicating Recursors: Mechanized Impossibility, Escape, and Certification
por: Rahnama, Moses
Publicado: (2025)

Gödel Mirror: A Formal System For Contradiction-Driven Recursion
por: Chan, Jhet
Publicado: (2025)

Automating proof search when equality is a logical connective
por: Chaudhuri, Kaustuv, et al.
Publicado: (2026)

Symmetries in Sorting
por: Choudhury, Vikraman, et al.
Publicado: (2025)

Formally Modelling the Rijkswaterstaat Tunnel Control Systems in a Constrained Industrial Environment
por: Jilissen, Kevin H. J., et al.
Publicado: (2024)

Termination of Innermost-Terminating Right-Linear Overlay Term Rewrite Systems (Full Version)
por: Nishida, Naoki
Publicado: (2026)

Rewriting Induction for Existentially Quantified Equations in Logically Constrained Rewriting (Full Version)
por: Nishida, Naoki, et al.
Publicado: (2026)

Abstract Framework for All-Path Reachability Analysis toward Safety and Liveness Verification (Full Version)
por: Kojima, Misaki, et al.
Publicado: (2026)

A Coq-based Axiomatization of Tarski's Mereogeometry
por: Barlatier, Patrick, et al.
Publicado: (2025)

Conjunctive categorial grammars and Lambek grammars with additives
por: Kuznetsov, Stepan L., et al.
Publicado: (2024)

The General and Finite Satisfiability Problems for PCTL are Undecidable
por: Chodil, Miroslav, et al.
Publicado: (2024)

A Real-Analytic Approach to Differential-Algebraic Dynamic Logic
por: Hellwig, Jonathan, et al.
Publicado: (2025)

The Thins Ordering on Relations
por: Voermans, Ed, et al.
Publicado: (2024)

Diagonals and Block-Ordered Relations
por: Backhouse, Roland, et al.
Publicado: (2024)

The Index and Core of a Relation. With Applications to the Axiomatics of Relation Algebra
por: Backhouse, Roland, et al.
Publicado: (2023)

Probabilistic Epistemic Dynamic Agentive Logic
por: Logan, Shay Allen
Publicado: (2026)

LeanLTL: A unifying framework for linear temporal logics in Lean
por: Vin, Eric, et al.
Publicado: (2025)

A Modular Lean 4 Framework for Confluence and Strong Normalization of Lambda Calculi with Products and Sums
por: Ramos, Arthur, et al.
Publicado: (2025)

Finitary Simulation of Infinitary $β$-Reduction via Taylor Expansion, and Applications
por: Cerda, Rémy, et al.
Publicado: (2022)

Bidirectional Interpolation for the Lambda-Calculus -- Revisiting and Formalising Craig-Čubrić Interpolation
por: Bertrand, Meven Lennon, et al.
Publicado: (2026)

Nominal Algebraic-Coalgebraic Data Types, with Applications to Infinitary Lambda-Calculi
por: Cerda, Rémy
Publicado: (2025)

Belief in Simplicial Complexes
por: Sink, Philip, et al.
Publicado: (2025)

A Note on Proper Relational Structures
por: Bjorndahl, Adam, et al.
Publicado: (2025)

A Type Theory for Probabilistic and Bayesian Reasoning
por: Adams, Robin, et al.
Publicado: (2015)

Propositional Dynamic Logic has Craig Interpolation: a tableau-based proof
por: Borzechowski, Manfred, et al.
Publicado: (2025)

Genericity Through Stratification
por: Arrial, Victor, et al.
Publicado: (2024)

EGGs are adhesive!
por: Biondo, Roberto, et al.
Publicado: (2025)

How to Verify a Turing Machine with Dafny
por: Lederer, Edgar F. A.
Publicado: (2026)

Infinitary Refinement Types for Temporal Properties in Scott Domains
por: Riba, Colin, et al.
Publicado: (2025)

Have a thing? Reasoning around recursion with dynamic typing in grounded arithmetic
por: Bobrow, Elliot, et al.
Publicado: (2025)

CBCL: Safe Self-Extending Agent Communication
por: O'Connor, Hugo
Publicado: (2026)

Automating the Derivation of Unification Algorithms: A Case Study in Deductive Program Synthesis
por: Waldinger, Richard
Publicado: (2025)

Refactoring-as-Propositions: Proved Refactoring of Hybrid Systems via Proved Refinements
por: Prebet, Enguerrand, et al.
Publicado: (2026)

Uniform Substitution for Differential Refinement Logic
por: Prebet, Enguerrand, et al.
Publicado: (2024)

Separation Logic of Generic Resources via Sheafeology
por: van Starkenburg, Berend, et al.
Publicado: (2025)

Generically Automating Separation Logic by Functors, Homomorphisms and Modules
por: Xu, Qiyuan, et al.
Publicado: (2024)

Verifying Tree-Manipulating Programs via CHCs
por: Faella, Marco, et al.
Publicado: (2025)

Simply-typed constant-domain modal lambda calculus I: distanced beta reduction and combinatory logic
por: Walsh, Sean
Publicado: (2024)