Context semantics, linear logic, and computational complexity
From MaRDI portal
Publication:2946582
DOI10.1145/1555746.1555749zbMath1351.03061arXivcs/0510092OpenAlexW2169724594MaRDI QIDQ2946582
Publication date: 17 September 2015
Published in: ACM Transactions on Computational Logic (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/cs/0510092
Complexity of computation (including implicit computational complexity) (03D15) Proof-theoretic aspects of linear logic and other substructural logics (03F52) Complexity of proofs (03F20)
Related Items (10)
Paths-based criteria and application to linear logic subsystems characterizing polynomial time ⋮ Characterizing polynomial and exponential complexity classes in elementary lambda-calculus ⋮ On Paths-Based Criteria for Polynomial Time Complexity in Proof-Nets ⋮ Unnamed Item ⋮ Linear dependent types in a call-by-value scenario ⋮ Geometry of resource interaction and Taylor–Ehrhard–Regnier expansion: a minimalist approach ⋮ Polynomial time in untyped elementary linear logic ⋮ Towards a geometry of recursion ⋮ Is the Optimal Implementation Inefficient? Elementarily Not ⋮ Implicit computation complexity in higher-order programming languages
This page was built for publication: Context semantics, linear logic, and computational complexity
