Intuitionistic Light Affine Logic
From MaRDI portal
Publication:5738953
DOI10.1145/504077.504081zbMath1365.03040OpenAlexW2133538984MaRDI QIDQ5738953
Publication date: 13 June 2017
Published in: ACM Transactions on Computational Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/504077.504081
Logic in computer science (03B70) Proof-theoretic aspects of linear logic and other substructural logics (03F52)
Related Items (24)
A type assignment for \(\lambda\)-calculus complete both for FPTIME and strong normalization ⋮ Linear Logic Properly Displayed ⋮ (Optimal) duplication is not elementary recursive ⋮ Phase semantics and decidability of elementary affine logic ⋮ Nonelementary Complexities for Branching VASS, MELL, and Extensions ⋮ Computational Complexity Via Finite Types ⋮ Light linear logics with controlled weakening: expressibility, confluent strong normalization ⋮ Light logics and optimal reduction: completeness and complexity ⋮ Controlling Program Extraction in Light Logics ⋮ An Elementary Affine λ-Calculus with Multithreading and Side Effects ⋮ Polynomial time in untyped elementary linear logic ⋮ Gödel's system \(\mathcal T\) revisited ⋮ Realizability models and implicit complexity ⋮ Type inference for light affine logic via constraints on words ⋮ Unnamed Item ⋮ Light Linear Logic with Controlled Weakening ⋮ Light types for polynomial time computation in lambda calculus ⋮ Bounded Linear Logic, Revisited ⋮ Some Complexity and Expressiveness Results on Multimodal and Stratified Proof Nets ⋮ Is the Optimal Implementation Inefficient? Elementarily Not ⋮ Linear logic by levels and bounded time complexity ⋮ Proof-Theoretic Semantics and Feasibility ⋮ On the expressivity of elementary linear logic: characterizing Ptime and an exponential time hierarchy ⋮ Implicit computation complexity in higher-order programming languages
This page was built for publication: Intuitionistic Light Affine Logic
