Optimizing Optimal Reduction: A Type Inference Algorithm for Elementary Affine Logic
Paolo Coppola, Simone Martini
Abstract
We present a type inference algorithm for lambda-terms in Elementary Affine Logic using linear constraints. We prove that the algorithm is correct and complete.
Create a lesson
Related papers
Model Checking HyperRecHML is Decidable
Elli Anastasiadi, Kim Guldstrand Larsen, Martin Zimmermann
Two Variables and Two-Dimensional Structures
Bartosz Jan Bednarczyk, Daumantas Kojelis, Krzysztof Szymański
Reconstruction of continuous Archimedean t-norms from their section along an increasing curve
Gabriel Bauza-Llompart, Raquel Fernandez-Peralta, Marc Munar
Automating Observable Closure Analysis for Graph Transformation Models with MolFoundry
Marcel Friedrichs, Addie Jordon, Juri Kolčák et al.
Beyond LLM Judge: Mechanical Verification for Agentic Autoformalization
Anna Mei, Michael R. Douglas
Finite Satisfiability of Two-Variable Logic with Arbitrarily Many Successors
Artur Jeż, Jakub Michaliszyn, Piotr Witkowski